The Computational Complexity of the Minimum Weight Processor Assignment Problem

H.J. Broersma, D. Paulusma, G.J.M. Smit, F. Vlaardingerbroek, G. Woeginger

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

2 Citations (Scopus)
59 Downloads (Pure)

Abstract

In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors in an energy-efficient way. We model this problem as a graph optimization problem, which we call the minimum weight processor assignment problem. We show that our setting generalizes several problems known in literature, including minimum multiway cut, graph k-colorability, and minimum (generalized) vertex covering. We show that the minimum weight processor assignment problem is NP-hard, even when restricted to instances where the (process) graph is a bipartite graph with maximum degree at most 3, or with only two processors, or with arbitrarily small weight differences, or with only two different edge weights. For graphs with maximum degree at most 2 (or in fact the larger class of degree-2-contractible graphs) we give a polynomial time algorithm. Finally we generalize this algorithm into an exact (but not efficient) algorithm for general graphs.
Original languageEnglish
Title of host publicationGraph-Theoretic Concepts in Computer Science
Subtitle of host publication30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004. Revised Papers
EditorsJuraj Hromkovic, Manfred Nagl, Bernhard Westfechtel
Place of PublicationBerlin
PublisherSpringer
Pages189-200
Number of pages12
ISBN (Print)3-540-24132-9
DOIs
Publication statusPublished - Jun 2004
Event30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2004 - Bad Honnef, Germany
Duration: 21 Jun 200423 Jun 2004
Conference number: 30

Publication series

NameLecture notes in computer science
Volume3353
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Workshop

Workshop30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2004
Abbreviated titleWG
CountryGermany
CityBad Honnef
Period21/06/0423/06/04

Keywords

  • CAES-EEA: Efficient Embedded Architectures

Fingerprint Dive into the research topics of 'The Computational Complexity of the Minimum Weight Processor Assignment Problem'. Together they form a unique fingerprint.

Cite this