On approximating the memory-Constrained Module Allocation Problem

In this paper, we consider a variant of the module allocation problem in a distributed system, where processors have limited memory (memory-Constrained Module Allocation Problem). This problem consists of assigning N modules to P processors in order to minimize the sum of execution times and communi...

Full description

Saved in:
Bibliographic Details
Published in:Information processing letters Vol. 61; no. 4; pp. 205 - 208
Main Author: Roupin, Frédéric
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 28.02.1997
Elsevier Science
Elsevier Sequoia S.A
Elsevier
Subjects:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Combinatorial problems
Computational complexity
Computer Science
Computer science; control theory; systems
Computer systems and distributed systems. User interface
Distributed processing
Distributed systems
Exact sciences and technology
Information processing
Operations Research
Polynomial-time approximation algorithms
Software
Studies
Theoretical computing
Combinatorial problems
Polynomial-time approximation algorithms
Distributed systems
Computational complexity
Algorithms
Distributed system
Combinatorial problem
Polynomial time
ISSN:0020-0190, 1872-6119
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we consider a variant of the module allocation problem in a distributed system, where processors have limited memory (memory-Constrained Module Allocation Problem). This problem consists of assigning N modules to P processors in order to minimize the sum of execution times and communication costs. We show that even in three simplified cases, unless P = NP, no polynomial-time algorithm can guarantee to find a feasible solution within c percent of the optimal value, where c is any fixed positive constant. One of these particular cases is the minimization version of the k-partition problem.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(97)00008-2