Zafar Iqbal Khan

Zafar Iqbal Khan

Auto-generated profile, based on publicly available information

Zafar Iqbal Khan

Department of Software Engineering, National University of Modern Languages, Islamabad, Pakistan

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 January 2025 in IEEE Access
Verified
Journal Article
Open access
ZKZafar Iqbal Khan
Zafar Iqbal Khan
MKMuzafar Khan
Muzafar Khan
SSSyed Nasir Mehmood Shah
Syed Nasir Mehmood Shah
Scheduling techniques are essential to increase resource utilization and task execution within modern computing environments. Round Robin Scheduling (RR) ensures a fair distribution of processes needing attention but often leads to inefficiencies in systems with heterogeneous tasks or different priorities due to large latency or resource usage differences. To address such problems, this paper introduces the Agent-based Adaptive Dynamic Round Robin (AADRR) process scheduling technique, which enhances process scheduling by continuously adjusting the time quantum and criteria, combining CPU burst time and priority. In the proposed AADRR, all processes are ranked dynamically by a software agent based on user preferences and current system load. This agent operates independently by keeping an eye on system parameters and making the required adjustments in real-time without requiring human intervention. We place processes in the queue according to their order of importance. A dynamic time quantum policy is suitable whenever it meets the mean duration of each process in the queue. Every round has the time quantum adjusted based on this method average burst time. AADRR highlights that the short processes are managed properly and the long processes are completed within a few rounds to fairly complete and maintain all the processes in the system. The proposed AADRR is more suitable for periodic tasks that employ a dynamic scheduling system and adapt time quantum according to the system state and job features. Additionally, AADRR efficiently manages preemptable tasks, using dynamic scheduling policies to accommodate variations in process priority and CPU burst times, ensuring fair scheduling, efficient resource utilization, and dynamic adaptability. To validate the effectiveness of the AADRR algorithm, we performed a comparative performance analysis with twelve other algorithms, including five traditional CPU scheduling algorithms and seven advanced job scheduling techniques, demonstrating optimal performance results. In our experiments, synthetic workload traces were generated using the Monte Carlo probability distribution method, which is scientifically recommended for creating diverse workload traces. Small, medium, and large datasets were used, with the small workload traces obtained from published studies and the large traces produced by the Monte Carlo simulation. AADRR efficiently reduces average turnaround times and average waiting times for each workload and performs better in response time. AADRR may not always provide the most favorable measures in all scenarios. Still, it performs better than other scheduling techniques in system performance, while being more efficient and flexible for different workloads.

20 March 2026 in IEEE Access
Verified
Journal Article
Open access
ZKZafar Iqbal Khan
Zafar Iqbal Khan
MKMuzafar Khan
Muzafar Khan
SSSyed Nasir Mehmood Shah
Syed Nasir Mehmood Shah
Task scheduling is required to optimize the use of resources and minimize the waiting time in cloud computing systems. However, the traditional fixed scheduling techniques cannot address the variability, heterogeneity and dynamic behavior of cloud workloads. Current timesharing schedulers use fixed CPU time quantum and do not have any dynamic mechanisms to adapt to the workload, and SLA-driven priorities, resulting in poor performance of cloud infrastructures. To overcome these drawbacks, this paper proposes a novel Multi-Agent Adaptive Dynamic Round Robin (MAADRR) scheduling model for dynamic and heterogeneous cloud systems. Compared with traditional single-layer schedulers, MAADRR has hierarchical agent-based coordination. This allows it to balance workloads across the infrastructure and have local flexibility simultaneously. The framework is implemented and evaluated on the CloudSim Plus simulator and enables realistic modelling of the multi-level cloud execution environment. The VM-level agents Adaptive Round Robin are dynamically changed by real-time quantum due to real-time workload feedback. A global coordination agent, which exists at the infrastructure layer, integrates the previously set scheduling strategies, such as Dynamic Max-Min, DRALBA, PSSLB, PSSELB, and DeRALBA, to coordinate the distribution of different tasks among the heterogeneous resources. This multi-agent design is cooperative and provides autonomous local optimization, stability, and fairness of the system. The experiments were conducted on workloads of varying sizes. The experimental results obtained from Google-Cluster-like Job (GoCJ) traces demonstrate that MAADRR is a more energy-efficient solution and outperforms the baseline methods in terms of Energy Consumption, Throughput, Average Waiting Time (AWT), Average Turnaround Time (ATAT), and Total Completion Time (TCT). The findings confirm that MAADRR is a scalable scheduling framework that is suitable for cloud environments.