This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Distributed Scheduling of Tasks with Deadlines and Resource Requirements
August 1989 (vol. 38 no. 8)
pp. 1110-1123
A set of four heuristic algorithms is presented to schedule tasks that have headlines and resource requirements in a distributed system. When a task arrives at a node, the local scheduler at that node attempts to guarantee that the task will complete execution on that node before its deadline. If the attempt fails, the scheduling components on individual nodes cooperate to determine which other

[1] S. Biyabani, "The integration of deadlines and criticalness in hard real-time scheduling," Masters Thesis, Univ. of Massachusetts, May 1988.
[2] S. Cheng, J. A. Stankovic, and K. Ramamritham, "Dynamic scheduling of groups of tasks with precedence constraints in distributed hard real-time systems," inProc. Real-Time Syst. Symp., Dec. 1986.
[3] M. Dertouzos, "Control robotics: The procedural control of physical process, " inProc. IFIP Congress, 1974.
[4] K. Efe, "Heuristic models of task assignment scheduling in distributed systems,"IEEE Computer, June 1982.
[5] D. C. Farber and K. C. Larson, "The distributed computer system," inProc. Symp. Comput. Commun. Networks, Teletraffic, 1972.
[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. Grahamet al., "Optimization and approximation in deterministic sequencing and scheduling: A survey,"Ann. Discrete Math., vol. 5, 1979.
[8] H. H. Johnson and M. S. Madison, "Deadline scheduling for a real-time multiprocessor," inProc. NTIS(N76 15843), Springfield, VA, May 1974.
[9] D. W. Leinbaugh and M.-R. Yamini, "Guaranteed response times in a distributed hard-real-time environment,"IEEE Trans. Software Eng., vol. SE-12, pp. 1139-1144, Dec. 1986.
[10] D. B. Lenat, "Theory formation by heuristic search--The nature of heuristics II: Background and examples,"Artif. Intell., vol. 21, 1983.
[11] C. L. Liu and J. W. Layland, "Scheduling algorithms for multiprogramming in a hard real-time environment,"J. ACM, vol. 20, no. 1, pp. 46-61, Jan. 1973.
[12] M. Livny and M. Melmen, "Load balancing in homogeneous broadcast distributed systems," inProc. Computer Network Perform. Symp., 1982, pp. 47-55.
[13] R. P. Ma, E. Y. S. Lee, and M. Tsuchiya, "A task allocation model for distributed computing systems,"IEEE Trans. Comput., vol. C-31, Jan. 1982.
[14] P. Ma, "A model to solve timing-critical application problems in distributed computer systems,"IEEE Computer, Jan. 1984.
[15] A. K. Mok and M. L. Dertouzos, "Multiprocessor scheduling in a hard real-time environment," inProc. Seventh Texas Conf. Comput. Syst., Nov. 1978.
[16] R. Muntz and E. Coffman, "Preemptive scheduling of real-time tasks on multiprocessor systems,"J. ACM, vol. 17, no. 2, pp. 324-338, 1970.
[17] K. Ramamritham and J. A. Stankovic, "Dynamic task scheduling in distributed hard real-time systems,"IEEE Software, vol. 1, May 1984.
[18] K. Ramamritham, J. Stankovic, and W. Zhao, "Distributed scheduling of tasks with deadlines and resource requirements," COINS Tech. Rep. 88-92, Univ. of Massachusetts, Oct. 1988.
[19] K. Ramamritham, J. Stankovic, and P. Shiah, "O(n) scheduling algorithms for real-time multiprocessor systems," inProc. Int. Conf. Parallel Processing Syst., Aug. 1989.
[20] R. G. Smith, "The contract net protocol: High level communication and control in a distributed problem solver,"IEEE Trans. Comput., vol. C-29, Dec. 1980.
[21] J. A. Stankovic, K. Ramamritham, and S. Cheng, "Evaluation of a flexible task scheduling algorithm for distributed hard real-time systems,"IEEE Trans. Comput., Dec. 1985.
[22] T. Teixeira, "Static priority interrupt scheduling," inProc. Seventh Texas Conf. Comput. Syst., Nov. 1978.
[23] Y. Wang and R. Morris, "Load sharing in distributed systems,"IEEE Trans. Comput., vol. C-34, Mar. 1985.
[24] W. Zhao, K. Ramamritham, and J. Stankovic, "Scheduling tasks with resource requirements in hard real-time systems,"IEEE Trans. Software Eng., vol. SE-13, pp. 564-577, May 1987.
[25] W. Zhao and K. Ramamritham, "Simple and Integrated Heuristic Algorithms for Scheduling Tasks with Time and Resource Constraints,"J. Systems and Software, Vol. 7, 1987, pp. 195-205.

Index Terms:
distributed scheduling; simulation studies; tasks; deadlines; resource requirements; heuristic algorithms; distributed system; bidding algorithm; communication delay; task laxity; task computation times; hard real-time environment; distributed processing; heuristic programming; real-time systems; scheduling.
Citation:
K. Ramamritham, J.A. Stankovic, W. Zhao, "Distributed Scheduling of Tasks with Deadlines and Resource Requirements," IEEE Transactions on Computers, vol. 38, no. 8, pp. 1110-1123, Aug. 1989, doi:10.1109/12.30866
Usage of this product signifies your acceptance of the Terms of Use.