Abstract
We focus on non-preemptive Fixed Priority (fp) scheduling. Unlike the classical approach, where flows sharing the same priority are assumed to be scheduled arbitrarily, we assume that these flows are scheduled Earliest Deadline First (edf), by considering their absolute deadline on their first visited node. The resulting scheduling is called fp/edf *. In this paper, we establish new results for fp/edf * in a distributed context, first when flows follow the same sequence of nodes (the same path). We then extend these results when flows follow different paths. We show how to compute an upper bound on the end-to-end response time of any flow when the packet priority is computed on the first node and left unchanged on any subsequent node. This alleviates the packet processing in core nodes. For that purpose, we use a worst case analysis based on the trajectory approach, that is less pessimistic than classical approaches. We compare our results with those provided by the holistic approach: the benefit can be very high.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Tindell, K., Burns, A., Wellings, A.J.: Analysis of hard real-time communications. Real-Time Systems 9, 147–171 (1995)
Liu, J.: Real-time systems. Prentice-Hall, New Jersey (2000)
Jeffay, K., Stanat, D.F., Martel, C.U.: On non-preemtive scheduling of periodic and sporadic tasks. In: IEEE Real-Time Systems symposium, San Antonio, USA, December 1991, pp. 129–139 (1991)
George, L., Rivierre, N., Spuri, M.: Preemptive and non-preemptive scheduling real-time uniprocessor scheduling, INRIA Research Report No 2966 (September 1996)
Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An architecture for Differentiated Services, RFC 2475 (December 1998)
Braden, R., Clark, D., Shenker, S.: Integrated services in the Internet architecture: An overview, RFC 1633 (June 1994)
Baruah, S., Howell, R., Rosier, L.: Algorithms and complexity concerning the preemptive scheduling of periodic real-time tasks on one processor. Real-Time Systems 2, 301–324 (1990)
Martin, S., Minet, P., George, L.: FP/EDF, a non-preemptive scheduling combining fixed priorities and deadlines: Uniprocessor and distributed cases, INRIA Research Report No. 5112 (February 2004), http://www.inria.fr/rrrt/rr-5112.html
Sivaraman, V., Chiussi, F., Gerla, M.: End-to-end statistical delay service under GPS and EDF scheduling: A comparaison study. In: INFOCOM 2001, Anchorage (April 2001)
Vojnovic, M., Le Boudec, J.: Stochastic analysis of some expedited forwarding networks. In: INFOCOM 2002, New York (June 2002)
Chiussi, F., Sivaraman, V.: Achieving high utilization in guaranteed services networks using early-deadline-first scheduling. In: IWQoS 1998, Napo, California (May 1998)
George, L., Marinca, D., Minet, P.: A solution for a deterministic QoS in multimedia systems. International Journal on Computer and Information Science 1(3) (September 2001)
Tindell, K., Clark, J.: Holistic schedulability analysis for distributed hard real-time systems. Microprocessors and Microprogramming, Euromicro Journal 40 (1994)
Thiran, P., Le Boudec, J.-Y.: Network calculus: A theory of deterministic queuing systems for the Internet. LNCS, vol. 2050. Springer, Heidelberg (2001)
Parekh, A., Gallager, R.: A generalized processor sharing approach to flow control in integrated services networks: The multiple node case. IEEE ACM Transactions on Networking 2 (1994)
Georgiadis, L., Guérin, R., Peris, V., Sivarajan, K.: Efficient network QoS provisioning based on per node traffic shaping. IEEE/ACM Transactions on Networking 4(4) (August 1996)
Sivaraman, V., Chiussi, F., Gerla, M.: Traffic shaping for end-to-end delay guarantees with EDF scheduling. In: IWQoS 2000, Pittsburgh (June 2000)
Martin, S.: 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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martin, S., Minet, P., George, L. (2006). The Trajectory Approach for the End-to-End Response Times with Non-preemptive FP/EDF*. In: Dosch, W., Lee, R.Y., Wu, C. (eds) Software Engineering Research and Applications. SERA 2004. Lecture Notes in Computer Science, vol 3647. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11668855_17
Download citation
DOI: https://doi.org/10.1007/11668855_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32133-0
Online ISBN: 978-3-540-32134-7
eBook Packages: Computer ScienceComputer Science (R0)