More Web Proxy on the site http://driver.im/

research-article

Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems

Authors:

K. Ramamritham,

J. A. Stankovic,

P. F. ShiahAuthors Info & Claims

IEEE Transactions on Parallel and Distributed Systems, Volume 1, Issue 2

Pages 184 - 194

https://doi.org/10.1109/71.80146

Published: 01 April 1990 Publication History

Abstract

Efficient scheduling algorithms based on heuristic functions are developed for scheduling a set of tasks on a multiprocessor system. The tasks are characterized by worst-case computation times, deadlines, and resources requirements. Starting with an empty partial schedule, each step of the search extends the current partial schedule by including one of the tasks yet to be scheduled. The heuristic functions used in the algorithm actively direct the search for a feasible schedule, i.e. they help choose the task that extends the current partial schedule. Two scheduling algorithms are evaluated by simulation. To extend the current partial schedule, one of the algorithms considers, at each step of the search, all the tasks that are yet to be scheduled as candidates. The second focuses its attention on a small subset of tasks with the shortest deadlines. The second algorithm is shown to be very effective when the maximum allowable scheduling overhead is fixed. This algorithm is hence appropriate for dynamic scheduling in real-time systems.

References

[1]

{1} J. Blazewicz, "Deadline scheduling of tasks with ready times and resource constraints," Inform. Process. Lett., vol. 8, no. 2, Feb. 1979.

[2]

{2} J. Blazewicz, M. Drabowski, and J. Weglarz, "Scheduling multiprocessor tasks to minimize schedule length," IEEE Trans. Comput., pp. 389-393, May 1986.

Digital Library

[3]

{3} H. Chetto and M. Chetto, "Some results of the earliest deadline scheduling algorithm," IEEE Trans. Software Eng., pp. 1161-1169, Oct. 1989.

[4]

{4} M. Dertouzos, "Control robotics: The procedural control of physical process," in Proc. IFIP Congress, 1974.

[5]

{5} W. A. Horn, "Some simple scheduling algorithms," Naval Res. Log. Quart., vol. 21, 1974.

[6]

{6} C. Martel, "Preemptive scheduling with release times, deadlines, and due times," J. ACM, vol. 29, no. 3, pp. 812-829, July 1982.

Digital Library

[7]

{7} A. K. Mok and M. L. Dertouzos, "Multiprocessor scheduling in a hard real-time environment," in Proc. Seventh Texas Conf. Comput. Syst., Nov. 1978.

[8]

{8} A. K. Mok, "The design of real-time programming systems based on process models," in Proc. IEEE Real-Time Syst. Symp., Dec. 1984.

[9]

{9} A. K. Mok, "Fundamental design problems of distributed systems for the hard real-time environment," Ph.D. dissertation, Dep. Elec. Eng. Comput. Sci., Mass. Inst. Technol., Cambridge, MA, May 1983.

[10]

{10} K. Ramamritham, J. A. Stankovic, and W. Zhao, "Distributed scheduling of tasks with deadlines and resource requirements," IEEE Trans. Comput., pp. 1110-1123, Aug. 1989.

Digital Library

[11]

{11} S. Sahni and Y. Cho, "Nearly on line scheduling of a uniform processor system with release times," Soc. Industrial Appl. Math. J. Comput., vol. 8, no. 2, pp. 275-285, May 1979.

[12]

{12} P. F. Shiah, "A heuristic approach on real-time scheduling for multiprocessors," M.S. thesis, Dep. Elec. Comput. Eng., Univ. Massachusetts, Amherst, MA, Jan. 1989.

[13]

{13} J. A. Stankovic and K. Ramamritham, "The design of the spring kernel," in Proc. Real-Time Syst. Symp., San Jose, CA, Dec. 1987.

[14]

{14} J. A. Stankovic and K. Ramamritham, P. F. Shiah, and W. Zhao, "Real-time scheduling algorithms for multiprocessors," Tech. Rep. Univ. Massachusetts, Nov. 1988.

[15]

{15} J. D. Ullman, "Polynomial complete scheduling problems," Oper. Syst. Rev., vol. 7, no. 4, Oct. 1973.

Digital Library

[16]

{16} J. D. Ullman, "NP-complete scheduling problems," J. Comput. Syst. Sci., Oct. 1975.

Digital Library

[17]

{17} W. Zhao, K. Ramamritham, and J. A. Stankovic, "Scheduling tasks with resource requirements in hard real-time systems," IEEE Trans. Software Eng., vol. SE-12, May 1987.

[18]

{18} W. Zhao and K. Ramamritham, "Simple and integrated heuristic algorithms for scheduling tasks with time and resource constraints," J. Syst. Software, 1987.

Cited By

