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...

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE 16th International Conference on Embedded and Real-Time Computing Systems and Applications pp. 143 - 152
Main Authors Ishakian, V, Bestavros, A, Kfoury, A
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2010
Subjects
colocation
Computer science
Processor scheduling
Real time systems
Real-Time
Resource management
Schedules
Transforms
Type-Theoretic
USA Councils
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:1424484804
9781424484805
ISSN:2325-1271
DOI:10.1109/RTCSA.2010.34