i-manager Publications

Simulation of Real Time Multiprocessor Static Scheduling Algorithms

Madhu Kumar Patnala*, R. Nagendra**

*_**Assistant Professor (SL), Center for VLSI & Embedded Systems, Sree Vidyanikethan Engineering College, Tirupati, Andhra Pradesh, India.

Periodicity:July - December'2018
DOI : https://doi.org/10.26634/jes.7.1.15134

Abstract

Real Time Systems are time bound systems. Their efficiency is dependent on logical correctness as well as strict timeframe within which they react to an event. Completion within deadline is stressed especially in hard real time systems. Modern embedded hardware implementations choose multiprocessor architectures to support multitasking. Multiprocessor scheduling problem can be broken down in terms of task to processor assignment prior to uniprocessor scheduling problem. Suitable task to processor allocation strategy to uniprocessor scheduling algorithms like RMA and EDF for developing multiprocessor scheduler can be combined. This paper demonstrates simulation of Utilization Balancing algorithm for EDF, Next-fit algorithm for RMA, Bin packing algorithms for EDF using C language and TORSCHE tool box for MATLAB. The Objective of this work is to analyze various static scheduling algorithms for usage in multiprocessor based embedded systems.

Keywords

Multiprocessor Scheduling, Multiprocessor Task Allocation, RMA, EDF, UBA, Next-fit, Bin packing algorithms.

How to Cite this Article?

Patnala,M.K.,and Nagendra,R.(2018). Simulation of Real Time Multiprocessor Static Scheduling Algorithms. i-manager's Journal on Embedded Systems,7(1),30-36. https://doi.org/10.26634/jes.7.1.15134

References

[1]. Anderson, J. H., & Srinivasan, A. (2000). Early-release fair scheduling. In Real-Time Systems, 2000. Euromicro RTS 2000. 12^thEuromicro Conference on (pp. 35-43). IEEE.

[2]. Andersson, B., & Jonsson, J. (2003, July). The utilization bounds of partitioned and pair static-priority scheduling on multiprocessors are 50%. In Real-Time Systems, 2003. Proceedings. 15^th Euromicro Conference on (pp. 33-40). IEEE.

[3]. Carpenter, J., Funk, S., Holman, P., Srinivasan, A., Anderson, J. H., & Baruah, S. K. (2004). A categorization of real-time multiprocessor scheduling problems and algorithms. In Handbook of Scheduling Algorithms, Methods, and Models. Chapman Hall/CRC, Boca.

[4]. Funk, S., Goossens, J., & Baruah, S. (2001, December). On-line scheduling on uniform multiprocessors. In RTSS (p. 183-192). IEEE.

[5]. Goossens, J., & Richard, P. (2004, April). Overview of real-time scheduling problems. In Euro Workshop on Project Management and Scheduling.

[6]. Hemanth, R., & Kumar, P. M. (2014). Real time usercentric energy efficient scheduling in embedded systems. i-manager's Journal on Embedded Systems, 3(3), 31-38.

[7]. Leung, J. Y. (Ed.). (2004). Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, Boca Raton, FL, USA.

[8]. Mall, R. (2009). Real-time Systems: Theory and Practice. Pearson Education India.

[9]. Perkins, C. (2005). Course Notes: Overview of Real- Time Scheduling, Real-Time and Embedded Systems (M) Lecture 3. University of Glasgow, Department of Computing Science Academic Year 2004-2005.

Simulation of Real Time Multiprocessor Static Scheduling Algorithms

Abstract

Keywords

How to Cite this Article?

References

If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Options for accessing this content:

	North Americas,UK, Middle East,Europe		India	Rest of world
	USD	EUR	INR	USD-ROW
Pdf	35	35	200	20
Online	35	35	200	15
Pdf & Online	35	35	400	25