Singhal SSharma A(2021)A job scheduling algorithm based on rock hyrax optimization in cloud computingComputing10.1007/s00607-021-00942-w103:9(2115-2142)Online publication date: 1-Sep-2021
https://dl.acm.org/doi/10.1007/s00607-021-00942-w
Konar DBhattacharyya SSharma KSharma SPradhan S(2017)An improved Hybrid Quantum-Inspired Genetic Algorithm (HQIGA) for scheduling of real-time task in multiprocessor systemApplied Soft Computing10.1016/j.asoc.2016.12.05153:C(296-307)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1016/j.asoc.2016.12.051
Liu XQiu MWang XLiu WCai K(2017)Energy Efficiency Optimization for Communication of Air-Based Information Network with Guaranteed Timing ConstraintsJournal of Signal Processing Systems10.1007/s11265-016-1125-686:2-3(299-312)Online publication date: 1-Mar-2017
https://dl.acm.org/doi/10.1007/s11265-016-1125-6
Show More Cited By

Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems

Recommendations

A Pre-Run-Time Scheduling Algorithm for Hard Real-Time Systems

Process scheduling, an important issue in the design and maintenance of hard real-time systems, is discussed. A pre-run-time scheduling algorithm that addresses the problem of process sequencing is presented. The algorithm is designed for multiprocessor ...
Multiprocessor Scheduling of Processes with Release Times, Deadlines, Precedence, and Exclusion Relations

The author presents a scheduling algorithm that solves the problem of finding a feasible nonpreemptive schedule whenever one exists on M identical processors for a given set of processes such that each process starts executing after its release time and ...
Modified Rate-Monotonic Algorithm for Scheduling Periodic Jobs with Deferred Deadlines

The deadline of a request is the time instant at which its execution must complete. The deadline of the request in any period of a job with deferred deadline is some time instant after the end of the period. The authors describe a semi-static priority-...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE Transactions on Parallel and Distributed Systems

IEEE Transactions on Parallel and Distributed Systems Volume 1, Issue 2

April 1990

129 pages

ISSN:1045-9219

Issue’s Table of Contents

Copyright © Copyright © 1990 IEEE. All Rights Reserved.

Publisher

IEEE Press

Publication History

Published: 01 April 1990

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

69
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 22 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Singhal SSharma A(2021)A job scheduling algorithm based on rock hyrax optimization in cloud computingComputing10.1007/s00607-021-00942-w103:9(2115-2142)Online publication date: 1-Sep-2021
https://dl.acm.org/doi/10.1007/s00607-021-00942-w
Konar DBhattacharyya SSharma KSharma SPradhan S(2017)An improved Hybrid Quantum-Inspired Genetic Algorithm (HQIGA) for scheduling of real-time task in multiprocessor systemApplied Soft Computing10.1016/j.asoc.2016.12.05153:C(296-307)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1016/j.asoc.2016.12.051
Liu XQiu MWang XLiu WCai K(2017)Energy Efficiency Optimization for Communication of Air-Based Information Network with Guaranteed Timing ConstraintsJournal of Signal Processing Systems10.1007/s11265-016-1125-686:2-3(299-312)Online publication date: 1-Mar-2017
https://dl.acm.org/doi/10.1007/s11265-016-1125-6
de Mello BWainer GBarros FPrähofer HHu XDenil J(2016)Scheduling predictability in I-DEVS by schedulability analysisProceedings of the Symposium on Theory of Modeling & Simulation10.5555/2975389.2975409(1-8)Online publication date: 3-Apr-2016
https://dl.acm.org/doi/10.5555/2975389.2975409
Park HMalik ASalcic Z(2015)Scheduling Globally Asynchronous Locally Synchronous Programs for Guaranteed Response TimesACM Transactions on Design Automation of Electronic Systems10.1145/274096120:3(1-25)Online publication date: 24-Jun-2015
https://dl.acm.org/doi/10.1145/2740961
Kianfar KMoslehi GYahyapour R(2015)A novel metaheuristic algorithm and utility function for QoS based scheduling in user-centric grid systemsThe Journal of Supercomputing10.1007/s11227-014-1358-871:3(1143-1162)Online publication date: 1-Mar-2015
https://dl.acm.org/doi/10.1007/s11227-014-1358-8
Babu LGunasekaran AKrishna P(2014)A decision-based pre-emptive fair scheduling strategy to process cloud computing work-flows for sustainable enterprise managementInternational Journal of Business Information Systems10.1504/IJBIS.2014.06392916:4(409-430)Online publication date: 1-Jul-2014
https://dl.acm.org/doi/10.1504/IJBIS.2014.063929
Kang SVeeravalli BAung K(2014)Scheduling Multiple Divisible Loads in a Multi-cloud SystemProceedings of the 2014 IEEE/ACM 7th International Conference on Utility and Cloud Computing10.1109/UCC.2014.47(371-378)Online publication date: 8-Dec-2014
https://dl.acm.org/doi/10.1109/UCC.2014.47
Han YYoun CKang DLee SHanzo LIsmail RKim DChung MLee S(2012)Adaptive management framework for scientific workflow applicationsProceedings of the 6th International Conference on Ubiquitous Information Management and Communication10.1145/2184751.2184794(1-5)Online publication date: 20-Feb-2012
https://dl.acm.org/doi/10.1145/2184751.2184794
Mamat ALu YDeogun JGoddard S(2012)Scheduling real-time divisible loads with advance reservationsReal-Time Systems10.1007/s11241-011-9145-648:3(264-293)Online publication date: 1-May-2012
https://dl.acm.org/doi/10.1007/s11241-011-9145-6
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents