The trajectory approach for the end-to-end response times with non-preemptive FP/EDF

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3647 LNCS, Issue , 2005, Pages 229-247

  Martin, Steven ^a   Minet, Pascale ^b   George, Laurent ^c  

^a UNIVERSITÉ PARIS EST CRÉTEIL   (France)

^b INRIA   (France)

^c Ecole Centrale Electroniques   (France)

Author keywords

Deterministic guarantee; Earliest deadline first; End to end response time; Fixed priority; Holistic approach; QoS network; Quality of service; Trajectory approach

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER NETWORKS; COMPUTER SCIENCE; DISTRIBUTED COMPUTER SYSTEMS; PACKET NETWORKS; QUALITY OF SERVICE; SCHEDULING; TRAJECTORIES;

DETERMINISTIC GUARANTEE; EARLIEST DEADLINE FIRST (EDF); END-TO-END RESPONSE TIME; FIXED PRIORITY; HOLISTIC APPROACH; QOS NETWORK; TRAJECTORY APPROACH;

RESPONSE TIME (COMPUTER SYSTEMS);

EID: 33745167331     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (18)

1. K. Tindell, A. Burns, A. J. Wellings, Analysis of hard real-time communications, Real-Time Systems, Vol. 9, pp. 147-171, 1995.
2. J. Liu, Real-time systems, Prentice Hall, New Jersey, 2000.
3. K. Jeffay, D. F. Stanat, C. U. Martel, On non-preemtive scheduling of periodic and sporadic tasks, IEEE Real-Time Systems symposium, pp. 129-139, San Antonio, USA, December 1991.
4. L. George, N. Rivierre, M. Spuri, Preemptive and non-preemptive scheduling real-time uniprocessor scheduling, INRIA Research Report No 2966, September 1996.
5. S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, W. Weiss, An architecture for Differentiated Services, RFC 2475, December 1998.
6. R. Braden, D. Clark, S. Shenker, Integrated services in the Internet architecture: An overview, RFC 1633, June 1994.
7. S. Baruah, R. Howell, L. Rosier, Algorithms and complexity concerning the preemptive scheduling of periodic real-time tasks on one processor, Real-Time Systems, 2, p 301-324, 1990.
8. S. Martin, P. Minet, L. George, FP/EDF, a non-preemptive scheduling combining fixed priorities and deadlines: Uniprocessor and distributed cases, INRIA Research Report No 5112, http://www.inria.fr/rrrt/rr-5112.html, Feb, 2004.
9. V. Sivaraman, F. Chiussi, M. Gerla, End-to-end statistical delay service under GPS and EDF scheduling; A comparaison study, INFOCOM'2001, Anchorage, April 2001.
10. M. Vojnovic, J. Le Boudec, Stochastic analysis of some expedited forwarding networks, INFOCOM'2002, New York, June 2002.
11. F. Chiussi, V. Sivaraman, Achieving high utilization in guaranteed services networks using early-deadline-first scheduling, IWQoS'98, Napo, California, May 1998.
12. L. George, D. Marinca, P.. Minet, A solution for a deterministic QoS in multimedia systems, International Journal on Computer and Information Science, Vol.1, N3, September 2001.
13. K. Tindell, J. Clark, Holistic schedulability analysis for distributed hard real-time systems, Microprocessors and Microprogramming, Euromicro Journal, Vol. 40, 1994.
14. J. Le Boudec, P. Thiran, Network calculus: A theory of deterministic queuing systems for the Internet, Springer Verlag, LNCS 2050, September 2003.
15. A. Parekh, R. Gallager, A generalized processor sharing approach to flow control in integrated services networks: The multiple node case, IEEE ACM Transactions on Networking, Vol. 2, 1994.
16. L. Georgiadis, R. Guérin, V. Peris, K. Sivarajan, Efficient network QoS provisioning based on per node traffic shaping, IEEE/ACM Transactions on Networking, Vol, 4, No, 4, August 1996.
17. V. Sivaraman, F. Chiussi, M. Gerla, Traffic shaping for end-to-end delay guarantees with EDF scheduling, IWQoS'2000, Pittsburgh, June 2000.
18. S. Martin, Maîtrise de la dimension temporelle de la qualité de service dans les réseaux, Ph.D. thesis, University of Paris 12, France, July 2004.