Abstract—The problem of partitioning a parallel application on a parallel machine optimizing the available resources has been proved to be NP-hard in the strong sense. In this paper, we propose a polynomial-time heuristic algorithm for allocating a real-time application consisting of a set of tasks with precedence relations on a multi-core platform. To make the proposed method independent of a specific architecture, the allocation is performed on a set of virtual processors, achieved through a set of uniprocessor reservations. The performance of the proposed heuristics is evaluated through simulation experiments against the optimal partioning (implemented through a branch and bound algorithm) and a naif approach. I
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.