Non-preemptive real-time scheduling of multimedia tasks

Real-Time Systems

Volumn 17, Issue 1, 1999, Pages 23-39

  Dolev, Shlomi ^a   Keizelman, Alexander ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; MULTIMEDIA SYSTEMS; MULTIPROCESSING SYSTEMS; ONLINE SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS);

MULTIMEDIA NETWORKING; NON-PREEMPTIVE REAL TIME SCHEDULING;

REAL TIME SYSTEMS;

EID: 0032675696     PISSN: 09226443     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008033411290     Document Type: Article

References (16)

1. Baruah, S., Koren, G., Mao, D., et al. 1992. On the competitiveness of on-line real-time task scheduling. The Journal of Real-Time Systems 4(2): 122-144.
2. Bilas, A., Fritts, J., and Singh, J. P. 1997. Real-time parallel MPEG-2 decoding in software. Proc. of the 11th International Parallel Processing Symposium.
3. Baruah, S. Koren, G., Mishra, B. Raghunathan, A., Roiser, L., and Shasha, D. 1991. On-line scheduling in the presence of overload. IEEE Symposium on Foundations of Computer Science. San Juan, Puerto Rico, pp. 100-110.
4. Dertouzos, M. 1974. Control robotics: the procedural control of processes. Proc. IFIP. Cong., pp. 807-813
5. Dertouzos, M., and Mok, A. 1978. Multiprocessor scheduling in a hard real-time environment. Proc. of the 7th IEEE Conference on Computing Systems. Texas.
6. von Eicken, T., Basu, A., Buch, V., and Vogels, W. 1995. U-Net: A user-level network interface for parallel and distributed computing. Proc. of the 15th ACM Symposium in Operating Systems Principles. Copper Mountain, Colorado.
7. Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability: a guide to the theory of NP-Completeness. New York: W. H. Freeman and Company.
8. Jadev, D., and Choudhary, A. 1995. Designing and implementing high-performance media-on-demand servers. IEEE Parallel & Distributed Technology 3(2): 29-39.
9. Jeffay, K., Stanat, D. F., and Martel, C. U. 1991. On non-preemptive scheduling of periodic and sporadic tasks. IEEE Real-Time Systems Symposium, pp. 129-139.
10. Keizelman, A. 1998. Non-preemptive real-time scheduling of multimedia tasks. M.Sc. Thesis, Department of Mathematics and Computer Science, Ben-Gurion University of the Negev.
11. Khil, A., Maeng, S., and Cho, J. 1997. Non-preemptive scheduling of real-time periodic tasks with specified release times. IEICE Trans. Inf. & Syst. E80-D(5): 562-572.
12. Koren, G., and Shasha, D. 1994. 'MOCA: a multiprocessor on-line competitive algorithm for real-time scheduling. Theoretical Computer Science 128(1&2): 75-97.
13. Leung, J. Y-T. 1979. Bounds on list scheduling of UET tasks with restricted resource constraints. Information Processing Letters 9(4): 167-170.
14. Liu, C. L., and Layland, J. W. 1973. Scheduling algorithms for multiprogramming in a hard real time environment. Journal of the ACM 20(1): 46-61.
15. Locke, C. D. 1985. Best-effort decision making for real-time scheduling. Ph.D Thesis, Carnegie Mellon University, Pittsburgh, PA.
16. Sleator, D., and Tarjan, R. 1985. Amortized efficiency of list update and paging rules. CACM 28: 202-208.