Abstract
We devise the first constant-approximate feasibility test for sporadic multiprocessor real-time scheduling. We give an algorithm that, given a task system and ε> 0, correctly decides either that the task system can be scheduled using the earliest deadline first algorithm on m speed-(2 − 1/m + ε) machines, or that the system is infeasible for m speed-1 machines. The running time of the algorithm is polynomial in the size of the task system and 1/ε. We also provide an improved bound trading off speed for additional machines.
Our analysis relies on a new concept for counting the workload of an interval, that might also turn useful for analyzing other types of task systems.
Preview
Unable to display preview. Download preview PDF.
References
Albers, K., Slomka, F.: An event stream driven approximation for the analysis of real-time systems. In: Proc. 16th Euromicro Conference on Real-Time Systems, pp. 187–195 (2004)
Albers, K., Slomka, F.: Efficient feasibility analysis for real-time systems with EDF scheduling. In: Proc. Conf. on Design, Automation and Test in Europe, pp. 492–497 (2005)
Baker, T.P.: An analysis of EDF schedulability on a multiprocessor. IEEE Trans. Parallel Distrib. Syst. 16(8), 760–768 (2005)
Baker, T.P., Baruah, S.K.: Schedulability analysis of multiprocessor sporadic task systems. In: Son, S.H., Lee, I., Leung, J.Y.-T. (eds.) Handbook of Real-Time and Embedded Systems. CRC Press, Boca Raton (2007)
Baruah, S.K., Howell, R.R., Rosier, L.E.: Feasibility problems for recurring tasks on one processor. Theor. Comput. Sci. 118(1), 3–20 (1993)
Chakraborty, S., Künzli, S., Thiele, L.: Approximate schedulability analysis. In: Proc. 23rd IEEE Real-Time Systems Symp., pp. 159–168 (2002)
Dertouzos, M.L.: Control robotics: The procedural control of physical processes. In: Proc. IFIP Congress, pp. 807–813 (1974)
Fisher, N., Baruah, S.K.: A fully polynomial-time approximation scheme for feasibility analysis in static-priority systems with arbitrary relative deadlines. In: Proc. 17th Euromicro Conference on Real-Time Systems, pp. 117–126 (2005)
Lam, T.W., To, K.-K.: Trade-offs between speed and processor in hard-deadline scheduling. In: Proc. 10th Annual ACM-SIAM Symp. on Discrete Algorithms, pp. 623–632 (1999)
Leung, J.Y.-T., Merrill, M.L.: A note on preemptive scheduling of periodic, real-time tasks. Inf. Process. Lett. 11(3), 115–118 (1980)
Liu, C.L., Layland, J.W.: Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM 20(1), 46–61 (1973)
Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. Algorithmica 32(2), 163–200 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bonifaci, V., Marchetti-Spaccamela, A., Stiller, S. (2008). A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling. In: Halperin, D., Mehlhorn, K. (eds) Algorithms - ESA 2008. ESA 2008. Lecture Notes in Computer Science, vol 5193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87744-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-87744-8_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87743-1
Online ISBN: 978-3-540-87744-8
eBook Packages: Computer ScienceComputer Science (R0)