Approximation algorithms for scheduling time-critical jobs on multiprocessor systems

Handbook of Scheduling: Algorithms, Models, and Performance Analysis

Volumn , Issue , 2004, Pages 32-1-32-30

  Dhall, Sudarshan K ^a  

^a University of Oklahoma   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85055823554     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (20)

1. Liu, C. L. and Layland, J. W. (1973). Scheduling Algorithms for Multiprogramming in a Hard-Real- Time Environment. Journal of the ACM, 20, pp. 46–61.
2. Serlin, P. (1972). Scheduling of Time-Critical Processes, Proceedings of the Spring Joint Computers Conference, 40, pp. 925–932.
3. Devillers, R. and Goossens, J. (2000). Liu and Layland’s Schedulability Test Revisited. Information Processing Letters, 73(5-6), pp. 157–161.
4. Burchard, A., Liebeherr, J., Oh, Y., and Son, S. H. (1995). New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems. IEEE Transactions on Computers, 44(12), pp. 1429–1442.
5. Dertouzos, Michael L. and Mok, Aloysius K. (1989). Multiprocessor On-line Scheduling of Hard- Real-Time Tasks. IEEE Transactions on Software Engineering, 15(12), pp. 1497–1506.
6. Leung, J. Y. T. (1989). A New Algorithm for Scheduling Periodic Real-Time Tasks. Algorithmica, 4, pp. 209–219.
7. Leung, J. Y. T. and Whitehead, J. (1982). On the Complexity of Fixed-Priority Scheduling of Periodic Real-Time Tasks. Performance Evaluation, 2, pp. 237–250.
8. Davari, S. and Dhall, S. K. (1986). On a Real-Time Task Allocation Problem. Proceedings of the Nineteenth Annual Hawaii International Conference on Information Sciences and Systems, pp. 133–141.
9. Davari, S. and Dhall, S. K. (1986). A Simple On-line Algorithm for Real-Time Tasks Allocation, Proceedings of the Twentieth Conference on Information Sciences and Systems, Princeton, NJ, pp 178–182.
10. Davari, S. and Dhall, S. K. (1986). An On-line Algorithm for Real-Time Tasks Allocation, Proceedings of the Real-Time Systems Symposium, pp. 194–200.
11. Davari, S. and Dhall, S. K. (1995). On-line Algorithms for Allocating Periodic-time-critical Tasks on Multiprocessor Systems. Informatica, 19, pp. 83–96.
12. Dhall, S. K. (1977). Scheduling Periodic Time-Critical Jobs on Single and Multiprocessor Systems. University of Illinois Technical Report No. UIUCDCS-R-77–859.
13. Dhall, S. K. and Liu, C. L. (1978). On a Real-Time Scheduling Problem. Operations Research, 26(1), pp. 127–140.
14. Oh, Y. and Son, S. H. (1994). Allocating Fixed-Priority Periodic Tasks on Multiprocessor Systems. Journal of Real-Time Systems, 5, pp. 1–33.
15. Johnson, D. S. (1974). Fast Algorithms for Bin-Packing. Journal of Computer System Science 8, pp. 272–314.
16. Johnson, D. S., Demers, A., Ullman, J. D, Garey, M. R., and Graham, R. L. (1974). Worst-Case Performance Bound for Simple One-dimensional Packing Algorithms. SIAM Journal of Computing, 3, pp. 299–325.
17. Lee, C. C. and Lee, D. T. (1985). A Simple On-line Bin-Packing Algorithm. Journal of the ACM. 32(3), pp. 562–572.
18. Garey, Michael R. and Johnson, David S. (1979) Computers and Intractability A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco.
19. Lehoczky, J. P., Sha, L., and Ding, Y. (1989). The Rate-Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior. IEEE Real-Time Symposium, pp. 166–171.
20. Oh, Dong-Ik and Baker, T. P. (1998). Utilization Bounds for N-Processor RateMonotone Scheduling with Static Processor Assignment. Real-Time Systems, 15, 183–192.