Optimal virtual cluster-based multiprocessor scheduling
Real-Time Systems
Multicore-aware hybrid code positioning to reduce worst-case execution time
Proceedings of the 2010 Workshop on Interaction between Compilers and Computer Architecture
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
An overview of interrupt accounting techniques for multiprocessor real-time systems
Journal of Systems Architecture: the EUROMICRO Journal
Real-time resource-sharing under clustered scheduling: mutex, reader-writer, and k-exclusion locks
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
A weighted-fair-queuing (WFQ)-based dynamic request scheduling approach in a multi-core system
Future Generation Computer Systems
A semi-partitioned real-time scheduling approach for periodic task systems on multicore platforms
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Journal of Experimental Algorithmics (JEA)
Hi-index | 0.00 |
We propose a hybrid approach for scheduling real-time tasks on large-scale multicore platforms with hierarchical shared caches. In this approach, a multicore platform is partitioned into clusters. Tasks are statically assigned to these clusters, and scheduled within each cluster using the preemptive global EDF scheduling algorithm. We show that this hybrid of partitioning and global scheduling performs better on large-scale platforms than either approach alone. We also determine the appropriate cluster size to achieve the best performance possible, given the characteristics of the task set to be supported.