A model of hierarchical real-time virtual resources

Proceedings - Real-Time Systems Symposium

Volumn , Issue , 2002, Pages 26-35

  Feng, Xiang Alex ^a   Mok, Aloysius K ^a  

^a University of Texas at Austin   (United States)

Author keywords

Open system; Real time scheduling; Real time virtual resource; Resource partition; Scheduling quantum

Indexed keywords

ALGORITHMS; COMPUTER OPERATING SYSTEMS; COMPUTER SIMULATION; CONSTRAINT THEORY; OPEN SYSTEMS; RESOURCE ALLOCATION; RESPONSE TIME (COMPUTER SYSTEMS); THEOREM PROVING; VIRTUAL REALITY;

REAL TIME SCHEDULING; REAL TIME VIRTUAL RESOURCES; RESOURCE PARTITION; RESOURCE SHARING; SCHEDULING QUANTUM; TIMING CONSTRAINTS;

REAL TIME SYSTEMS;

EID: 0036994517     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. S. Baruah. Overload tolerance for single-processor work-loads. In Real-Time Technology and Applications Symposium, pages 2-11, 1998.
2. S. Baruah, G. Buttazzo, S. Gorinsky, and G. Lipari. Scheduling periodic task systems to minimize output jitter. In The 6th International Conference on Real-Time Computing Systems and Applications, 1999.
3. S. K. Baruah, D. Chen, and A. K. Mok. Jitter concerns in periodic task systems. In IEEE Real-Time Systems Symposium, 1997.
4. Z. Deng and J. Liu. Scheduling real-time applications in an open environment. In IEEE Real-Time Systems Symposium, pages 308-319, December 1997.
5. P. Goyal, H. M. Vin, and H. Cheng. Start-time fair queuing: A scheduling algorithm for integrated servicespacket switching networks. Technical report, Dept. of Computer Sciences, Univ. of Texas at Austin (ftp://ftp.cs.utexas.edu/pub/techreports/tr96-02.ps.Z), 1996.
6. T. Kuo, K. Lin, and Y. Wang. An open real-time environment for parallel and distributed systems. In 20th International Conference on Distributed Computing Systems, pages 206-213, 2000.
7. T.-W. Kuo and C.-H. Li. A fixed-priority-driven open system architecture for real-time applications. In IEEE Real-Time Systems Symposium, pages 256-267, 1999.
8. K. Lee. Performance bounds in communication networks with variable-rate links. In SIGCOMM, pages 126-136, 1995.
9. G. Lipari and S. Baruah. Efficient scheduling of real-time multi-task applications in dynamic systems. In Real-Time Technology and Applications Symposium, pages 166-175, December 2000.
10. C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of ACM, 20(1), January 1973.
11. A. Mok and X. Feng. Towards compositionality in real-time resource partitioning based on regularity bounds. In IEEE Real-Time Systems Symposium, pages 129-138, 2001.
12. A. Mok, X. Feng, and D. Chen. Resource partition for real-time systems. In Real-Time Technology and Applications Symposium, pages 75-84, 2001.
13. J. Regehr and J. Stankovic. Hls: A framework for composing soft real-time schedulers. In IEEE Real-Time Systems Symposium, pages 3-14, 2001.
14. S. Shigero, M. Takashi, and H. Kei. On the schedulability conditions on partial time slots. In Real-Time Computing Systems and Applications Conference, pages 166-173, 1999.
15. Y. L. T. Kuo and K. Lin. Efficient on-line schedulability tests for priority driven real-time systems. In Real-Time Technology and Applications Symposium, pages 4-13.
16. G. G. Xie and S. S. Lam. Delay guarantee of virtual clock server. IEEE/ACM Transactions on Networking, 3(6) 683-689, 1995.