Abstract
This paper presents an algorithm to schedule aperiodic jobs on a cluster system. A cluster consists of one dispatcher and multiple schedulers. The algorithm is optimal for the response time of each aperiodic job. Aperiodic jobs are partitioned into phases and assigned deadlines by the dispatcher. With the deadline, the aperiodic jobs can be scheduled uniformly under EDF (Earliest Deadline First) together with periodic jobs. With rigorous theoretical analysis and proof, we have that even if the dispatcher has no scheduling information, the algorithm can still dispatch the aperiodic jobs onto the proper scheduler to achieve optimal response time and also guarantee the deadline requirements of periodic jobs.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
T. P. Baker, “Stack-Based Scheduling of Real-Time Processes”, The Journal of Real-Time System, 3(1), 1991, pp. 67–100.
A. Burchard, J. Liebeherr, Y. Oh, and S. H. Son, “New Strategies for Assigning Realtime Tasks to Multiprocessor Systems”, IEEE Trans. on Computers, 44(12): 1429–1442, 1995.
G. C. Buttazzo and F. Sensini, “Optimal Deadline Assignment for Scheduling Soft Aperiodic Tasks in Hard Real-time Environment”, Proc. of the 3 rd IEEE International Conference on Engineering of Complex Computer Systems, September 1997, pp. 39–48.
R. Buyya (Ed.), High Performance Cluster Computing, Prentice Hall, 1999.
M. Caccamo, G. Lipari, and G. Buttazzo, “Sharing Resources with the TB* Server”, Technical Report TR 04-99, Retis Lab, Scuola Superiore S.Anna, April 1999.
M. Colajanni, P. S. Yu, and D. M. Dias, “Scheduling Algorithms for Distributed Web Servers,” Proceedings of ICDCS’97, 1997.
J. P. Lehoczky and S. Ramos-Thuel, “An Optimal Algorithm for Scheduling Soft-Aperiodic Tasks in Fixed-Priority Preemptive Systems”, Proc. of Real-Time Systems Symposium, 1992, pp. 110–123.
C. L. Liu and J. W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment”, JACM, 20(1): 46–61, 1973.
Y. Oh and S. Son, “Allocating Fixed-Priority Periodic Tasks on Multiprocessor Systems”, The Real-Time Systems Journal, 9:207–239, 1995.
M. Spuri and G.C. Buttazzo, “Efficient Aperiodic Service under Earliest Deadline Scheduling”, Proc. of the IEEE Real-Time Systems Symposium, December 1994.
M. Spuri and G. Buttazzo, “Scheduling Aperiodic Tasks in Dynamic Priority Systems”, The Journal of Real-Time Systems, 10(2), 1996.
J. K. Strosnider, J. P. Lehoczky, and L. Sha, “The Deferrable Server Algorithm for Enhanced Aperiodic Responsiveness in Hard Real-Time Environments,” IEEE Transactions on Computers, 44(1), January 1995.
T. S. Tia, J. W. S. Liu, and M. Shankar, “Algorithm and Optimality of Scheduling Aperiodic Requests in Fixed-Priority Preemptive Systems”, The Journal of Real-Time Systems, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, L., Jin, H., Chen, Y., Han, Z. (2001). Optimal Scheduling of Aperiodic Jobs on Cluster. In: Sakellariou, R., Gurd, J., Freeman, L., Keane, J. (eds) Euro-Par 2001 Parallel Processing. Euro-Par 2001. Lecture Notes in Computer Science, vol 2150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44681-8_108
Download citation
DOI: https://doi.org/10.1007/3-540-44681-8_108
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42495-6
Online ISBN: 978-3-540-44681-1
eBook Packages: Springer Book Archive