Skip to Main Content
Given a collection of recurring tasks or processes 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 shown that this problem is intractable (NP-hard in the strong sense). Efficient implementations of sufficient (albeit not necessary) partitioning algorithms are presented, and proved correct.
Date of Conference: 25-28 May 2004