Scheduling parallel program tasks onto arbitrary target machines
Journal of Parallel and Distributed Computing - Special issue: software tools for parallel programming and visualization
Dynamic scheduling of real-time tasks under precedence constraints
Real-Time Systems
Allocation and Scheduling of Precedence-Related Periodic Tasks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Period-Based Load Partitioning and Assignment for Large Real-Time Applications
IEEE Transactions on Computers
A comparison of list schedules for parallel processing systems
Communications of the ACM
Partitioning and Scheduling Parallel Programs for Multiprocessors
Partitioning and Scheduling Parallel Programs for Multiprocessors
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors
IEEE Transactions on Parallel and Distributed Systems
Deadline Assignment in a Distributed Soft Real-Time System
IEEE Transactions on Parallel and Distributed Systems
Implementing Constant-Bandwidth Servers upon Multiprocessor Platforms
RTAS '02 Proceedings of the Eighth IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS'02)
Scheduling real-time applications in an open environment
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
A Model of Hierarchical Real-Time Virtual Resources
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Processor Capacity Reserves for Multimedia Operating Systems
Processor Capacity Reserves for Multimedia Operating Systems
Resource Partition for Real-Time Systems
RTAS '01 Proceedings of the Seventh Real-Time Technology and Applications Symposium (RTAS '01)
Periodic Resource Model for Compositional Real-Time Guarantees
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Resource Reservation in Dynamic Real-Time Systems
Real-Time Systems
The Partitioned Multiprocessor Scheduling of Deadline-Constrained Sporadic Task Systems
IEEE Transactions on Computers
Hierarchical Scheduling Framework for Virtual Clustering of Multiprocessors
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
A Hierarchical Multiprocessor Bandwidth Reservation Scheme with Timing Guarantees
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
The Multi Supply Function Abstraction for Multiprocessors
RTCSA '09 Proceedings of the 2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Virtual Multiprocessor Platforms: Specification and Use
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Workload-Aware Partitioning for Maintaining Temporal Consistency upon Multiprocessor Platforms
RTSS '11 Proceedings of the 2011 IEEE 32nd Real-Time Systems Symposium
Semi-Partitioned Hard-Real-Time Scheduling under Locked Cache Migration in Multicore Systems
ECRTS '12 Proceedings of the 2012 24th Euromicro Conference on Real-Time Systems
| Hi-index | 0.00 |
Providing temporal isolation between critical activities has been an important design criterion in real-time open systems, which can be achieved using resource reservation techniques. As an abstraction of reservation servers, virtual processor is often used to represent a portion of computing power available on a physical platform while hiding the implementation details. In this paper, we present a general framework of partitioning an application comprised of hard real-time tasks with precedence constraints onto multiple virtual processors in consideration of communication latencies between tasks. A novel method is proposed for assigning deadlines and activation times to tasks such that tasks partitioned onto different virtual processors can be analyzed separately using well-established theories for uniprocessor. Extensive simulations have been performed and the results have shown that, compared to existing algorithms, the proposed method achieves better performance in terms of minimizing both total bandwidth and the maximum individual bandwidth.