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

Job partitioning strategies for multiprocessor scheduling of real-time periodic tasks with restricted migrations

Published: 08 November 2012 Publication History

Abstract

In this work, we consider the scheduling of real-time periodic tasks on multiprocessors under a restricted-migration constraint (tasks are allowed to migrate whereas jobs are not). We first propose a technique, (offline) job partitioning, which statically assigns jobs to processors before execution. We show that (offline) job partitioning strictly dominates both partitioned and restricted-migration scheduling. We then consider r-RM, a restricted-migration variant of global RM, we design a sufficient schedulability test and we provide a speedup factor for the scheduler.

References

[1]
T. F. Abdelzaher, V. Sharma, and C. Lu. A utilization bound for aperiodic tasks and priority driven scheduling. IEEE Trans. Comput., 53:334--350, March 2004.
[2]
J. H. Anderson, V. Bud, and U. C. Devi. An EDF-based scheduling algorithm for multiprocessor soft real-time systems. In In Proc. of the 17th Euromicro Conf. on Real-Time Systems, pages 199--208, 2005.
[3]
B. Andersson. Static-priority scheduling on multiprocessors. PhD dissertation, Chamlmers University of Technology, Göteborg, Sweden, 2003.
[4]
B. Andersson, T. Abdelzaher, and J. Jonsson. Partitioned aperiodic scheduling on multiprocessors. Parallel and Distributed Processing Symposium, International, 0:8b, 2003.
[5]
B. Andersson and J. Jonsson. The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%. In 15th Euromicro Conference on Real-Time Systems, pages 33--40, 2003.
[6]
N. Audsley, A. Burns, M. F. Richardson, and A. J. Wellings. Hard real-time scheduling: The deadline-monotonic approach. In IEEE Workshop on Real-Time Operating Systems and Software, pages 133--137, 1991.
[7]
S. Baruah and A. Burns. Sustainable scheduling analysis. In 27th IEEE International Real-Time Systems Symposium, pages 159--168. IEEE Computer Society, 2006.
[8]
S. Baruah and J. Carpenter. Multiprocessor fixed-priority scheduling with restricted interprocessor migrations. In Proceedings of the EuroMicro Conference on Real-Time Systems, pages 195--202. IEEE Computer Society, 2003.
[9]
S. K. Baruah and J. Carpenter. Multiprocessor fixed-priority scheduling with restricted interprocessor migrations. J. Embedded Comput., 1:169--178, April 2005.
[10]
S. K. Baruah and N. Fisher. Non-migratory feasibility and migratory schedulability of multiprocessor real-time systems. Real-Time Systems, 39:97--122, 2008.
[11]
E. Bini, G. Buttazzo, and G. Buttazzo. A hyperbolic bound for the rate monotonic algorithm. In Proceedings of the 13th Euromicro Conference on Real-Time Systems, ECRTS '01, pages 59--, Washington, DC, USA, 2001. IEEE Computer Society.
[12]
J. Carpenter, S. Funk, P. Holman, A. Srinivasan, J. Anderson, and S. Baruah. A categorization of real-time multiprocessor scheduling problems and algorithms. In Handbook on Scheduling Algorithms, Methods, and Models. Chapman Hall/CRC, Boca, 2004.
[13]
F. D. and Murgolo. Anomalous behavior in bin packing algorithms. Discrete Applied Mathematics, 21(3):229--243, 1988.
[14]
R. Davis and A. Burns. A survey of hard real-time scheduling for multiprocessor systems. ACM Computing Surveys, 43(4):35:1--35:44, October 2011.
[15]
M. L. Dertouzos and A. K. Mok. Multiprocessor online scheduling of hard-real-time tasks. IEEE Transactions on Software Engineering, 15(12):1497--1506, 1989.
[16]
F. Dorin, P. M. Yomsi, J. Goossens, and P. Richard. Semi-partitioned hard real-time scheduling with restricted migrations upon identical multiprocessor plateforms. In Real-Time and Network Systems, pages 207--216, 2010.
[17]
F. Fauberteau, S. Midonnet, and L. George. Laxity-based restricted-migration scheduling. In Z. Mammeri, editor, Proceedings of the 16th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), page 8pp., Toulouse, September 2011. IEEE Computer Society.
[18]
N. Fisher. The multiprocessor real-time scheduling of general task systems. PhD dissertation, University of North Carolina, Chapel Hill, 2007.
[19]
N. W. Fisher. How hard is partitioning for the sporadic task model? In Proceedings of the 2009 International Conference on Parallel Processing Workshops, ICPPW '09, pages 2--5. IEEE Computer Society, 2009.
[20]
S. Funk and S. Baruah. Restricting edf migration on uniform heterogeneous multiprocessors. TSI. Technique et science informatiques, 24(8):917--938, 2005.
[21]
L. George, P. Corbin, and Y. Sorel. Job vs. portioned partitioning for the earliest deadline first semi-partitioned scheduling. Journal of systems architecture, 57:518--535, 2011.
[22]
R. Ha and J. Liu. Validating timing constraints in multiprocessor and distributed real-time systems. In 14th International Conference on Distributed Computing Systems, pages 162--171. IEEE Computer Society, 1994.
[23]
D. S. Hochbaum and D. B. Shmoys. Using dual approximation algorithms for scheduling problems theoretical and practical results. Journal of ACM, 34(1):144--162, 1987.
[24]
K. Hong and J.-T. Leung. On-line scheduling of real-time tasks. Computers, IEEE Transactions on, 41(10):1326--1331, oct 1992.
[25]
J. W. JYT Leung. On the comlpexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation, 2:237--250, February 1982.
[26]
S. Kato, N. Yamasaki, and Y. Ishikawa. Semi-partitioned scheduling of sporadic task systems on multiprocessors. In Euromicro Conference on Real-Time Systems (ECRTS), pages 249--258, 2009.
[27]
M. Khurram, C. Belleudy, and M. Auguin. Two-level hierarchical scheduling algorithm for multiprocessor systems. Journal of software, 6(11):2308--2320, 2011.
[28]
D. E. Knuth. The Art of Computer Programming, vol. 4A: Combinatorial Algorithms, Part 1. Addison-Wesley, Pearson Education, Jan. 2011.
[29]
S. Lauzac, R. Melhem, and D. Mossé. An efficient RMS admission control and its application to multiprocessor scheduling, 1998.
[30]
C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM, 20:46--61, January 1973.
[31]
J. M. López, J. L. Díaz, and D. F. García. Utilization bounds for EDF scheduling on real-time multiprocessor systems. Real-Time Systems, 28(1):39--68, 2004.
[32]
J. M. López, M. García, J. L. Díaz, and D. F. García. Utilization bounds for multiprocessor rate-monotonic scheduling. Real-Time Systems, 24:5--28, 2003.
[33]
D.-I. Oh and T. Baker. Utilization bounds for n-processor rate monotone scheduling with static processor assignment. Real-Time Systems, 15:183--192, 1998. 10.1023/A:1008098013753.
[34]
M. Orlov. Efficient generation of set partitions. Technical report, Ben Gurion University of the Negev, Israel, Mar. 2002.
[35]
C. A. Phillips, C. Stein, E. Torng, and J. Wein. Optimal time-critical scheduling via resource augmentation (extended abstract). In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, STOC '97, pages 140--149. ACM, 1997.
[36]
A. Sarkar, F. Mueller, and H. Ramaprasad. Predictable task migration for locked caches in multi-core systems. in ACM SIGPLAN Conference on Languages, Compilers, and Tools for Embedded Systems, pages 131--140, 2011.
[37]
A. Srivinasan and S. Baruah. Deadline-based scheduling of periodic task systems on multiprocessors. Information processing letters, 84(2):93--98, 2002.
[38]
V. Zhirnov, R. Cavin, J. Hutchby, and G. Bourianoff. Limits to binary logic switch scaling---a gedanken model. In Proceedings of the IEEE, volume 9, pages 1934--1939, Washington, DC, USA, 2003. IEEE Computer Society.

