A Type-Theoretic Framework for Efficient and Safe Colocation of Periodic Real-Time Systems

Desirable application performance is typically guaranteed through the use of Service Level Agreements (SLAs) that specify fixed fractions of resource capacities that must be allocated for unencumbered use by the application. The mapping between what constitutes desirable performance and SLAs is not unique: multiple SLA expressions might be functionally equivalent. Having the flexibility to transform SLAs from one form to another in a manner that is provably safe would enable hosting solutions to achieve significant efficiencies. This paper demonstrates the promise of such an approach by proposing a type-theoretic framework for the representation and safe transformation of SLAs. Based on that framework, the paper describes a methodical approach for the inference of efficient and safe mappings of periodic, real-time tasks to the physical and virtual hosts that constitute a hierarchical scheduler. Extensive experimental results support the conclusion that the flexibility afforded by safe SLA transformations has the potential to yield significant savings.

[1]  Assaf J. Kfoury,et al.  Safe Compositional Network Sketches , 2010 .

[2]  Harrick M. Vin,et al.  A hierarchial CPU scheduler for multimedia operating systems , 1996, OSDI '96.

[3]  Louis E. Rosier,et al.  The pinwheel: a real-time scheduling problem , 1989, [1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track.

[4]  Tei-Wei Kuo,et al.  Load adjustment in adaptive real-time systems , 1991, [1991] Proceedings Twelfth Real-Time Systems Symposium.

[5]  Sang Hyuk Son,et al.  New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems , 1995, IEEE Trans. Computers.

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

[7]  Harrick M. Vin,et al.  A hierarchial CPU scheduler for multimedia operating systems , 1996, OSDI '96.

[8]  Yuting Zhang,et al.  A virtual deadline scheduler for window-constrained service guarantees , 2004, 25th IEEE International Real-Time Systems Symposium.

[9]  John P. Lehoczky,et al.  The rate monotonic scheduling algorithm: exact characterization and average case behavior , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[10]  Lothar Thiele,et al.  Interface-Based Design of Real-Time Systems with Hierarchical Scheduling , 2006, 12th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'06).

[11]  Lui Sha,et al.  Solutions for Some Practical Problems in Prioritized Preemptive Scheduling , 1986, RTSS.

[12]  John Regehr,et al.  HLS: a framework for composing soft real-time schedulers , 2001, Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420).

[13]  Azer Bestavros,et al.  Statistical rate monotonic scheduling , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

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

[15]  Insup Lee,et al.  A Compositional Framework for Real-Time Embedded Systems , 2005, ISAS.

[16]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[17]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[18]  Parameswaran Ramanathan,et al.  A Dynamic Priority Assignement Technique for Streams with (m, k)-Firm Deadlines , 1995, IEEE Trans. Computers.

[19]  Michael D. Lemmon,et al.  Generalized Elastic Scheduling , 2006, 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06).

[20]  Rami G. Melhem,et al.  An efficient RMS admission control and its application to multiprocessor scheduling , 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.

[21]  Thomas A. Henzinger,et al.  An Interface Algebra for Real-Time Components , 2006, 12th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'06).

[22]  Azer Bestavros,et al.  Safe Compositional Network Sketches: Tool & Use Cases , 2009 .

[23]  Insup Lee,et al.  Compositional Schedulability Analysis of Hierarchical Real-Time Systems , 2007, 10th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'07).

[24]  Azer Bestavros,et al.  Colocation Games and Their Application to Distributed Resource Management , 2009, HotCloud.

[25]  Andrei Lapets.  Improving the Accessibility of Lightweight Formal Verification Systems , 2009 .

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

[27]  Christian Poellabauer,et al.  Dynamic window-constrained scheduling of real-time streams in media servers , 2004, IEEE Transactions on Computers.

[28]  Lui Sha,et al.  Real-time scheduling theory and Ada , 1990, Computer.

[29]  Giuseppe Lipari,et al.  Elastic task model for adaptive rate control , 1998, Proceedings 19th IEEE Real-Time Systems Symposium (Cat. No.98CB36279).

[30]  Alan Burns,et al.  Weakly Hard Real-Time Systems , 2001, IEEE Trans. Computers.

[31]  Azer Bestavros,et al.  NETEMBED: A network resource mapping service for distributed applications , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.