Muhammad Ijaz Khan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Muhammad Ijaz Khan has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
A. Naga Kalyani
Department of CSE (AI and ML), BVRIT Hyderabad College of Engineering for Women, Hyderabad, India
1 shared publicationBander A. Jabr
Department of Computer Engineering, College of Computer and Information Sciences, King Saud University, Riyadh, Saudi Arabia
1 shared publicationBarno Sayfutdinovna Abdullaeva
Department of Mathematics and Information Technologies, Vice-Rector for Scientific Affairs, Tashkent State Pedagogical University, Tashkent, Uzbekistan
1 shared publicationD. Krishna Madhuri
Department of DS and AI, Faculty of Science and Technology (IcfaiTech), ICFAI Foundation for Higher Education, Hyderabad, India
1 shared publicationEmad A. A. Ismail
Dept. of Quantitative Analysis, College of Business Administration, King Saud University, Riyadh, Saudi Arabia
1 shared publicationFawad A. Awwad
Dept. of Quantitative Analysis, College of Business Administration, King Saud University, Riyadh, Saudi Arabia
1 shared publication
Latest Publications
- Open Access
- 19 September 2024
- Published by Springer Nature in Scientific Reports
- Vol. 14 (1) , 1-38
Efficient deep reinforcement learning based task scheduler in multi cloud environment
Task scheduling problem (TSP) is huge challenge in cloud computing paradigm as number of tasks comes to cloud application platform vary from time to time and all the tasks consists of variable length, runtime capacities. All these tasks may generated from various heterogeneous resources which comes onto cloud console directly effects the performance of cloud paradigm with increase in makespan, energy consumption, resource costs. Traditional task scheduling algorithms cannot handle these type of complex workloads in cloud paradigm. Many authors developed Task Scheduling algorithms by using metaheuristic techniques, hybrid approaches but all these algorithms give near optimal solutions but still TSP is a highly challenging and dynamic scenario as it resembles NP hard problem. Therefore, to tackle the TSP in cloud computing paradigm and schedule the tasks in an effective way in cloud paradigm, we formulated Adaptive Task scheduler which segments all the tasks comes to cloud console as sub tasks and fed these to the scheduler which is modeled by Improved Asynchronous Advantage Actor Critic Algorithm(IA3C) to generate schedules. This scheduling process is carried out in two stages. In first stage, all incoming tasks are segmented as sub tasks. After segmentation, all these sub tasks according to their size, execution time, communication time are grouped together and fed to the (ATSIA3C) scheduler. In the second stage, it checks for the above said constraints and disperse them onto the corresponding suitable processing capacity VMs resided in datacenters. Proposed ATSIA3C is simulated on Cloudsim. Extensive simulations are conducted using both fabricated worklogs and as well as realtime supercomputing worklogs. Our proposed mechanism evaluated over baseline algorithms i.e. RATS-HM, AINN-BPSO, MOABCQ. From results it is evident that our proposed ATSIA3C outperforms existing task schedulers by improving makespan by 70.49%. Resource cost is improved by 77.42%. Energy Consumption is improved over compared algorithms 74.24% in multi cloud environment by proposed ATSIA3C.
- 19 September 2024
- Published by Springer Nature in Scientific Reports
- Vol. 14 (1) , 1-38
Open AccessEfficient deep reinforcement learning based task scheduler in multi cloud environment
Task scheduling problem (TSP) is huge challenge in cloud computing paradigm as number of tasks comes to cloud application platform vary from time to time and all the tasks consists of variable length, runtime capacities. All these tasks may generated from various heterogeneous resources which comes onto cloud console directly effects the performance of cloud paradigm with increase in makespan, energy consumption, resource costs. Traditional task scheduling algorithms cannot handle these type of complex workloads in cloud paradigm. Many authors developed Task Scheduling algorithms by using metaheuristic techniques, hybrid approaches but all these algorithms give near optimal solutions but still TSP is a highly challenging and dynamic scenario as it resembles NP hard problem. Therefore, to tackle the TSP in cloud computing paradigm and schedule the tasks in an effective way in cloud paradigm, we formulated Adaptive Task scheduler which segments all the tasks comes to cloud console as sub tasks and fed these to the scheduler which is modeled by Improved Asynchronous Advantage Actor Critic Algorithm(IA3C) to generate schedules. This scheduling process is carried out in two stages. In first stage, all incoming tasks are segmented as sub tasks. After segmentation, all these sub tasks according to their size, execution time, communication time are grouped together and fed to the (ATSIA3C) scheduler. In the second stage, it checks for the above said constraints and disperse them onto the corresponding suitable processing capacity VMs resided in datacenters. Proposed ATSIA3C is simulated on Cloudsim. Extensive simulations are conducted using both fabricated worklogs and as well as realtime supercomputing worklogs. Our proposed mechanism evaluated over baseline algorithms i.e. RATS-HM, AINN-BPSO, MOABCQ. From results it is evident that our proposed ATSIA3C outperforms existing task schedulers by improving makespan by 70.49%. Resource cost is improved by 77.42%. Energy Consumption is improved over compared algorithms 74.24% in multi cloud environment by proposed ATSIA3C.
- Open Access
- 28 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 136541-136551
Performance Analysis of Cycle GAN in Photo to Portrait Transfiguration Using Deep Learning Optimizers
In the realm of computer vision, image transformations play a pivotal role across various domains such as healthcare, image enhancement, artist painting identification, genome sequencing, and more. While supervised learning demands a substantial volume of annotated images for training models, Cycle-GAN emerges as a potent solution for training models with fewer paired sources and target images in an unsupervised manner. This study introduces a novel system aimed at generating Monet-style paintings from realistic images, leveraging the Cycle-GAN methodology. Given the scarcity of Monet paintings, our system employs a combination of generator and discriminator neural networks to produce new Monet-style artworks. The model is trained using Cycle-GAN in conjunction with deep learning optimizers like RMSprop, ADAM, and SGD. The training dataset, Monet2Photo, comprises two distinct image categories: Monet paintings (300 samples) and natural photographs (7028 samples). The Monet-style images are utilized for training the model, while the raw photo images serve as the test set. Notably, the proposed model exhibits commendable performance, particularly when utilizing the SGD optimizer, as evidenced by favorable outcomes in terms of generator and discriminator losses.
- 28 November 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 136541-136551
Open AccessPerformance Analysis of Cycle GAN in Photo to Portrait Transfiguration Using Deep Learning Optimizers
In the realm of computer vision, image transformations play a pivotal role across various domains such as healthcare, image enhancement, artist painting identification, genome sequencing, and more. While supervised learning demands a substantial volume of annotated images for training models, Cycle-GAN emerges as a potent solution for training models with fewer paired sources and target images in an unsupervised manner. This study introduces a novel system aimed at generating Monet-style paintings from realistic images, leveraging the Cycle-GAN methodology. Given the scarcity of Monet paintings, our system employs a combination of generator and discriminator neural networks to produce new Monet-style artworks. The model is trained using Cycle-GAN in conjunction with deep learning optimizers like RMSprop, ADAM, and SGD. The training dataset, Monet2Photo, comprises two distinct image categories: Monet paintings (300 samples) and natural photographs (7028 samples). The Monet-style images are utilized for training the model, while the raw photo images serve as the test set. Notably, the proposed model exhibits commendable performance, particularly when utilizing the SGD optimizer, as evidenced by favorable outcomes in terms of generator and discriminator losses.