research-article

Preemptive scheduling under time and resource constraints

Authors:

K. Ramamritham,

J. A. StanovicAuthors Info & Claims

IEEE Transactions on Computers, Volume 36, Issue 8

Pages 949 - 960

https://doi.org/10.1109/TC.1987.5009518

Published: 01 August 1987 Publication History

Abstract

We consider the problem of scheduling a set of n preemptable tasks in a system having r resources. Each task has an arbitrary, but known, worst case processing time and a deadline, and may request simultaneous use of a number of resources. A resource can be used either in shared mode or exclusive mode. In this paper, we develop and evaluate algorithms for determining whether or not a set of preemptive tasks is schedulable in such a real-time system, and if so, determining a schedule for it. This scheduling problem is known to be computationally intensive. In many real-time application environments, tasks are scheduled dynamically, and hence the scheduling algorithms used must have low run-time costs. To keep run-time costs low, we propose the use of suboptimal but practical algorithms that employ computationally simple heuristics. The computational complexity of our algorithms for scheduling n tasks in a system having r resources is O(rn²), which is very much lower than that of known optimal algorithms. We report on the results of simulation studies performed on such heuristic preemptive scheduling algorithms and the sensitivity of the performance of the algorithms with respect to various scheduling parameters. These studies show that due to the complexity of the problem, straightforward heuristics do not perform satisfactorily. However, an algorithm that uses combinations of such heuristics in conjunction with limited backtracks works very well.

References

[1]

J. Blazewicz and J. Weglarz, "Scheduling under resource constraints-- Achievements and prospects," in Performance of Computer Systems, M. Arato, A. Butrimento, and E. Gelenbe, Eds. New York: North-Holland, 1979.

[2]

J. Blazewicz, "Deadline scheduling of tasks with ready times and resource constraints," Inform. Proc. Lett., vol. 8, Feb. 1979.

[3]

J. Blazewicz, J. K. Lenstra, and A. H. G. R. Kan, "Scheduling subject to resource constraints: Classification and complexity," Discrete Appl. Math., vol. 5, 1983.

[4]

J. Blazewicz, M. Drabowski, and J. Weglarz, "Scheduling multiprocessor tasks to minimize schedule length," IEEE Trans. Comput., May 1986.

[5]

M. Bonuccelli and D. P. Bovet, "Scheduling unit time independent tasks on dedicated resource systems," Rep. S-6-21, Univ. degli studi di Pisa, Instituo Scienze dell Informazione, 1976.

[6]

M. R. Garey and D. S. Johnson, "Complexity results for multiprocessor scheduling under resource constraints," SIAM J. Comput., vol. 4, 1975.

[7]

R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. R. Kan, "Optimization and approximation in deterministic sequencing and scheduling: A survey," Ann. Discrete Math., vol. 5, 1979.

[8]

D. W. Leinbaugh, "Guaranteed response time in a hard real-time environment," IEEE Trans. Software Eng., vol. SE-6, Jan. 1980.

Digital Library

[9]

J. K. Lenstra, A. H. G. Rinnooy, and P. Brucker, "Complexity of machine scheduling problems," Ann. Discrete Math., vol. 1, 1977.

[10]

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

[11]

K. Ramamritham and J. A. Stankovic, "Dynamic task scheduling in distributed hard real-time systems," IEEE Software, vol. 1, July 1984.

Digital Library

[12]

K. Ramamritham, J. A. Stankovic, and W. Zhao, "Meta-level control in distributed real-time systems," in Proc. Int. Conf. Distributed Comput. Syst., 1987.

[13]

L. Schrage, "Solving resource-constrained network problems by implicit enumeration--Preemptive case," Oper. Res., vol. 20, no. 3, 1972.

[14]

J. A. Stankovic, K. Ramamritham, and S. Cheng, "Evaluation of a flexible task scheduling algorithm for distributed hard real-time systems," IEEE Trans. Comput., vol. C-34, Dec. 1985.

[15]

J. D. Ullman, "Complexity of sequence problems," in Computer and Job/Shop Scheduling Theory, E. G. Coffman, Ed. New York: Wiley, 1976, ch. 4.

[16]

W. Zhao, K. Ramamritham, and J. A. Stankovic, "Scheduling tasks with resource requirements in hard real-time systems," IEEE Trans. Software Eng., vol. SE-13, pp. 564-577, May 1987.

Digital Library

[17]

W. Zhao, "A heuristic approach to scheduling hard real-time tasks with resource requirements in distributed systems," Ph.D. dissertation, Univ. Massachusetts, Amherst, Feb. 1986.

[18]

W. Zhao and K. Ramamritham, "Simple and integrated heuristic algorithms for scheduling tasks with time and resource constraints," J. Syst. Software, to be published.

Cited By

Li SChen R(2023)Competitive two-agent scheduling with release dates and preemption on a single machineJournal of Scheduling10.1007/s10951-023-00779-526:3(227-249)Online publication date: 27-Mar-2023
https://dl.acm.org/doi/10.1007/s10951-023-00779-5
Choksi MZaveri MCasoni M(2019)Multiobjective Based Resource Allocation and Scheduling for Postdisaster Management Using IoTWireless Communications & Mobile Computing10.1155/2019/61858062019Online publication date: 17-Mar-2019
https://dl.acm.org/doi/10.1155/2019/6185806
Pandey SShanker URanu SGanguly NRamakrishnan RSarawagi SRoy S(2018)Priority inversion in DRTDBSProceedings of the ACM India Joint International Conference on Data Science and Management of Data10.1145/3152494.3167976(305-309)Online publication date: 11-Jan-2018
https://dl.acm.org/doi/10.1145/3152494.3167976
Show More Cited By

Index Terms

Preemptive scheduling under time and resource constraints

Recommendations

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 ...
Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems

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 ...
Single machine scheduling problems with deteriorating jobs

This paper considers the single machine scheduling problems with deteriorating jobs, i.e. jobs whose processing times are a decreasing linear function of their starting time. It is assumed that jobs have the different basic processing time and same ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Computers

IEEE Transactions on Computers Volume 36, Issue 8

Special Issue on Real-Time Systems

Aug. 1987

106 pages

ISSN:0018-9340

Editor:
Bruce D. Shriver

Issue’s Table of Contents

Copyright © 1987.

Publisher

IEEE Computer Society

United States

Publication History

Published: 01 August 1987

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

37
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 27 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Li SChen R(2023)Competitive two-agent scheduling with release dates and preemption on a single machineJournal of Scheduling10.1007/s10951-023-00779-526:3(227-249)Online publication date: 27-Mar-2023
https://dl.acm.org/doi/10.1007/s10951-023-00779-5
Choksi MZaveri MCasoni M(2019)Multiobjective Based Resource Allocation and Scheduling for Postdisaster Management Using IoTWireless Communications & Mobile Computing10.1155/2019/61858062019Online publication date: 17-Mar-2019
https://dl.acm.org/doi/10.1155/2019/6185806
Pandey SShanker URanu SGanguly NRamakrishnan RSarawagi SRoy S(2018)Priority inversion in DRTDBSProceedings of the ACM India Joint International Conference on Data Science and Management of Data10.1145/3152494.3167976(305-309)Online publication date: 11-Jan-2018
https://dl.acm.org/doi/10.1145/3152494.3167976
Bellens PPerez JCabarcas FRamirez ABadia RLabarta J(2009)CellSs: Scheduling techniques to better exploit memory hierarchyScientific Programming10.1155/2009/56167217:1-2(77-95)Online publication date: 1-Jan-2009
https://dl.acm.org/doi/10.1155/2009/561672
Vacca VVasca FIannelli L(2007)Rate admission control for hard real-time task schedulingProceedings of the 10th international conference on Hybrid systems: computation and control10.5555/1760804.1760850(573-586)Online publication date: 3-Apr-2007
https://dl.acm.org/doi/10.5555/1760804.1760850
Krompass SKuno HDayal UKemper AKlas WNeuhold E(2007)Dynamic workload management for very large data warehousesProceedings of the 33rd international conference on Very large data bases10.5555/1325851.1325976(1105-1115)Online publication date: 23-Sep-2007
https://dl.acm.org/doi/10.5555/1325851.1325976
Mandviwala HHarel NRamachandran UKnobe K(2005)Adaptive Resource Utilization via Feedback Control for Streaming ApplicationsProceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 0110.1109/IPDPS.2005.81Online publication date: 4-Apr-2005
https://dl.acm.org/doi/10.1109/IPDPS.2005.81
Xie TSung AQin X(2005)Dynamic Task Scheduling with Security Awareness in Real-Time SystemsProceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 1610.1109/IPDPS.2005.185Online publication date: 4-Apr-2005
https://dl.acm.org/doi/10.1109/IPDPS.2005.185
Steiger CWalder HPlatzner M(2004)Operating Systems for Reconfigurable Embedded PlatformsIEEE Transactions on Computers10.1109/TC.2004.9953:11(1393-1407)Online publication date: 1-Nov-2004
https://dl.acm.org/doi/10.1109/TC.2004.99
Abdelzaher TSharma VLu C(2004)A Utilization Bound for Aperiodic Tasks and Priority Driven SchedulingIEEE Transactions on Computers10.1109/TC.2004.126183953:3(334-350)Online publication date: 1-Mar-2004
https://dl.acm.org/doi/10.1109/TC.2004.1261839
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents