research-article

Allocation and Scheduling of Precedence-Related Periodic Tasks

Author:

Krithi RamamrithamAuthors Info & Claims

IEEE Transactions on Parallel and Distributed Systems, Volume 6, Issue 4

Pages 412 - 420

https://doi.org/10.1109/71.372795

Published: 01 April 1995 Publication History

Abstract

This paper discusses a static algorithm for allocating and scheduling components of periodic tasks across sites in distributed systems. Besides dealing with the periodicity constraints, (which have been the sole concern of many previous algorithms), this algorithm handles precedence, communication, as well as replication requirements of subtasks of the tasks. The algorithm determines the allocation of subtasks of periodic tasks to sites, the scheduled start times of subtasks allocated to a site, and the schedule for communication along the communication channel(s). Simulation results show that the heuristics and search techniques incorporated in the algorithm are very effective.Index Terms Real-time systems, task allocation, scheduling, periodic tasks, precedence constraints, distributed systems.

References

[1]

J. A. Bannister and K. S. Trivedi, “Task allocation in fault-tolerant distributed systems,” in Acta Informatica . New York: Springer-Verlag, 1983, vol. 20.

[2]

K. Efe, “Heuristic models of task assignment scheduling in distributed systems,” IEEE Comput. , pp. 50–56, June 1982.

Digital Library

[3]

M. R. Garey and D. S. Johnson, “Strong NP-completeness results: Motivation, examples, and implications,” JACM , vol. 25, no. 3, pp. 499–508, July 1978.

Digital Library

[4]

H. Kasahara and S. Narita, “Practical multiprocessor scheduling algorithms for efficient parallel processing,” IEEE Trans. Comput. , vol C-33, pp. 1023–1029, Nov. 1984.

[5]

H. Kopetz, A, Damm, C. Koza, and M. Mulozzani, “Distributed fault tolerant real-time systems: The Mars approach,” IEEE Micro , pp. 25–40, 1989.

Digital Library

[6]

C. M. Krishna and K. G. Shin, “On scheduling tasks with a quick recovery from failure,” IEEE Trans. Comput. , pp 448–155, May 1986.

Digital Library

[7]

G. Le Lann, “The 802.3D protocol: A variation on the IEEE 802.3 standard for real-time LAN's,” INRIA, Tech. Rep., July 1987.

[8]

C. L. Liu and J. Layland, “Scheduling algorithms for multiprogramming in a hard real-time environment,” J. ACM , vol. 20, no. 1, 1973.

Digital Library

[9]

P.-Y. R. Ma, E. Y. S. Lee, and M. Tsuchiya, “A task allocation model for distributed computing systems,” IEEE Trans. Comput. , vol. C-31, 1982.

[10]

L. D. Molesky, “Random graph generation in a Unix environment,” Univ. Massachusetts, Tech. Rep., Sept. 1989.

[11]

D. T. Peng and K. G. Shin, “Static allocation of periodic tasks with precedence constraints in distributed real-time systems,” in Proc. 9th Int. Conf. Distrib. Comput. , June 1989, pp. 190–198.

[12]

K. Ramamritham, “Channel characteristics in local area hard real-time systems,” ISDN and Comput. Networks , pp. 3–13, 1987,

Digital Library

[13]

——, “Allocation and scheduling of complex periodic tasks,” Univ. Massachusetts, Tech. Rep. 90-01, Oct. 1989; revised Jan. 1992.

[14]

K. Ramamritham, and J. M. Adan, “Providing for dynamic arrivals during the static allocation and scheduling of complex periodic tasks,” Univ. Massachusetts, Tech. Rep., Oct. 1990.

[15]

K. Ramamritham, J. Stankovic, and P. Shiah, “Efficient scheduling algorithms for real-time multiprocessor systems,” IEEE Trans. Parallel and Distribut. Syst. , vol. 1, Apr. 1990.

Digital Library

[16]

L. Sha, J. P. Lehoczky, and R. Rajkumar, “Solutions for some practical problems in prioritized preemptive scheduling,” IEEE Real-Time Syst. Symp. , 1986.

[17]

——, “Priority inheritance protocols: An approach to real-time synchronization,” IEEE Trans. Comput. , vol. 39, pp. 1175–1185, 1990.

Digital Library

[18]

J. A. Stankovic and K. Ramamritham, “The Spring kernel: A new paradigm for real-time systems,” IEEE Software , pp. 62–72, May 1991.

Digital Library

[19]

J. Xu and D. L. Parnas, “Scheduling processes with release times, deadlines, precedence constraints, and exclusion relations,” IEEE Trans. Software Eng. , vol. 16, pp. 360–369, Mar. 1990.

Digital Library

[20]

W. Zhao and K. Ramamritham, “Simple and integrated heuristic algorithms for scheduling tasks with time and resource constraints,” J. Syst. Software , 1987.

Digital Library

Cited By

