ACM SIGBED Review - Special issue: IEEE RTAS 2005 work-in-progress
Multiprocessor synthesis for periodic hard real-time tasks under a given energy constraint
Proceedings of the conference on Design, automation and test in Europe: Proceedings
Multiprocessor frequency locking for real-time task synchronization
Proceedings of the 2008 ACM symposium on Applied computing
A Framework for Distributing Real-Time Functions
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Assigning real-time tasks to heterogeneous processors by applying ant colony optimization
Journal of Parallel and Distributed Computing
Platform synthesis and partitioning of real-time tasks for energy efficiency
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)
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Power-efficient time-sensitive mapping in heterogeneous systems
Proceedings of the 21st international conference on Parallel architectures and compilation techniques
Partitioned EDF scheduling on a few types of unrelated multiprocessors
Real-Time Systems
Energy-efficient task allocation techniques for asymmetric multiprocessor embedded systems
ACM Transactions on Embedded Computing Systems (TECS) - Special Section ESFH'12, ESTIMedia'11 and Regular Papers
Task assignment algorithms for two-type heterogeneous multiprocessors
Real-Time Systems
Hi-index | 0.00 |
Given a collection of tasks that comprise the software for a real-time system, and a collection of available processing units of different kinds upon which to execute them, the heterogeneous multiprocessor partitioning problem is concerned with determining whether the given tasks can be partitioned among the available processing units in such a manner that all timing constraints are met. It is known that this problem is intractable; efficient implementations of sufficient (albeit not necessary) partitioning algorithms are presented here, and proved correct.