Abstract
Hard real-time tasks are associated with strict deadlines. Classical scheduling heuristics ensure fairness among tasks and prevent deadlock, but are not concerned with deadline compliance. Hence, there is a need for scheduling heuristics which prioritize tasks in a real-time system in a manner which guarantees timely completion of maximum number of tasks. In this paper, several static heuristics for mapping hard real-time tasks to machines in a heterogeneous distributed system have been described. These heuristics differ in their method of prioritizing tasks for scheduling, which results in varied performance. The heuristics have been outlined and simulated using a common set of assumptions. The performance parameter considered in this study is the number of user satisfied tasks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Eshagian, M.M.: Heterogeneous computing. Artech House, Norwood (1996)
Ramamritham, K., Stankovic, J.A., Shiah, P.F.: Efficient scheduling algorithms for real-time multiprocessor systems. IEEE Transactions on Parallel and Distributed Systems 1, 184–194 (1990)
Stankovic, J.A., Spuri, M., Natale, M.D., Buttazzo, G.: Implications of classical scheduling results for real-time systems. IEEE Computer 28, 16–25 (1995)
Gantman, A., Guo, P., Lewis, J., Rashid, F.: Scheduling real-time tasks in distributed systems: A survey (1998)
Ali, S., Siegel, H.J., Maheswaran, M., Hengsen, D.: Task execution time modelling for heterogeneous computing. In: IPDPS Workshop on Heterogeneous Computing, Cancun, Mexico, pp. 185–199 (2000)
Dogan, A., Ozguner, F.: On QoS-based scheduling of a meta-task with multiple QoS demands in heterogeneous computing. In: Int’l Parallel and Distributed Processing Symposium, Fort Lauderdale, FL (2002)
Braun, T.D., Siegel, H.J., Beck, N., Boloni, L.L., Maheswaran, M., Reuther, A.L., Robertson, J.P., Theys, M.D., Yao, B., Hensgen, D., Freund, R.F.: A comparison study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems. In: 8th IEEE Workshop on Heterogeneous Computing Systems (HCW 1999), San Juan, Puerto Rico, pp. 15–29 (1999)
Maheswaran, M.: Quality of service driven resource management algorithms for network computing. In: Int’l Conf. on Parallel and Distributed Processing Techniques and Applications, Las Vegas, NV, pp. 1090–1096 (1999)
Maheswaran, M., Ali, S., Siegel, H.J., Hengsen, D., Freund, R.F.: Dynamic matching and scheduling of a class of independent tasks onto heterogeneous computing systems. In: Heterogeneous Computing Workshop, San Juan, Puerto Rico, pp. 30–44 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Golconda, K.S., Doğan, A., Özgüner, F. (2004). Static Mapping Heuristics for Tasks with Hard Deadlines in Real-Time Heterogeneous Systems. In: Aykanat, C., Dayar, T., Körpeoğlu, İ. (eds) Computer and Information Sciences - ISCIS 2004. ISCIS 2004. Lecture Notes in Computer Science, vol 3280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30182-0_83
Download citation
DOI: https://doi.org/10.1007/978-3-540-30182-0_83
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23526-2
Online ISBN: 978-3-540-30182-0
eBook Packages: Springer Book Archive