Paper Info
Title
Partition configuration for real-time systems with dependencies
Abstract
We present an analytical framework for formulating partition configuration problems in real-time systems with dependencies, particularly applicable to modeling systems with multiple criticality or security levels. Partition configuration constraints for real-time tasks include affinity and conflict. We also discuss the application of the framework to arbitrary partition schedulers, harmonic partition execution, and round robin partition execution (which is particularly problematic). Our interest is in minimizing end-to-end latency, though the computational complexity of the problem prevents us from finding optimal results. We conclude with some open problems.
Year
DOI
Venue
2013
10.1145/2516821.2516850
RTNS
Keywords
Field
DocType
partition configuration problem,analytical framework,harmonic partition execution,end-to-end latency,round robin partition execution,partition configuration constraint,computational complexity,real-time task,real-time system,arbitrary partition schedulers,security
Latency (engineering),Computer science,Harmonic,Real-time computing,Theoretical computer science,Partitioned systems,Criticality,Graph partition,Partition (number theory),Partition refinement,Computational complexity theory
Conference
Citations 
PageRank 
References 
0
0.34
10
Authors
2
Name
Order
Citations
PageRank
Joseph Porter1506.32
Csanád Szabó220.75