Nonpreemptive Scheduling of Periodic Tasks in Uni- and Multiprocessor Systems

Algorithmica (New York)

Volumn 15, Issue 6, 1996, Pages 572-599

  Cai, Yang ^a   Kong, M C ^b  

^a SYNOPSYS INC   (United States)

^b UNIVERSITY OF KANSAS   (United States)

Author keywords

Algorithm; Computational complexity; Nonpreemptive task; Periodic task; Scheduling

Indexed keywords

EID: 0042436130     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01940882     Document Type: Article

References (14)

1. A. A. Bertossi and M. A. Bonuccelli, Preemptive scheduling of periodic jobs in uniform multiprocessor systems, Inform. Process. Lett., 16 (1983), 3-6.
2. J. -Y. Chung, J. W. S. Liu, and K. -J. Lin, Scheduling periodic jobs that allow imprecise results, IEEE Trans. Comput., 39 (1990), 1156-1174.
3. J. S. Deogun and M. C. Kong, On periodic scheduling of time-critical tasks, Proc. IFIP 10th World Computer Congress, 1986, pp. 791-796.
4. S. K. Dhall and C. L. Liu, On a real-time scheduling problem, Oper. Res., 26 (1978), 127-140.
5. M. R. Garey and D. S. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
6. M. J. Gonzalez, Jr., and J. W. Soh, Periodic job scheduling in a distributed processor system. IEEE Trans. Aerospace Electron. System, 12 (1976), 530-535.
7. K. Jeffay and R. Anderson, On optimal, non-preemptive scheduling of periodic and sporadic tasks, Proc. Real-Time Systems Symposium, 1991, pp. 129-139.
8. M. C. Kong, On periodic real-time scheduling algorithms, Ph.D. Dissertation, Department of Computer Science, University of Nebraska-Lincoln, Lincoln, NE, 1986.
9. M. C. Kong and J, S. Deogun, On non-preemptive periodic scheduling, Proc. 19th Hawaii International Conference on System Science, 1986.
10. E. L. Lawler and C. U. Martel, Scheduling periodically occurring tasks on multiple processors, Inform. Process. Lett., 12 (1981), 9-12.
11. J. Y. -T. Leung and M. L. Merrill, A note on preemptive scheduling of periodic, real-time tasks, Inform. Process. Lett., 11 (1980), 115-118.
12. J. Y. -T. Leung and J. Whitehead, On the complexity of fixed priority scheduling of periodic, real-time tasks, Performance Evaluation, 2(1982), 237-250.
13. C. L. Liu and J. W. Layland, Scheduling algorithms for multiprogramming in a hard-real-time environmem, J. Assoc. Comput. Mach., 20 (1973), 46-61.
14. W. Zhao, K. Ramamritham, and J. A. Stankovic, Scheduling tasks with resource requirements in hard real-time systems, IEEE Trans. Software Engrg., 13, 1987.