LSTF: A new scheduling policy for complex real-time tasks in multiple processor systems

Automatica

Volumn 33, Issue 5, 1997, Pages 921-926

  Cheng, Bo Chao ^a   Stoyenko, Alexander D ^a   Marlowe, Thomas J ^b   Baruah, Sanjoy K ^a  

^a NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

^b SETON HALL UNIVERSITY   (United States)

Author keywords

Graphs; Parallel processors; Performance analysis; Real time tasks; Scheduling algorithms

Indexed keywords

COMPUTER SIMULATION; GRAPH THEORY; MULTIPROCESSING SYSTEMS; PARALLEL PROCESSING SYSTEMS; PERFORMANCE; REAL TIME SYSTEMS; SCHEDULING;

LEAST SPACE TIME FIRST; PRECEDENCE GRAPH; SCHEDULING ALGORITHM;

ALGORITHMS;

EID: 0031130974     PISSN: 00051098     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0005-1098(96)00245-2     Document Type: Article

References (17)

1. Bruno, J. (1981) Deterministic and stochastic scheduling problems with treelike precedence constraints. Presented at NATO Conference.
2. Cheng, B.-C. (1996) Least space-time first scheduling algorithm: scheduling non-simple tasks with hard deadline on parallel machines. PhD thesis, Department of CIS, New Jersey Institute of Technology.
3. Cheng, S., Stankovic, J. and Ramamritham, K. (1986) Dynamic scheduling of groups of tasks with precedence constraints in distributed hard real-time systems. In Proc. RTSS'86, New Orleans, LA, pp. 166-174.
4. Hou, C.-K. and Shin, K. G. (1992) Allocation of periodic task modules with precedence and deadline constraints in distributed real-time systems. In Proc. Real-time Systems Symp., Phoenix, AZ, pp. 146-155.
5. Hu, T. C. (1961) Parallel sequencing and assembly line program. Oper. Res. 841-848.
6. Kopetz, H., Damm, A., Koza, Ch., Mulazzani, M., Schwabl, W., Senft, Ch. and Zainlinger, R. (1989) Distributed fault-tolerant real-time systems: The MARS Approach. IEEE Micro 9(1), 25-40.
7. Leung, J. Y.-T. (1989) A new algorithm for scheduling periodic, real-time tasks. Algorithmica 4, 209-219.
8. Levi, S.-T. and Agrawala, A. (1990) Real Time System Design. McGraw-Hill, New York.
9. Liu, C. L. and Layland J. (1973) Scheduling algorithm for multiprogramming in a hard real-time environment. J. ACM 20, 46-61.
10. Ramamritham, K., Stankovic, J. A. and W. Zhao (1989) Distrubuted scheduling of tasks with deadlines and resource requirements. IEEE Trans. Comput. 38, 1111-1123.
11. Robbins, K. A. and Robbins, S. (1995) Practical UNIX Programming: A Guide to Concurrency, Communication, and Multithreading. Prentice-Hall, Englewood Cliffs, NJ.
12. Stankovic, J. A. and K. Ramamritham, (1991) The spring kernel: A new paradigm for real-time systems. IEEE Software, 8(3), 62-72.
13. Stoyenko, A. D. and L. Georgiadis (1992) On optimal lateness and tardiness scheduling in real-time systems. Computing 47, 215-234.
14. Stoyenko, A. D. and T. J. Marlowe (1992) Polynomial-time transformations and schedulability analysis of parallel real-time programs with restricted resource contention. J. Real-time Syst. 4, 307-329.
15. Stoyenko, A. D., V. C. Harnacher and R. C. Holt (1991) Analyzing hard-real-time programs for guaranteed schedulability. IEEE Trans. Software Engng, 17, 737-750.
16. Xu, J. (1993) Multiprocessor scheduling of processes with release times, deadlines, precedence, and exclusion relations. IEEE Trans. Software Engng 19, 139-154.
17. Zhou, H., Schwan K. and Akyildiz, I. F. (1992) Performance effects of information sharing in a distributed multiprocessor real-time scheduler. In Proc. Real-time System Symp., Phoenix, AZ, pp. 46-55.