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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Information processing letters Ročník 61; číslo 4; s. 205 - 208
Hlavní autor:	Roupin, Frédéric
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Amsterdam Elsevier B.V 28.02.1997 Elsevier Science Elsevier Sequoia S.A Elsevier
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!