Paper Info
Title
A Type-Theoretic Framework for Efficient and Safe Colocation of Periodic Real-Time Systems
Abstract
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.
Year
DOI
Venue
2010
10.1109/RTCSA.2010.34
Embedded and Real-Time Computing Systems and Applications
Keywords
Field
DocType
Web services,real-time systems,scheduling,type theory,hierarchical scheduler,periodic real-time systems,real-time tasks,safe SLA transformations,safe colocation,safe mappings,service level agreements,type-theoretic framework,Real-Time,Type-Theoretic,colocation
Resource management,Service level,Expression (mathematics),Computer science,Scheduling (computing),Inference,Type theory,Real-time computing,Schedule,Web service,Distributed computing
Conference
ISSN
ISBN
Citations 
1533-2306
978-1-4244-8480-5
4
PageRank 
References 
Authors
0.41
25
3
Name
Order
Citations
PageRank
Vatche Ishakian119518.18
Azer Bestavros23791764.82
A. J. Kfoury346147.34