Improved response time analysis of tasks scheduled under preemptive Round-Robin

CODES+ISSS 2007: International Conference on Hardware/Software Codesign and System Synthesis

Volumn , Issue , 2007, Pages 179-184

  Racu, Razvan ^a   Li, Li ^a   Henia, Rafik ^a   Hamann, Arne ^a   Ernst, Rolf ^a  

^a TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

Response time analysis; Round Robin

Indexed keywords

COMPUTATIONAL COMPLEXITY; SCHEDULING ALGORITHMS; TELECOMMUNICATION NETWORKS;

PREEMPTIVE ROUND-ROBIN; RESPONSE TIME ANALYSIS;

RESPONSE TIME (COMPUTER SYSTEMS);

EID: 38849134743     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1289816.1289861     Document Type: Conference Paper

References (21)

1. R. Budruk, D. Anerson, and T. Stanley. PCI-Express System Architecture. MindShare, Inc., 2003.
2. FlexRay. http://www.flexray.com/
3. J. P. Gutierrez, J. J. G. Garcia, and M. G. Harbour. Best-Case Analysis for Improving the Worst-Case Schedulability Test for Distributed Hard RealTime Systems. In Proceedings of the Euromicro Conference on Real-Time Systems (ECRTS), 1998.
4. S. Heithecker, A. do Carmo Lucas, and R. Ernst. A High-End Real-Time Digital Film Processing Reconfigurable Platform. EURASIP Journal on Embedded Systems, Special Issue on Dynamically Reconfigurable Architectures, 2007:Article ID 85318, 15 Pages, 2007.
5. K. Jeffay, R D. Smith, A. Moorthy, and J. Anderson. Proportional Share Scheduling of Operating System Services for Real-Time Applications. In IEEE Real-Time Systems Symposium, Madrid, Spain, 1998.
6. M. Joseph and P. Pandya. Finding Response Times in a Real-Time System. The Computer Journal, 29(5):390-395, 1986.
7. S. Kanhere and H. Sethu. On the Latency Bound of Pre-Order Deficit Round Robin. In Proceedings of the IEEE Conference on Local Computer Networks, pages 508-517, Tampa, FL, 2002.
8. H. Kopetz and G. Bauer. The Time-Triggered Architecture. Proceedings of the IEEE, Special Issue on Modeling and Design of Embedded Software, 2001.
9. J. Lehoczky. Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines. In Proceedings of the Real-Time Systems Symposium, pages 201-209, 1990.
10. C. L. Liu and J. W. Layland. Scheduling algorithms for multi-programming in a hard-real-time environment. Journal of the ACM, 20(1):46-61, 1973.
11. J. Migge. Real-time scheduling: a trajectory based model. PhD thesis, Nice University, Nancy, France, 1999.
12. J. Migge, A. Jean-Marie, and N. Navet. Timing analysis of compound scheduling policies: application to Posix1003.1b. Journal of Scheduling, 6(5):457-482, 2003.
13. S. Mukherjee, D. Saha, M. Saksena, and S. K. Tripathi. A Bandwidth Allocation Scheme for Time Constrained Message Transmission on a Slotted Ring LAN. In IEEE Real-Time Systems Symposium, Raleigh-Durham, NC, 1993.
14. A. Raha, S. Kamat, and W. Zhao. Guaranteeing End-to-End Deadlines in ATM Networks. In International Conference on Distributed Computing Systems, Vancouver, Canada, 1995.
15. K. Richter. Compositional Performance Analysis. PhD thesis, Technical University of Braunschweig, 2004.
16. M. Shreedhar and G. Varghese. Efficient Fair Queueing Using Deficit Round Robin. In SIGCOMM, pages 231-242, Boston, 1995.
17. B. Sprunt, L. Sha, and J. Lehoczky. Aperiodic Task Scheduling for Hard Real-Time Systems. Journal of Real-Time Systems, 1(1):27-60, 1989.
18. H. Takagi. Exact analysis of round-robin scheduling of services. IBM J. Res. Dev., 31(4):484-488, 1987.
19. K. Tindell, A. Burns, and A. Wellings. An Extendible Approach for Analysing Fixed Priority Hard Real-Time Systems. Journal of Real-Time Systems, 6(2): 133-152, Mar 1994.
20. R. Wu and Y.-B. Chen. Analysis of a loop Transmission System with Round-Robin Scheduling of Services. IBM J. Res. Dev., 19(5):486-493, 1975.
21. R. Yates. High Speed Round Robin Queueing Networks. PhD thesis, MIT, Dept. of Electrical Engineering and Computer Science, 1990.