The Multi Supply Function Abstraction for Multiprocessors

Multi-core platforms are becoming the dominant computing architecture for next generation embedded systems. Nevertheless, designing, programming, and analyzing such systems is not easy and a solid methodology is still missing. In this paper, we propose two powerful abstractions to model the computing power of a parallel machine, which provide a general interface for developing and analyzing real-time applications in isolation, independently of the physical platform. The proposed abstractions can be applied on top of different types of service mechanisms, such as periodic servers, static partitions, and P-fair time partitions. In addition, we developed the schedulability analysis of a set of real-time tasks on top of a parallel machine that is compliant with the proposed abstractions.

[1]  Sanjoy K. Baruah,et al.  On-line scheduling on uniform multiprocessors , 2001, Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420).

[2]  Banu Özden,et al.  Disk scheduling with quality of service guarantees , 1999, Proceedings IEEE International Conference on Multimedia Computing and Systems.

[3]  Desmond P. Taylor,et al.  A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The SingleNode Case , 2007 .

[4]  Jean-Yves Le Boudec,et al.  Application of Network Calculus to Guaranteed Service Networks , 1998, IEEE Trans. Inf. Theory.

[5]  Hussein M. Abdel-Wahab,et al.  A proportional share resource allocation algorithm for real-time, time-shared systems , 1996, 17th IEEE Real-Time Systems Symposium.

[6]  Giuseppe Lipari,et al.  Soft Real-Time Systems: Predictability vs. Efficiency , 2010 .

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

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

[9]  Anujan Varma,et al.  Latency-rate servers: a general model for analysis of traffic scheduling algorithms , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

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

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

[12]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[13]  Theodore P. Baker,et al.  Multiprocessor EDF and deadline monotonic schedulability analysis , 2003, RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003.

[14]  Sanjoy K. Baruah,et al.  The EDF Scheduling of Sporadic Task Systems on Uniform Multiprocessors , 2008, 2008 Real-Time Systems Symposium.

[15]  James H. Anderson,et al.  Group-Based Pfair Scheduling , 2006, Real-Time Systems.

[16]  Sanjoy K. Baruah,et al.  Proportionate progress: a notion of fairness in resource allocation , 1993, STOC '93.

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

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

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

[20]  James H. Anderson,et al.  Early-release fair scheduling , 2000, Proceedings 12th Euromicro Conference on Real-Time Systems. Euromicro RTS 2000.

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

[22]  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).

[23]  Giorgio C. Buttazzo,et al.  Resource Reservation in Dynamic Real-Time Systems , 2004, Real-Time Systems.

[24]  Alberto Del Bimbo.  Guest Editor's Introduction: Multimedia Computing and Systems , 2000, IEEE Multim..

[25]  Tei-Wei Kuo,et al.  RTSS 2007: Preface , 2007, RTSS 2007.

[26]  Insup Lee,et al.  Hierarchical Scheduling Framework for Virtual Clustering of Multiprocessors , 2008, 2008 Euromicro Conference on Real-Time Systems.

[27]  Insup Lee,et al.  Compositional Analysis Framework Using EDP Resource Models , 2007, RTSS 2007.

[28]  Hennadiy Leontyev,et al.  A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees , 2008, 2008 Euromicro Conference on Real-Time Systems.

[29]  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.

[30]  Tei-Wei Kuo,et al.  An open real-time environment for parallel and distributed systems , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[31]  Mark Moir,et al.  Pfair scheduling of fixed and migrating periodic tasks on multiple resources , 1999, Proceedings 20th IEEE Real-Time Systems Symposium (Cat. No.99CB37054).

[32]  Sanjoy K. Baruah,et al.  Proportionate progress: A notion of fairness in resource allocation , 1993, Algorithmica.

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

[34]  Giuseppe Lipari,et al.  Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms , 2009, IEEE Transactions on Parallel and Distributed Systems.

[35]  Giuseppe Lipari,et al.  Soft Real-Time Systems: Predictability vs. Efficiency (Series in Computer Science) , 2005 .

[36]  Aloysius K. Mok,et al.  A model of hierarchical real-time virtual resources , 2002, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002..