skip to main content
10.1145/2659787.2659828acmotherconferencesArticle/Chapter ViewAbstractPublication PagesrtnsConference Proceedingsconference-collections
research-article

SPRINT: Extending RUN to Schedule Sporadic Tasks

Published: 08 October 2014 Publication History

Abstract

The RUN algorithm has proven to be a very effective technique for optimal multiprocessor scheduling, thanks to the limited number of preemptions and migrations incurred by the scheduled task set. This permits to achieve high system utilisation rates typical of global scheduling approaches without paying too much penalty due to excessive preemption and migration overheads. Unfortunately, the adoption of RUN in real-world applications is limited by the missing support to sporadic task sets: we address this problem by proposing SPRINT (SPoradic Run for INdependent Tasks). SPRINT is proven correct for the vast majority of task sets and successfully scheduled all those randomly generated during our experiments. Yet, its behaviour is not defined for some specific task sets, which are however extremely rare [1]. Interestingly, experimental results show that the favourable property of causing a small number of preemptions and migrations achieved by RUN is preserved with SPRINT.

References

[1]
P. Regnier, G. Lima, E. Massa, G. Levin, and S. Brandt, "Multiprocessor scheduling by reduction to uniprocessor: an original optimal approach", Real-Time Systems, vol. 49, no. 4, pp. 436--474, 2013.
[2]
P. Regnier, G. Lima, E. Massa, G. Levin, and S. Brandt, "RUN: Optimal multiprocessor real-time scheduling via reduction to uniprocessor", in Proc. of the 32th IEEE Real-Time Systems Symposium (RTSS), pp. 104--115, 2011.
[3]
G. Nelissen, V. Berten, V. Nélis, J. Goossens, and D. Milojevic, "U-EDF: An unfair but optimal multiprocessor scheduling algorithm for sporadic tasks", in Proc. of the 24th Euromicro Conference on Real-Time Systems (ECRTS), pp. 13--23, 2012.
[4]
G. Nelissen, Efficient Optimal Multiprocessor Scheduling Algorithms for Real-Time Systems. PhD thesis, Université Libre de Bruxelles, 2013.
[5]
A. Srinivasan and J. H. Anderson, "Optimal rate-based scheduling on multiprocessors", in Proc. of the 34th Annual ACM Symposium on Theory of Computing (STOC), pp. 189--198, 2002.
[6]
G. Nelissen, H. Su, Y. Guo, D. Zhu, V. Nélis, and J. Goossens, "An optimal boundary fair scheduling", Real-Time Systems, vol. 50, no. 4, pp. 456--508, 2014.
[7]
S. Funk, G. Levin, C. Sadowski, I. Pye, and S. Brandt, "DP-Fair: a unifying theory for optimal hard real-time multiprocessor scheduling", Real-Time Systems, vol. 47, pp. 389--429, 2011.
[8]
S. Funk and V. Nadadur, "LRE-TL: An optimal multiprocessor algorithm for sporadic task sets", in Proc. of the 17th International Conference on Real-Time and Network Systems (RTNS), pp. 159--168, 2009.
[9]
S. K. Baruah, N. K. Cohen, C. G. Plaxton, and D. A. Varvel, "Proportionate progress: A notion of fairness in resource allocation", Algorithmica, vol. 15, no. 6, pp. 600--625, 1996.
[10]
C. L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard-real-time environment", Journal of the ACM, vol. 20, no. 1, pp. 46--61, 1973.
[11]
A. Baldovin, G. Nelissen, T. Vardanega, and E. Tovar, "SPRINT: Extending RUN to schedule sporadic tasks (Technical Report)", Tech. Rep. CISTER-TR-140901, CISTER, 2014.
[12]
M. Moir and S. Ramamurthy, "Pfair scheduling of fixed and migrating periodic tasks on multiple resources", in Proc. of the 20th IEEE Real-Time Systems Symposium (RTSS), pp. 294--303, 1999.
[13]
P. Holman and J. H. Anderson, "Using supertasks to improve processor utilization in multiprocessor real-time systems", in Proc. of the 15th Euromicro Conference on Real-Time Systems (ECRTS), pp. 41--50, 2003.
[14]
B. Andersson and K. Bletsas, "Sporadic multiprocessor scheduling with few preemptions", in Proc. of the 20th Euromicro Conference on Real-Time Systems (ECRTS), pp. 243--252, 2008.
[15]
S. K. Baruah, J. Gehrke, and C. G. Plaxton, "Fast scheduling of periodic tasks on multiple resources", in Proccedings of the 9th International Parallel Processing Symposium (IPPS), pp. 280--288, 1995.
[16]
G. Levin, C. Sadowski, I. Pye, and S. Brandt, "SNS: A simple model for understanding optimal hard real-time multiprocessor scheduling", Tech. Rep. ucsc-soe-11-09, UCSC, 2009.
[17]
D. Zhu, X. Qi, D. Mossé, and R. Melhem, "An optimal boundary fair scheduling algorithm for multiprocessor real-time systems", Journal of Parallel and Distributed Computing, vol. 71, no. 10, pp. 1411--1425, 2011.
[18]
D. Compagnin, E. Mezzetti, and T. Vardanega, "Putting RUN into practice: implementation and evaluation", in Proc. of the 26th Euromicro Conference on Real-Time Systems (ECRTS), 2014.
[19]
J. Calandrino, H. Leontyev, A. Block, U. Devi, and J. Anderson, "LITMUSRT: A testbed for empirically comparing real-time multiprocessor schedulers", in Proc. of the 27th IEEE Real-Time Systems Symposium (RTSS), pp. 111--126, 2006.
[20]
http://www.litmus-rt.org/, 2014. LITMUSRT, The Linux Testbed for Multiprocessor Scheduling in Real Time Systems.
[21]
P. Emberson, R. Stafford, and R. I. Davis, "Techniques for the synthesis of multiprocessor tasksets", in Proc. of the 1st Workshop on Analysis Tools and Methodologies for Embedded and Real-Time Systems (WATERS), pp. 6--11, 2010.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
RTNS '14: Proceedings of the 22nd International Conference on Real-Time Networks and Systems
October 2014
335 pages
ISBN:9781450327275
DOI:10.1145/2659787
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

  • CEA: Commissariat à l'énergie atomique et aux énergies alternatives
  • GDR ASR: GDR Architecture, Systèmes et Réseaux

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 October 2014

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

RTNS '14

Acceptance Rates

Overall Acceptance Rate 119 of 255 submissions, 47%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 20 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media