Cited By

View all
  • (2017)Real-time semi-partitioned scheduling of fork-join tasks using work-stealingEURASIP Journal on Embedded Systems10.1186/s13639-017-0079-52017:1Online publication date: 13-Sep-2017
  • (2016)Optimal Semi-Partitioned Scheduling in Soft Real-Time SystemsJournal of Signal Processing Systems10.1007/s11265-015-0983-784:1(3-23)Online publication date: 1-Jul-2016
  • (2015)Semi-Partitioned Scheduling of Fork-Join Tasks Using Work-StealingProceedings of the 2015 IEEE 13th International Conference on Embedded and Ubiquitous Computing (EUC)10.1109/EUC.2015.30(25-34)Online publication date: 21-Oct-2015
  • Show More Cited By

Index Terms

  1. Job partitioning strategies for multiprocessor scheduling of real-time periodic tasks with restricted migrations

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Other conferences
      RTNS '12: Proceedings of the 20th International Conference on Real-Time and Network Systems
      November 2012
      216 pages
      ISBN:9781450314091
      DOI:10.1145/2392987
      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

      • University of Lorraine: University of Lorraine
      • INRIA: Institut Natl de Recherche en Info et en Automatique
      • GDR ASR: GDR Architecture, Systèmes et Réseaux

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 08 November 2012

      Permissions

      Request permissions for this article.

      Check for updates

      Qualifiers

      • Research-article

      Conference

      RTNS '12
      Sponsor:
      • University of Lorraine
      • INRIA
      • GDR ASR

      Acceptance Rates

      Overall Acceptance Rate 119 of 255 submissions, 47%

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)4
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 22 Jan 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2017)Real-time semi-partitioned scheduling of fork-join tasks using work-stealingEURASIP Journal on Embedded Systems10.1186/s13639-017-0079-52017:1Online publication date: 13-Sep-2017
      • (2016)Optimal Semi-Partitioned Scheduling in Soft Real-Time SystemsJournal of Signal Processing Systems10.1007/s11265-015-0983-784:1(3-23)Online publication date: 1-Jul-2016
      • (2015)Semi-Partitioned Scheduling of Fork-Join Tasks Using Work-StealingProceedings of the 2015 IEEE 13th International Conference on Embedded and Ubiquitous Computing (EUC)10.1109/EUC.2015.30(25-34)Online publication date: 21-Oct-2015
      • (2015)An Optimal Semi-partitioned Scheduler for Uniform Heterogeneous MultiprocessorsProceedings of the 2015 27th Euromicro Conference on Real-Time Systems10.1109/ECRTS.2015.25(199-210)Online publication date: 8-Jul-2015
      • (2014)Soft Real-Time Semi-Partitioned Scheduling with Restricted Migrations on Uniform Heterogeneous MultiprocessorsProceedings of the 22nd International Conference on Real-Time Networks and Systems10.1145/2659787.2659808(215-224)Online publication date: 8-Oct-2014
      • (2014)Optimal semi-partitioned scheduling in soft real-time systems2014 IEEE 20th International Conference on Embedded and Real-Time Computing Systems and Applications10.1109/RTCSA.2014.6910532(1-10)Online publication date: Aug-2014

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media