Skip to main content
Article thumbnail
Location of Repository

Heuristics for Partitioning Parallel Applications on Virtual Multiprocessors

By Giorgio Buttazzo, Enrico Bini and Yifan Wu

Abstract

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

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.7997
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://retis.sssup.it/~bini/pu... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.