Title
Regular Composite Resource Partition in Open Systems
Abstract
In open systems, no global scheduler has knowledge of the complete resource requirements from all the applications. Each application has its own task group and can generate tasks on demand at run time. Regularity-based Resource Partition (RRP) model is an effective strategy to hierarchically allocate resource in such environments. However, when applying the RRP model to multi-resource environments, end-to-end tasks could experience unexpected delay and miss the deadlines. The tasks might arrive at non-resource-slice boundaries because the resource slice sizes of different physical resource may vary in such non-uniform environments. This paper extends the RRP model to non-uniform multi-resource open systems. It introduces a novel composite resource partition abstraction, identifies the feasible conditions for hierarchical regular composite resource partitioning and proposes an acyclic regular composite resource partition scheduling (ARCRPS) algorithm. Simulation results show that compared with the state-of-the-art approach, ARCRPS improves the acceptance ratio by 20% and 25% in uniform and non-uniform multi-resource environments, respectively. A multi-resource scheduling framework jointly considering the CPU and network resources is also designed and implemented to evaluate the feasibility of this theoretical model in practice.
Year
DOI
Venue
2017
10.1109/RTSS.2017.00011
2017 IEEE Real-Time Systems Symposium (RTSS)
Keywords
Field
DocType
Real-time-systems,Cyber-physical-systems,Hierarchical-Scheduling,Multi-resource,Reservation
Reservation,Central processing unit,On demand,Abstraction,Scheduling (computing),Computer science,Cyber-physical system,Open system (systems theory),Partition (number theory),Distributed computing
Conference
ISSN
ISBN
Citations 
1052-8725
978-1-5386-1416-7
1
PageRank 
References 
Authors
0.36
16
5
Name
Order
Citations
PageRank
Wei-Ju Chen131.74
Pei-Chi Huang2649.92
Quan Leng3515.19
Aloysius K. Mok422618.21
Song Han555354.94