Abstract
Most periodic tasks are assigned to processors using partition scheduling policy after checking feasibility conditions. A new approach is proposed for scheduling aperiodic tasks with periodic task system on multiprocessor system with less number of preemptions. Our approach is self-configurable and adjusts the periodic tasks to the processor such that different types of tasks are scheduled without violating deadline constraints. The new approach proves that when all different types of tasks are scheduled, it leads to better performance.
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.
References
Liu, C., LayLand, J.: Scheduling Algorithms for Multiprogramming in Hard Real–Time Environment. JACM 10(1), 174–189 (1973)
Prashanth Rao, A., Govardhan, A.: An Improved Period Oriented Scheduling Algorithm for Real Time Systems. Ijesce Research Science Press 3(1) (January-June 2011)
Cheng, S., Stankovic, J.A., Ramamritham, K.: Scheduling Algorithm for Hard Real Time Systems: A Brief Survey. In: Tutorial: Hard Real Time Systems, pp. 150–173. EFF Press (1988)
Gafford, J.D.: Rate Monotonic Scheduling. IEE Micro, 34–39 (June 1991); Liu, J.W.S.: Real Time Systems, IInd edn. Pearson Education (1991)
Johnson, D.S.: Near Optimal Bin Packing Algorithms, PhD Thesis. MIT (1973)
Buttazzo, G.C.: Hard Real-Time Computing Systems Predictable Scheduling Algorithms and Applications. Kluwer Academic Publishers (1997)
Joseph, M. (ed.): Real-time Systems Specification, Verification and Analysis. Tata Research Development & Design Centre (June 2001)
Burchard, A., Liebeherr, J., Oh, Y., Son, S.H.: New Strategies for Assigning Real-Time Tasks to Multimocessor Systems. IEEE Transactions on Computers 44(12) (December 1995)
Lauzac, S., Melhem, R., Mossé, D.: An Improved Rate-Monotonic Admission Control and Its Applications. IEEE Transactions on Computers 52(3) (March 2003)
Siva Ram Murthy, C., Manimaran, G.: Resource Management in Real-Time Systems and Networks. PHI Learning Private Limited (2009)
Zmaranda, D., Gabor, G., Popescu, D.E., Vancea, C., Vancea, F.: Using Fixed Priority Pre-emptive Scheduling in Real-Time Systems. International Journal of Computers, Communications & Control VI(1), 187–195 (2011)
Pellizzoni, R., Lipari, G.: Feasibility Analysis of Real-Time Periodic Tasks with Offsets. Real-Time Systems 30(1-2) (May 2005)
Anderson, B., Bletsis, K., Baruah, S.: Arbitrary-Deadline Scheduling Sporadic Tasks on Multiprocessor, Technical Report HURRAY-TR-080501
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Rao, A.P., Govardhan, A., Rao, P.V.V.P. (2012). Self-configurable Processor Schedule Window Algorithm. In: Meghanathan, N., Chaki, N., Nagamalai, D. (eds) Advances in Computer Science and Information Technology. Computer Science and Information Technology. CCSIT 2012. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27317-9_42
Download citation
DOI: https://doi.org/10.1007/978-3-642-27317-9_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27316-2
Online ISBN: 978-3-642-27317-9
eBook Packages: Computer ScienceComputer Science (R0)