research-article

On Non-preemptive Scheduling of Recurring Tasks Using Inserted Idle Times

Authors:

M.K. VenkatraoAuthors Info & Claims

Information and Computation, Volume 117, Issue 1

Pages 50 - 62

https://doi.org/10.1006/inco.1995.1028

Published: 15 February 1995 Publication History

Abstract

We consider the problem of non-preemptively scheduling periodic and sporadic task systems on one processor using inserted idle times. For periodic task systems, we prove that the decision problem of determining whether a periodic task system is schedulable for all start times with respect to the class of algorithms using inserted idle times is NP-hard in the strong sense, even when the deadlines are equal to the periods. We then show that if there exists a polynomial time scheduling algorithm which correctly schedules a periodic task system T whenever T is feasible for all start times, then P = NP. We also prove that with respect to the same class of algorithms, the problem of determining whether there exist start times for which a periodic task system is feasible is also NP-hard in the strong sense even when the deadlines are equal to the periods. The second part of the paper concentrates on sporadic task systems and inserted idle times. It seems reasonable to suppose that to insert idle times properly, knowledge of future releases of tasks is required. Thus, inserted idle times should not be expected to have much use in scheduling sporadic task systems. We provide a formal basis for these intuitions by proving that if a sporadic task system is schedulable by an online algorithm that uses inserted idle times, then it is schedulable by an online algorithm that does not use inserted idle times. We also prove that there cannot exist an optimal on-line inserted idle time algorithm for scheduling sporadic task systems, even if the deadlines correspond to the minimum separation time between successive releases of the same task. We conclude by considering the amount of look-ahead needed to schedule sporadic tasks correctly.

References

[1]

Baruah, S., Howell, R., and Rosier, L. (1990a), Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor, J. Real-Time Systems 2, 301-324.

Digital Library

[2]

Baruah, S., Howell, R., and Rosier, L. (1993), Feasibility problems for recurring tasks on one processor, Theoret. Comput. Sci. 118, 3-24.

Digital Library

[3]

Baruah, S., Mok, A., and Rosier, L. (1990b), Preemptively scheduling hard-real-time sporadic tasks on one processor, in "Proceedings of the 11th Real-Time-Systems Symposium," pp. 182-190.

[4]

Dertouzos, M. (1974), Control Robotics: The procedural control of physical processors, in "Proceedings of the IFIP Congress," pp. 807-813.

[5]

Garey, M., and Johnson, D. (1977), Two-processor scheduling with start-times and deadlines, SIAM J. Comput. 6, 416-426.

Digital Library

[6]

Garey, M., and Johnson, D. (1979), "Computers and Intractability: A Guide to the Theory of NP-Completeness," Freeman, San Francisco.

[7]

Hong, K., and Leung, J. (1988), On-line scheduling of real-time tasks, in "Proceedings of the Real-Time Systems Symposium," pp. 244-250.

[8]

Jeffay, K., Stanat, D., and Martel, C. (1991), On nonpreemptive scheduling of periodic and sporadic tasks, in "Proceedings of the 12th IEEE Real-Time Systems Symposium," pp. 129-139.

[9]

Jeffay, K. (1989), "Analysis of a Synchronization and Scheduling Discipline for Real-Time Tasks with Preemption Constraints," Technical Report 89-07-02, University of Washington.

[10]

Labetoulle, J. (1974), Some theorems on real time scheduling, in "Computer Architecture and Networks" (Gelenbe, E., and Mahl, R., Eds.), pp. 285-293, North-Holland, Amsterdam.

[11]

Lawler, E., and Martel, C. (1981), Scheduling periodically occurring tasks on multiple processors, Inform. Process. Lett. 12, 9-12.

[12]

Lehoczky, J., Sha, L., and Stronider, J. (1987), Enhanced aperiodic responsiveness in hard real-time environments, in "Proceedings of the Real-Time Systems Symposium," pp. 261-270.

[13]

Leung, J., and Merrill, M. (1980), A note on preemptive scheduling of periodic, real-time tasks, Inform. Process. Lett. 11, 115-118.

[14]

Leung, J., and Whitehead, J. (1982), On the complexity of fixed-priority scheduling of periodic, real-time tasks. Performance Evaluation 2, 237-250.

[15]

Liu, C., and Layland, J. (1973), Scheduling algorithms for multiprogramming in a hard-real-time environment, J. Assoc. Comput. Mach. 20, 46-61.

Digital Library

[16]

Mok, A. (1983), "Fundamental Design Problems of Distributed Systems for the Hard Real-Time Environment," Ph.D. Thesis, MIT Laboratory for Computer Science.

[17]

Sprunt, B., Lehoczky, J., and Sha, L. (1988), Exploiting unused periodic time for aperiodic service using the extended priority exchange algorithm, in "Proceedings of the Real-Time Systems Symposium," pp. 251-258.

[18]

Sprunt, B., Sha, L., and Lehoczky, J. (1989), "Scheduling Sporadic and Aperiodic Events in a Hard Real-Time System," Technical Report ESD-TR-89-19, Carnegie Mellon University.

Cited By

Wang XLi ZMoor T(2019)SCT-based priority-free conditionally-preemptive scheduling of modular real-time systems with exact task execution timeDiscrete Event Dynamic Systems10.1007/s10626-019-00288-829:4(501-520)Online publication date: 1-Dec-2019
https://dl.acm.org/doi/10.1007/s10626-019-00288-8
Davis R(2014)A review of fixed priority and EDF scheduling for hard real-time uniprocessor systemsACM SIGBED Review10.1145/2597457.259745811:1(8-19)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.1145/2597457.2597458
Seo EKim SPark SLee J(2011)Dynamic alteration schemes of real-time schedules for I/O device energy efficiencyACM Transactions on Embedded Computing Systems10.1145/1880050.188005910:2(1-32)Online publication date: 7-Jan-2011
https://dl.acm.org/doi/10.1145/1880050.1880059
Show More Cited By

Index Terms

On Non-preemptive Scheduling of Recurring Tasks Using Inserted Idle Times

Recommendations

Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review

In the context of production scheduling, inserted idle time (IIT) occurs whenever a resource is deliberately kept idle in the face of waiting jobs. IIT schedules are particularly relevant in multimachine industrial situations where earliness costs and/...
Preemptive and non-preemptive scheduling on two unrelated parallel machines
Abstract
In this paper, for the problem of minimizing the makespan on two unrelated parallel machines we compare the quality of preemptive and non-preemptive schedules. It is known that there exists an optimal preemptive schedule with at most two ...
From preemptive to non-preemptive speed-scaling scheduling

We are given a set of jobs, each one specified by its release date, its deadline and its processing volume (work), and a single (or a set of) speed-scalable processor(s). We adopt the standard model in speed-scaling in which if a processor runs at speed ...

Comments

Information & Contributors

Information

Published In

cover image Information and Computation

Information and Computation Volume 117, Issue 1

Feb. 15, 1995

155 pages

ISSN:0890-5401

Editor:
Albert R. Meyer
Massachusetts Institute of Technology, Cambridge

Issue’s Table of Contents

Copyright © Academic Press.

Publisher

Academic Press, Inc.

United States

Publication History

Published: 15 February 1995

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
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

Wang XLi ZMoor T(2019)SCT-based priority-free conditionally-preemptive scheduling of modular real-time systems with exact task execution timeDiscrete Event Dynamic Systems10.1007/s10626-019-00288-829:4(501-520)Online publication date: 1-Dec-2019
https://dl.acm.org/doi/10.1007/s10626-019-00288-8
Davis R(2014)A review of fixed priority and EDF scheduling for hard real-time uniprocessor systemsACM SIGBED Review10.1145/2597457.259745811:1(8-19)Online publication date: 1-Feb-2014
https://dl.acm.org/doi/10.1145/2597457.2597458
Seo EKim SPark SLee J(2011)Dynamic alteration schemes of real-time schedules for I/O device energy efficiencyACM Transactions on Embedded Computing Systems10.1145/1880050.188005910:2(1-32)Online publication date: 7-Jan-2011
https://dl.acm.org/doi/10.1145/1880050.1880059
Peng HLin Y(2010)An optimal warning-zone-length assignment algorithm for real-time and multiple-QoS on-chip bus arbitrationACM Transactions on Embedded Computing Systems10.1145/1721695.17217019:4(1-39)Online publication date: 6-Apr-2010
https://dl.acm.org/doi/10.1145/1721695.1721701
Baruah S(2006)The Non-preemptive Scheduling of Periodic Tasks upon MultiprocessorsReal-Time Systems10.1007/s11241-006-4961-932:1-2(9-20)Online publication date: 1-Feb-2006
https://dl.acm.org/doi/10.1007/s11241-006-4961-9
Liu HNg WLim E(2005)Scheduling Queries to Improve the Freshness of a WebsiteWorld Wide Web10.1023/B:WWWJ.0000047378.69751.728:1(61-90)Online publication date: 1-Mar-2005
https://dl.acm.org/doi/10.1023/B%3AWWWJ.0000047378.69751.72
Yaiz RHeijenk G(2005)Providing QoS in BluetoothCluster Computing10.1007/s10586-005-6187-38:2-3(223-231)Online publication date: 1-Jul-2005
https://dl.acm.org/doi/10.1007/s10586-005-6187-3
Almeida LPedreiras PButtazzo G(2004)Scheduling within temporal partitionsProceedings of the 4th ACM international conference on Embedded software10.1145/1017753.1017772(95-103)Online publication date: 27-Sep-2004
https://dl.acm.org/doi/10.1145/1017753.1017772
Ali SKim JYu YGundala SGertphol SSiegel HMaciejewski APrasanna V(2002)Utilization-Based Heuristics for Statically Mapping Real-Time Applications onto the HiPer-D Heterogeneous Computing SystemProceedings of the 16th International Parallel and Distributed Processing Symposium10.5555/645610.661865Online publication date: 15-Apr-2002
https://dl.acm.org/doi/10.5555/645610.661865
Hamidzadeh BAtif YRamamritham K(1999)To Schedule or to ExecuteReal-Time Systems10.1023/A:100800732512916:2/3(281-313)Online publication date: 1-May-1999
https://dl.acm.org/doi/10.1023/A%3A1008007325129

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents