Article

Efficient scheduling of sporadic, aperiodic, and periodic tasks with complex constraints

Authors:

Gerhard FohlerAuthors Info & Claims

RTSS'10: Proceedings of the 21st IEEE conference on Real-time systems symposium

Pages 207 - 216

Published: 27 November 2000 Publication History

Abstract

Many industrial applications with real-time demands are composed of mixed sets of tasks with a variety of requirements. These can be in the form of standard timing constraints, such as period and deadline, or complex, e.g., to express application specific or non temporal constraints, reliability, performance, etc. Arrival patterns determine whether tasks will be treated as periodic, sporadic, or aperiodic. As many algorithms focus on specific sets of task types and constraints only, system design has to focus on those supported by a particular algorithm, at the expense of the rest.

In this paper, we present an algorithm to deal with a combination of mixed sets of tasks and constraints: periodic tasks with complex and simple constraints, soft and firm aperiodic, and sporadic tasks. Instead of providing an algorithm tailored for a specific set of constraints, we propose an EDF based runtime algorithm, and the use of an offline scheduler for complexity reduction to transform complex constraints into the EDF model. At runtime, an extension to EDF, two level EDF, ensures feasible execution of tasks with complex constraints in the presence of additional tasks or overloads. We present an algorithm for handling offline guaranteed sporadic tasks, with minimum interarrival times, in this context which keeps track of arrivals of instances of sporadic tasks to reduce pessimism about future sporadic arrivals and improve response times and acceptance of firm aperiodic tasks.

A simulation study underlines the effectiveness of the proposed approach.

References

[1]

L. Abeni and G. Buttazzo. Integrating multimedia applications in hard real-time systems. In Proceedings of Real-Time Systems Symposium, Dec. 1998.

[2]

S. Baruah, G. Buttazzo, S. Gorinsky, and G. Lipari. Scheduling periodic task systems to minimize output jitter. In Sixth International Conference on Real-Time Computing Systems and Applications, Dec. 1999.

[3]

G. Buttazzo, A. Casile, G. Lamastra, and G. Lipari. A scheduling simulator for real-time distributed systems. In Proceedings of the IFAC Workshop on Distributed Computer Control Systems (DCCS '98), 1999.

[4]

H. Chetto, M. Silly, and T. Bouchentouf. Dynamic scheduling of real-time tasks under precedence constraints. Real-Time Systems Journal, 2(3):181-194, Sept. 1990.

[5]

R. Davis, K. Tindell, and A. Burns. Scheduling slack time in fixed priority pre-emptive systems. In Proceedings of the Real-Time Symposium, pages 222-231, Dec. 1993.

[6]

M. DiNatale and J. Stankovic. Applicability of simulated annealing methods to real-time scheduling and jitter control. In Proceedings of Real-Time Systems Symposium, Dec. 1995.

[7]

G. Fohler. Flexibility in Statically Scheduled Hard Real-Time Systems. PhD thesis, Technische Universität Wien, Austria, Apr. 1994.

[8]

G. Fohler. Joint scheduling of distributed complex periodic and hard aperiodic tasks in statically scheduled systems. In Proc. 16th Real-time Systems Symposium, Pisa, Italy, 1995.

[9]

M. Garey, D. Johnson, B. Simons, and R. Tarjan. Scheduling unit-time tasks with arbitrary release times and dead lines. IEEE Transactions on Software Engineering, 10(2):256- 269, May 1981.

[10]

R. Gerber, W. Pugh, and M. Saksena. Parametric dispatching of hard real-time tasks. IEEE Transactions on Computers, 44(3), March 1995.

[11]

D. Isovic andl G. Fohler. Handling sporadic tasks in off-line scheduled distributed hard real-time systems. Proc. of 11th EUROMICRO conf. on RT systems, York, UK, June 1999.

[12]

D. Isovic and G. Fohler. Online handling of hard aperiodic tasks in time triggered systems. In Proceedings of the 11th Euromicro Conference on Real-Time Systems, June 1999.

[13]

F. Jahanian, R. Lee, and A. Mok. Semantics of modechart in real time logic. In Proc. of the 21st Hawaii International Conference on Systems Sciences, pages 479-489, Jan. 1988.

[14]

K. Jeffay. Scheduling sporadic tasks with shared resources in hard real-time systems. Dept. of Comp. Sci., Univ. of North Carolina at Chapel Hill, 1992.

[15]

K. Jeffay and D. Stone. Accounting for interrupt handling costs in dynamic priority task systems. In Proceedings of Real-Tune Systems Symposium, pages 212-221, Dec. 1993.

[16]

H. Kopetz. Sparse time versus dense time in distributed real time systems. In Proc. of the Second Int. Workshop on Responsice Comp. Sys., Saitama, Japan, Oct. 1992.

[17]

C. Liu and J. Layland. Scheduling algorithms for multiprogramming in hard real-time environment. Journ. of the ACM, 20, 1, Jan. 1973.

[18]

A. K. Mok. Fundamental Design Problems of Distributed Systems for the Hard Real-Time Environment. PhD thesis, MIT, 1983. Report MIT/LCS/TR-297.

[19]

P. Puschner and C. Koza. Calculating the maximum execution time of real-time programs. RT Systems Journal, 1989.

[20]

K. Ramamritham. Allocation and scheduling of complex periodic tasks. In International Conference on Distributed Computing Systems, pages 108-115, 1990.

[21]

B. Sprunt, L. Sha, and J. Lehoczky. Aperiodic task scheduling for hard real-time systems. Real-Time Systems Journal, 1(1):27-60, June 1989.

[22]

M. Spuri, G. C. Buttazzo, and F. Sensini. Robust aperiodic scheduling under dynamic priority systems. Proceedings of Real-Tune Systems Symposium, Dec. 1995.

[23]

J. Stankovic, K. Ramamritham, and C.-S. Cheng. Evaluation of a flexible task scheduling algorithm for distributed hard real-time systems. IEEE Trans. on comp., 34(12), Dec 1995.

[24]

S. R. Thuel and J. Lehoczky. Algorithms for scheduling hard aperiodic tasks in fixed-priority systems using slack stealing. In Proceedings of the Real-Time Symposium, pages 22-33, San Juan, Puerto Rico, Dec. 1994.

[25]

T. Tia, W. Liu, J. Sun, and R. Ha. A linear-time optimal acceptance test for scheduling of hard real-time tasks. Dept. of Comp. Sc., Univ. of Illinois at Urbana-Champaign§, 1994.

[26]

K. Tindell and J. Clark:. Holistic schedulabilily analysis for distributed hard real-time systems. Microprocessing and Microprogramming, 50(2-3), 1994.

[27]

M. Törngren. Fundamentals of implementing real-time control applications in distributed computer systems. Real-Time Systems, 1997.

[28]

J. Wurtz and K. Schild. Scheduling of time-triggered real-time systems. Technical report, German Research centre for Artificial Intelligence - DKFI GmbH, 1997.

[29]

V. Yodaiken. Rough notes on priority inheritance. Technical report, New Mexico Institut of Mining, 1998.

Cited By

Minaeva AHanzálek Z(2021)Survey on Periodic Scheduling for Time-triggered Hard Real-time SystemsACM Computing Surveys10.1145/343123254:1(1-32)Online publication date: 5-Mar-2021
https://dl.acm.org/doi/10.1145/3431232
Américo JRudametkin WDonsez DOssowski SLecca P(2012)Managing the dynamism of the OSGi Service Platform in real-time Java applicationsProceedings of the 27th Annual ACM Symposium on Applied Computing10.1145/2245276.2231952(1115-1122)Online publication date: 26-Mar-2012
https://dl.acm.org/doi/10.1145/2245276.2231952
Mamat ALu YDeogun JGoddard S(2012)Efficient real-time divisible load schedulingJournal of Parallel and Distributed Computing10.1016/j.jpdc.2012.09.00372:12(1603-1616)Online publication date: 1-Dec-2012
https://dl.acm.org/doi/10.1016/j.jpdc.2012.09.003
Show More Cited By

Efficient scheduling of sporadic, aperiodic, and periodic tasks with complex constraints

Recommendations

Dynamic Real-time Scheduling of Firm Periodic Tasks with Hard and Soft Aperiodic Tasks

In this paper, we address the problem of the dynamic scheduling of skippable periodic task sets (i.e., period tasks allowing occasional skips of instances), together with aperiodic tasks. Scheduling of tasks is handled thanks to the merging of two ...
A Reservation-Based Algorithm for Scheduling Both Periodic and Aperiodic Real-Time Tasks

This paper considers the problem of scheduling both periodic and aperiodic tasks in real-time systems. A new, called reservation-based (RB), algorithm is proposed for ordering the execution of real-time tasks. This algorithm can guarantee all periodic-...
Scheduling periodic and aperiodic tasks in hard real-time computing systems
SIGMETRICS '91: Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems

Scheduling periodic and aperiodic tasks to meet their time constraints has been an important issue in the design of real-time computing systems. Usually, the task scheduling algorithms in such systems must satisfy the deadlines of periodic tasks and ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

RTSS'10: Proceedings of the 21st IEEE conference on Real-time systems symposium

November 2000

310 pages

ISBN:0769509002

General Chair:
Wei Zhao
Texas A&M University

Sponsors

IEEE-CS\DATC: IEEE Computer Society

Publisher

IEEE Computer Society

United States

Publication History

Published: 27 November 2000

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Minaeva AHanzálek Z(2021)Survey on Periodic Scheduling for Time-triggered Hard Real-time SystemsACM Computing Surveys10.1145/343123254:1(1-32)Online publication date: 5-Mar-2021
https://dl.acm.org/doi/10.1145/3431232
Américo JRudametkin WDonsez DOssowski SLecca P(2012)Managing the dynamism of the OSGi Service Platform in real-time Java applicationsProceedings of the 27th Annual ACM Symposium on Applied Computing10.1145/2245276.2231952(1115-1122)Online publication date: 26-Mar-2012
https://dl.acm.org/doi/10.1145/2245276.2231952
Mamat ALu YDeogun JGoddard S(2012)Efficient real-time divisible load schedulingJournal of Parallel and Distributed Computing10.1016/j.jpdc.2012.09.00372:12(1603-1616)Online publication date: 1-Dec-2012
https://dl.acm.org/doi/10.1016/j.jpdc.2012.09.003
Castillo CRouskas GHarfoush K(2011)Online algorithms for advance resource reservationsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2011.01.00371:7(963-973)Online publication date: 1-Jul-2011
https://dl.acm.org/doi/10.1016/j.jpdc.2011.01.003
Rizvanovic LIsovic DFohler G(2007)Integrated global and local quality-of-service adaptation in distributed, heterogeneous systemsProceedings of the 2007 international conference on Embedded and ubiquitous computing10.5555/1780745.1780770(219-233)Online publication date: 17-Dec-2007
https://dl.acm.org/doi/10.5555/1780745.1780770
Mohammadi AAkl SWainer G(2007)Heuristic scheduling algorithms designed based on properties of optimal algorithm for soft real-time tasksProceedings of the 2007 Summer Computer Simulation Conference10.5555/1357910.1357986(481-488)Online publication date: 16-Jul-2007
https://dl.acm.org/doi/10.5555/1357910.1357986
Meyerowitz TPinello CSangiovanni-Vincentelli AGetreu IFix LLavagno L(2003)A tool for describing and evaluating hierarchical real-time bus scheduling policiesProceedings of the 40th annual Design Automation Conference10.1145/775832.775913(312-317)Online publication date: 2-Jun-2003
https://dl.acm.org/doi/10.1145/775832.775913
Fohler GIsović DLennvall TVuolle R(2002)SALSART - a web based cooperative environment for offline real-time schedule designProceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing10.5555/1895489.1895500(63-70)Online publication date: 9-Jan-2002
https://dl.acm.org/doi/10.5555/1895489.1895500

View Options

View options

Media

Figures

Other

Tables

View Table of Contents