Alkoudsi MFohler G(2024)Scheduling Dynamic Task-Sets in Time-Triggered Real-Time SystemsProceedings of the 32nd International Conference on Real-Time Networks and Systems10.1145/3696355.3699699(48-58)Online publication date: 6-Nov-2024
https://dl.acm.org/doi/10.1145/3696355.3699699
Kim SKwon HSong JJo JChen YLai LChandra VAamodt TSwift MJerger N(2023)DREAM: A Dynamic Scheduler for Dynamic Real-time Multi-model ML WorkloadsProceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 410.1145/3623278.3624753(73-86)Online publication date: 25-Mar-2023
https://dl.acm.org/doi/10.1145/3623278.3624753
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
Show More Cited By

Recommendations

Online Scheduling of Precedence Constrained Tasks

A fundamental problem in scheduling theory is that of scheduling a set of n tasks, with precedence constraints, on $m \ge 1$ identical and parallel processors so as to minimize the makespan (schedule length). In the past, research has focused on the ...
Scheduling Tasks with AND/OR Precedence Constraints

In traditional precedence-constrained scheduling a task is ready to execute when all its predecessors are complete. We call such a task an AND task. In this paper we allow certain tasks to be ready when just one of their predecessors is complete. ...
Scheduling tasks with AND/OR precedence constraints
SPDP '90: Proceedings of the 1990 IEEE Second Symposium on Parallel and Distributed Processing

In traditional precedence-constrained scheduling a task is ready to execute when all its predecessors are complete. Such a task is called an AND task. The authors allow certain tasks, known as OR tasks, to be ready when just one of their predecessors is ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Parallel and Distributed Systems

IEEE Transactions on Parallel and Distributed Systems Volume 6, Issue 4

April 1995

112 pages

ISSN:1045-9219

Editor:
Duncan H. Lawrie
Univ. of Illinois at Urbana-Champaign, Urbana

Issue’s Table of Contents

Copyright © Copyright © 1995 IEEE. All Rights Reserved.

Publisher

IEEE Press

Publication History

Published: 01 April 1995

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

40
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Alkoudsi MFohler G(2024)Scheduling Dynamic Task-Sets in Time-Triggered Real-Time SystemsProceedings of the 32nd International Conference on Real-Time Networks and Systems10.1145/3696355.3699699(48-58)Online publication date: 6-Nov-2024
https://dl.acm.org/doi/10.1145/3696355.3699699
Kim SKwon HSong JJo JChen YLai LChandra VAamodt TSwift MJerger N(2023)DREAM: A Dynamic Scheduler for Dynamic Real-time Multi-model ML WorkloadsProceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 410.1145/3623278.3624753(73-86)Online publication date: 25-Mar-2023
https://dl.acm.org/doi/10.1145/3623278.3624753
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
Bhat ASamii SRajkumar R(2019)Practical task allocation for software fault-tolerance and its implementation in embedded automotive systemsReal-Time Systems10.1007/s11241-019-09339-755:4(889-924)Online publication date: 1-Oct-2019
https://dl.acm.org/doi/10.1007/s11241-019-09339-7
Saidi SPernet NSorel Y(2017)Automatic parallelization of multi-rate FMI-based co-simulation on multi-coreProceedings of the Symposium on Theory of Modeling & Simulation10.5555/3108905.3108910(1-12)Online publication date: 23-Apr-2017
https://dl.acm.org/doi/10.5555/3108905.3108910
Bertout AForget JOlejnik RJan MBen Hedia BGoossens JMaiza C(2014)Minimizing a real-time task set through Task ClusteringProceedings of the 22nd International Conference on Real-Time Networks and Systems10.1145/2659787.2659820(23-31)Online publication date: 8-Oct-2014
https://dl.acm.org/doi/10.1145/2659787.2659820
Bertout AForget JOlejnik RCho YShin SKim SHung CHong J(2014)A heuristic to minimize the cardinality of a real-time task set by automated task clusteringProceedings of the 29th Annual ACM Symposium on Applied Computing10.1145/2554850.2554958(1431-1436)Online publication date: 24-Mar-2014
https://dl.acm.org/doi/10.1145/2554850.2554958
Al-Oudat NManimaran G(2012)Task scheduling in heterogeneous distributed systems with security and QoS requirementsInternational Journal of Communication Networks and Distributed Systems10.1504/IJCNDS.2012.0478949:1/2(21-36)Online publication date: 1-Jul-2012
https://dl.acm.org/doi/10.1504/IJCNDS.2012.047894
Bocewicz GBach IBanaszak Z(2009)Logic-algebraic method based and constraints programming driven approach to AGVs schedulingInternational Journal of Intelligent Information and Database Systems10.1504/IJIIDS.2009.0230383:1(56-74)Online publication date: 1-Feb-2009
https://dl.acm.org/doi/10.1504/IJIIDS.2009.023038
Islam SSuri NBalogh ACsertán GPataricza A(2009)An optimization based design for integrated dependable real-time embedded systemsDesign Automation for Embedded Systems10.1007/s10617-009-9041-713:4(245-285)Online publication date: 1-Dec-2009
https://dl.acm.org/doi/10.1007/s10617-009-9041-7
Show More Cited By

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents