research-article

Adaptive partitioning of real-time tasks on multiple processors

Authors:

Tommaso CucinottaAuthors Info & Claims

SAC '20: Proceedings of the 35th Annual ACM Symposium on Applied Computing

Pages 572 - 579

https://doi.org/10.1145/3341105.3373937

Published: 30 March 2020 Publication History

Abstract

This paper presents a new algorithm for scheduling real-time tasks on multiprocessor/multicore systems. This new algorithm is based on combining EDF scheduling with a migration strategy that moves tasks only when needed. It has been evaluated through an extensive set of simulations that showed good performance when compared with global or partitioned EDF: a worst-case utilisation bound similar to partitioned EDF for hard real-time tasks, and a tardiness bound similar to global EDF for soft real-time tasks. Therefore, the proposed scheduler is effective for dealing with both soft and hard real-time workloads.

References

[1]

James H. Anderson, Vasile Bud, and UmaMaheswari C. Devi. 2008. An EDF-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems. Real-Time Systems 38, 2 (01 Feb 2008), 85--131.

[2]

B. Andersson and E. Tovar. 2006. Multiprocessor Scheduling with Few Preemptions. In Proceedings onf the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2006). IEEE, Sydney, Qld., Australia, 322--334.

[3]

Sanjoy Baruah and John Carpenter. 2003. Multiprocessor Fixed-Priority Scheduling with Restricted Interprocessor Migrations. In Proceedings of the 15th Euromicro Conference on Real-Time Systems (ECRTS 2003). IEEE, Porto, Portugal, 195--202.

[4]

S. K. Baruah. 2004. Optimal utilization bounds for the fixed-priority scheduling of periodic task systems on identical multiprocessors. IEEE Trans. Comput. 53, 6 (June 2004), 781--784.

Digital Library

[5]

A. Bastoni, B. B. Brandenburg, and J. H. Anderson. 2010. An Empirical Comparison of Global, Partitioned, and Clustered Multiprocessor EDF Schedulers. In 2010 31st IEEE Real-Time Systems Symposium. IEEE, San Diego, CA, USA, 14--24.

[6]

Marko Bertogna and Michele Cirinei. 2007. Response-Time Analysis for Globally Scheduled Symmetric Multiprocessor Platforms. In Proceedings of the 28th IEEE International Real-Time Systems Symposium (RTSS 2007). IEEE, Tucson, AZ, USA, 149--160.

Digital Library

[7]

Marko Bertogna, Michele Cirinei, and Giuseppe Lipari. 2005. Improved Schedulability analysis of EDF on multiprocessor platforms. In Proceedings of the 17th Euromicro Conference on Real-Time Systems (ECRTS 2005). IEEE, Balearic Islands, Spain, 209--218.

Digital Library

[8]

Joan Boyar, György Dósa, and Leah Epstein. 2012. On the absolute approximation ratio for First Fit and related results. Discrete Applied Mathematics 160, 13 (2012), 1914 -- 1923.

Digital Library

[9]

H. Cho, B. Ravindran, and E. D. Jensen. 2006. An Optimal Real-Time Scheduling Algorithm for Multiprocessors. In Proceedings of the 27th IEEE International Real-Time Systems Symposium (RTSS 2006). IEEE, Rio de Janeiro, Brazil, 101--110.

[10]

M. L. Dertouzos. 1974. Control Robotics: The Procedural Control of Physical Processes. Information Processing 74 (1974), 807--813.

[11]

UmaMaheswari C. Devi and J. H. Anderson. 2008. Tardiness Bounds under Global EDF Scheduling on a Multiprocessor. Real-Time Systems 38, 2 (01 February 2008), 133--189.

[12]

Paul Emberson, Roger Stafford, and Robert I Davis. 2010. Techniques for the Synthesis of Multiprocessor Tasksets. In Proceedings 1st International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS 2010). Brussels, Belgium, 6--11.

[13]

Joël Goossens, Shelby Funk, and Sanjoy Baruah. 2003. Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors. Real-Time Systems 25, 2 (September 2003), 187--205.

Digital Library

[14]

R. L. Graham. 1972. Bounds on Multiprocessing Anomalies and Related Packing Algorithms. In Proceedings of the May 16--18, 1972, Spring Joint Computer Conference (AFIPS '72 (Spring)). ACM, New York, NY, USA, 205--217.

Digital Library

[15]

D. Johnson, A. Demers, J. Ullman, M. Garey, and R. Graham. 1974. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms. SIAM J. Comput. 3, 4 (1974), 299--325.

Digital Library

[16]

David S. Johnson. 1974. Approximation algorithms for combinatorial problems. J. Comput. System Sci. 9, 3 (1974), 256 -- 278.

Digital Library

[17]

Juri Lelli, Dario Faggioli, Tommaso Cucinotta, and Giuseppe Lipari. 2012. An experimental comparison of different real-time schedulers on multicore systems. Journal of Systems and Software 85, 10 (2012), 2405 -- 2416. Automated Software Evolution.

Digital Library

[18]

Juri Lelli, Claudio Scordino, Luca Abeni, and Dario Faggioli. 2016. Deadline Scheduling in the Linux kernel. Software: Practice and Experience 46, 6 (June 2016), 821--839.

Digital Library

[19]

G. Levin, S. Funk, C. Sadowski, I. Pye, and S. Brandt. 2010. DP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling. In Proceesings of the 22nd Euromicro Conference on Real-Time Systems (ECRTS 2010). IEEE, Brussels, Belgium, 3--13.

[20]

Chung Laung Liu and James W. Layland. 1973. Scheduling Algorithms for Multiprogramming in a Hard real-Time Environment. Journal of the Association for Computing Machinery 20, 1 (Jan. 1973), 46--61.

Digital Library

[21]

Jose Maria López, Manuel García, José Luis Diaz, and Daniel F Garcia. 2000. Worst-Case Utilization Bound for EDF Scheduling on Real-Time Multiprocessor Systems. In Proceedings of the 12th Euromicro Conference on Real-Time Systems (ECRTS 2000). IEEE, Stockholm, Sweden, 25--33.

Digital Library

[22]

T. Megel, R. Sirdey, and V. David. 2010. Minimizing Task Preemptions and Migrations in Multiprocessor Optimal Real-Time Schedules. In 2010 31st IEEE Real-Time Systems Symposium. IEEE, San Diego, CA, USA, 37--46.

[23]

P. Regnier, G. Lima, E. Massa, G. Levin, and S. Brandt. 2011. RUN: Optimal Multiprocessor Real-Time Scheduling via Reduction to Uniprocessor. In Proceesings of the 32nd IEEE Real-Time Systems Symposium (RTSS 2011). IEEE, Vienna, Austria, 104--115.

[24]

N. Saranya and R. C. Hansdah. 2015. Dynamic Partitioning Based Scheduling of Real-Time Tasks in Multicore Processors. In 2015 IEEE 18th International Symposium on Real-Time Distributed Computing. IEEE, Auckland, New Zealand, 190--197.

[25]

David Simchi-Levi. 1994. New worst-case results for the bin-packing problem. Naval Research Logistics (NRL) 41, 4 (1994), 579--585.

[26]

Paolo Valente and Giuseppe Lipari. 2005. An Upper Bound to the Lateness of Soft Real-Time Tasks Scheduled by EDF on Multiprocessors. In Proceedings of the 26th IEEE International Real-Time Systems Symposium (RTSS'05). IEEE, Miami, FL, USA, 10 pp.-320.

Digital Library

[27]

A. Wieder and B. B. Brandenburg. 2013. Efficient partitioning of sporadic realtime tasks with shared resources and spin locks. In 2013 8th IEEE International Symposium on Industrial Embedded Systems (SIES). IEEE, Porto, Portugal, 49--58.

Cited By

Suzuki TTanaka K(2023)Real-time Scheduling Algorithm with Execution Right Delegation for MultiprocessorJournal of Information Processing10.2197/ipsjjip.31.6731(67-77)Online publication date: 2023
https://doi.org/10.2197/ipsjjip.31.67
Lee JShin SBriand LNejati S(2023)Probabilistic Safe WCET Estimation for Weakly Hard Real-Time Systems at Design StagesACM Transactions on Software Engineering and Methodology10.1145/3617176Online publication date: 26-Aug-2023
https://dl.acm.org/doi/10.1145/3617176
Cucinotta TAbeni L(2021)Migrating Constant Bandwidth Servers on Multi-CoresProceedings of the 29th International Conference on Real-Time Networks and Systems10.1145/3453417.3453441(155-164)Online publication date: 7-Apr-2021
https://dl.acm.org/doi/10.1145/3453417.3453441
Show More Cited By

Index Terms

Adaptive partitioning of real-time tasks on multiple processors
1. Computer systems organization
  1. Embedded and cyber-physical systems
    1. Embedded systems
  2. Real-time systems
    1. Real-time operating systems
2. Software and its engineering
  1. Software organization and properties
    1. Software functional properties
      1. Correctness
        Real-time schedulability

Recommendations

EDF scheduling of real-time tasks on multiple cores: adaptive partitioning vs. global scheduling

This paper presents a novel migration algorithm for real-time tasks on multicore systems, based on the idea of migrating tasks only when strictly needed to respect their temporal constraints and a combination of this new algorithm with EDF scheduling. ...
Analysis on quantum-based fixed priority scheduling of real-time tasks
ICUIMC '09: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication

Fixed priority schedulers are widely used for real-time systems, and there were efforts to improve the schedulability. Preemption threshold scheduling is one of such efforts with a dual priority scheme. It increases the schedulability by introducing ...
The limited-preemptive feasibility of real-time tasks on uniprocessors

The preemptive scheduling paradigm is known to strictly dominate the non-preemptive scheduling paradigm with respect to feasibility. On the other hand, preemptively scheduling real-time tasks on uniprocessors, unlike non-preemptive scheduling, may lead ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SAC '20: Proceedings of the 35th Annual ACM Symposium on Applied Computing

March 2020

2348 pages

ISBN:9781450368667

DOI:10.1145/3341105

Conference Chairs:
Chih-Cheng Hung
Kennesaw State University
,
Tomas Cerny
Baylor University
,
Program Chairs:
Dongwan Shin
New Mexico Tech
,
Alessio Bechini
University of Pisa, Italy

Copyright © 2020 ACM.

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]

Sponsors

SIGAPP: ACM Special Interest Group on Applied Computing

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 30 March 2020

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SAC '20

Sponsor:

SIGAPP

SAC '20: The 35th ACM/SIGAPP Symposium on Applied Computing

March 30 - April 3, 2020

Brno, Czech Republic

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25

Sponsor:
sigapp

The 40th ACM/SIGAPP Symposium on Applied Computing

March 31 - April 4, 2025

Catania , Italy

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
182
Total Downloads

Downloads (Last 12 months)25
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Suzuki TTanaka K(2023)Real-time Scheduling Algorithm with Execution Right Delegation for MultiprocessorJournal of Information Processing10.2197/ipsjjip.31.6731(67-77)Online publication date: 2023
https://doi.org/10.2197/ipsjjip.31.67
Lee JShin SBriand LNejati S(2023)Probabilistic Safe WCET Estimation for Weakly Hard Real-Time Systems at Design StagesACM Transactions on Software Engineering and Methodology10.1145/3617176Online publication date: 26-Aug-2023
https://dl.acm.org/doi/10.1145/3617176
Cucinotta TAbeni L(2021)Migrating Constant Bandwidth Servers on Multi-CoresProceedings of the 29th International Conference on Real-Time Networks and Systems10.1145/3453417.3453441(155-164)Online publication date: 7-Apr-2021
https://dl.acm.org/doi/10.1145/3453417.3453441
Suzuki TTanaka K(2021)Execution Right Delegation Scheduling Algorithm for Multiprocessor2021 IEEE 14th International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC)10.1109/MCSoC51149.2021.00015(46-53)Online publication date: Dec-2021
https://doi.org/10.1109/MCSoC51149.2021.00015
Stevanato ACucinotta TAbeni Lde Oliveira D(2021)An Evaluation of Adaptive Partitioning of Real-Time Workloads on Linux2021 IEEE 24th International Symposium on Real-Time Distributed Computing (ISORC)10.1109/ISORC52013.2021.00018(53-61)Online publication date: Jun-2021
https://doi.org/10.1109/ISORC52013.2021.00018
Mascitti ACucinotta TMarinoni MAbeni L(2021)Dynamic partitioned scheduling of real-time tasks on ARM big.LITTLE architecturesJournal of Systems and Software10.1016/j.jss.2020.110886173(110886)Online publication date: Mar-2021
https://doi.org/10.1016/j.jss.2020.110886
Abeni LCucinotta T(2020)EDF scheduling of real-time tasks on multiple coresACM SIGAPP Applied Computing Review10.1145/3412816.341281720:2(5-18)Online publication date: 27-Jul-2020
https://dl.acm.org/doi/10.1145/3412816.3412817

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents