On the Homogeneous Multiprocessor Virtual Machine Partitioning Problem

Abstract : This work addresses the partitioning of virtual machines with real-time requirements onto a multi-core platform. The partitioning is usually done manually through interactions between subsystem vendors and system designers. Such a proceeding is expensive, does not guarantee to find the best solution, and does not scale with regard to the upcoming higher complexity in terms of an increasing number of both virtual machines and processor cores. The partitioning problem is defined in a formal manner by the abstraction of computation time demand of virtual machines and computation time supply of a shared processor. The application of a branch-and-bound partitioning algorithm is proposed. Combined with a generation of a feasible schedule for the virtual machines mapped to a processor, it is guaranteed that the demand of a virtual machine is satisfied, even if independently developed virtual machines share a processor. The partitioning algorithm offers two optimization goals, required number of processors and the introduced optimization metric criticality distribution, a first step towards a partitioning that considers multiple criticality levels. The different outcomes of the two approaches are illustrated exemplarily.
Document type :
Conference papers
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

Contributor : Hal Ifip <>
Submitted on : Monday, February 13, 2017 - 4:38:48 PM
Last modification on : Thursday, July 26, 2018 - 3:20:10 PM
Long-term archiving on : Sunday, May 14, 2017 - 2:51:43 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Stefan Groesbrink. On the Homogeneous Multiprocessor Virtual Machine Partitioning Problem. 4th International Embedded Systems Symposium (IESS), Jun 2013, Paderborn, Germany. pp.228-237, ⟨10.1007/978-3-642-38853-8_21⟩. ⟨hal-01466677⟩



Record views


Files downloads