کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
432756 | 689063 | 2012 | 14 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Efficient real-time divisible load scheduling Efficient real-time divisible load scheduling](/preview/png/432756.png)
Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is being made in scheduling arbitrarily divisible loads, current approaches are not efficient and do not scale well. In this paper, we propose a linear algorithm for real-time divisible load scheduling. Unlike existing approaches, the new algorithm relaxes the tight coupling between the task admission controller and the task dispatcher. By eliminating the need to generate exact schedules in the admission controller, the algorithm avoids high overheads. We also proposed a hybrid algorithm that combines the best of our efficient algorithm and a previously best-known approach. We experimentally evaluate the new algorithm. Simulation results demonstrate that the algorithm scales well, can schedule large numbers of tasks efficiently, and performs similarly to existing approaches in terms of providing real-time guarantees.
► We developed an efficient algorithm for real-time divisible load scheduling.
► Our algorithm’s time complexity is linear to the number of tasks and nodes.
► We integrated our efficient algorithm with the previously best-known approach.
Journal: Journal of Parallel and Distributed Computing - Volume 72, Issue 12, December 2012, Pages 1603–1616