This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Allocation and Scheduling of Precedence-Related Periodic Tasks
April 1995 (vol. 6 no. 4)
pp. 412-420

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.

[1] J. A. Bannister and K. S. Trivedi,“Task allocation in fault-tolerant distributed systems,”inActa 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.
[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.
[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.
[6] C. M. Krishna and K. G. Shin,“On scheduling tasks with a quick recovery from failure,”IEEE Trans. Comput., vol. C-35, no. 5, pp. 448–455, May 1986.
[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.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 40-61, 1973.
[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,”inProc. 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,
[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.
[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] L. Sha, R. Rajkumar, and J.P. Lehoczky, “Priority Inheritance Protocols: An Approach to Real-Time Synchronization,” Technical Report CMU-CS-87-181, Dept. of Computer Science, Carnegie-Mellon Univ., Nov. 1987, IEEE Trans. Computers, vol. 39, no. 9, Sept. 1990.
[18] J. A. Stankovic and K. Ramamritham,“The Spring kernel: A new paradigm for real-time systems,”IEEE Software, pp. 62–72, May 1991.
[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.
[20] W. Zhao and K. Ramamritham,“Simple and integrated heuristic algorithms for scheduling tasks with time and resource constraints,”J. Syst. and Software, vol. 7, pp. 195–207, 1987.

Citation:
Krithi Ramamritham, "Allocation and Scheduling of Precedence-Related Periodic Tasks," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 4, pp. 412-420, April 1995, doi:10.1109/71.372795
Usage of this product signifies your acceptance of the Terms of Use.