Selecting the Minimum Consumed Bandwidth of an EDF Task Set

The usage of virtual processor is a key aspect for isolating real-time applications. A typical interface of virt ual processor is expressed by the bandwidth and the delay. After formulating the overall consumed bandwidth as a function of the bandwidth and the delay that accounts also for the context switches, we proposed an algorithm that find the least consuming interface that is capable to guarantee the deadlines of a set of tasks scheduled by EDF. The proposed algorithm is inspired by the dual simplex algorithm.

[1]  Giuseppe Lipari,et al.  Speed modulation in energy-aware real-time systems , 2005, 17th Euromicro Conference on Real-Time Systems (ECRTS'05).

[2]  Eric Rotenberg,et al.  FAST: Frequency-aware static timing analysis , 2006, TECS.

[3]  José Alberto Fonseca,et al.  The FTT-CAN protocol: why and how , 2002, IEEE Trans. Ind. Electron..

[4]  Insik Shin,et al.  Synthesis of Optimal Interfaces for Hierarchical Scheduling with Resources , 2008, 2008 Real-Time Systems Symposium.

[5]  Lothar Thiele,et al.  Real-time interfaces for interface-based design of real-time systems with fixed priority scheduling , 2005, EMSOFT.

[6]  Aloysius K. Mok,et al.  Resource partition for real-time systems , 2001, Proceedings Seventh IEEE Real-Time Technology and Applications Symposium.

[7]  Insup Lee,et al.  Periodic resource model for compositional real-time guarantees , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[8]  Nathan Fisher,et al.  Approximate Bandwidth Allocation for Compositional Real-Time Systems , 2009, 2009 21st Euromicro Conference on Real-Time Systems.

[9]  Jean-Yves Le Boudec,et al.  Network Calculus , 2001, Lecture Notes in Computer Science.

[10]  John P. Lehoczky,et al.  Analysis of hierar hical fixed-priority scheduling , 2002, Proceedings 14th Euromicro Conference on Real-Time Systems. Euromicro RTS 2002.

[11]  Marco Spuri,et al.  Scheduling aperiodic tasks in dynamic priority systems , 1996, Real-Time Systems.

[12]  Alan Burns,et al.  Hierarchical fixed priority pre-emptive scheduling , 2005, 26th IEEE International Real-Time Systems Symposium (RTSS'05).

[13]  Wilton R. Abbott,et al.  Network Calculus , 1970 .

[14]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[15]  Stefan Savage,et al.  Processor capacity reserves: operating system support for multimedia applications , 1994, 1994 Proceedings of IEEE International Conference on Multimedia Computing and Systems.

[16]  Giuseppe Lipari,et al.  Resource partitioning among real-time applications , 2003, 15th Euromicro Conference on Real-Time Systems, 2003. Proceedings..

[17]  Insup Lee,et al.  Compositional Analysis Framework Using EDP Resource Models , 2007, 28th IEEE International Real-Time Systems Symposium (RTSS 2007).

[18]  Giorgio C. Buttazzo,et al.  Integrating multimedia applications in hard real-time systems , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[19]  Sanjoy K. Baruah,et al.  Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor , 1990, Real-Time Systems.

[20]  Jean-Yves Le Boudec,et al.  Network Calculus: A Theory of Deterministic Queuing Systems for the Internet , 2001 .

[21]  Sanjoy K. Baruah,et al.  Efficient scheduling of real-time multi-task applications in dynamic systems , 2000, Proceedings Sixth IEEE Real-Time Technology and Applications Symposium. RTAS 2000.

[22]  Jane W.-S. Liu,et al.  Scheduling real-time applications in an open environment , 1997, Proceedings Real-Time Systems Symposium.

[23]  Tei-Wei Kuo,et al.  A fixed-priority-driven open environment for real-time applications , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).