Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2010-03-28
Computer Science
Distributed, Parallel, and Cluster Computing
Scientific paper
Minimizing waiting time for tasks waiting in the queue for execution is one of the important scheduling cri-teria which took a wide area in scheduling preemptive tasks. In this paper we present Changeable Time Quan-tum (CTQ) approach combined with the round-robin algorithm, we try to adjust the time quantum according to the burst times of the tasks in the ready queue. There are two important benefits of using (CTQ) approach: minimizing the average waiting time of the tasks, consequently minimizing the average turnaround time, and keeping the number of context switches as low as possible, consequently minimizing the scheduling overhead. In this paper, we consider the scheduling problem for preemptive tasks, where the time costs of these tasks are known a priori. Our experimental results demonstrate that CTQ can provide much lower scheduling overhead and better scheduling criteria.
No associations
LandOfFree
Improving Waiting Time of Tasks Scheduled Under Preemptive Round Robin Using Changeable Time Quantum does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Improving Waiting Time of Tasks Scheduled Under Preemptive Round Robin Using Changeable Time Quantum, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improving Waiting Time of Tasks Scheduled Under Preemptive Round Robin Using Changeable Time Quantum will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-127592