Optimal virtual cluster-based multiprocessor scheduling
Real-Time Systems
Enhancing the platform independence of the real-time specification for Java
Proceedings of the 7th International Workshop on Java Technologies for Real-Time and Embedded Systems
Generalized tardiness bounds for global multiprocessor scheduling
Real-Time Systems
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Sharing resources among independently-developed systems on multi-cores
ACM SIGBED Review
CARTS: a tool for compositional analysis of real-time systems
ACM SIGBED Review
A survey of hard real-time scheduling for multiprocessor systems
ACM Computing Surveys (CSUR)
An overview of interrupt accounting techniques for multiprocessor real-time systems
Journal of Systems Architecture: the EUROMICRO Journal
ACM SIGBED Review - Work-in-Progress (WiP) Session of the 23rd Euromicro Conference on Real-Time Systems (ECRTS 2011)
RT-Xen: towards real-time hypervisor scheduling in xen
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Multiprocessor extensions to real-time calculus
Real-Time Systems
Designing VM schedulers for embedded real-time applications
CODES+ISSS '11 Proceedings of the seventh IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Dynamic clustering for distinct parallel programming models on NoC-based MPSoCs
Proceedings of the 4th International Workshop on Network on Chip Architectures
Proceedings of the 20th International Conference on Real-Time and Network Systems
Parallel partitioning for distributed systems using sequential assignment
Journal of Parallel and Distributed Computing
Compositional real-time scheduling framework for periodic reward-based task model
Journal of Systems and Software
Multi-core composability in the face of memory-bus contention
ACM SIGBED Review
Bandwidth allocation for fixed-priority-scheduled compositional real-time systems
ACM Transactions on Embedded Computing Systems (TECS)
Journal of Systems Architecture: the EUROMICRO Journal
Hi-index | 0.00 |
Scheduling of sporadic task systems on multiprocessor platforms is an area which has received much attention in the recent past. It is widely believed that finding an optimal scheduler is hard, and therefore most studies have focused on developing algorithms with good utilization bounds. These algorithms can be broadly classified into two categories: partitioned scheduling in which tasks are statically assigned to individual processors, and globalscheduling in which each task is allowed to execute on any processor in the platform. In this paper we consider a third, more general, approach called cluster-based scheduling. In this approach each task is statically assigned to a processor cluster, tasks in each cluster areglobally scheduled among themselves, and clusters in turn are scheduled on the multiprocessor platform. We develop techniques to support such cluster-based scheduling algorithms, and also consider properties that minimize processor utilization of individual clusters. Since neither partitioned nor global strategies dominate over the other, cluster-based scheduling is a natural direction for research towards achieving improved utilization bounds.