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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information processing letters Jg. 61; H. 4; S. 205 - 208
1. Verfasser:	Roupin, Frédéric
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 28.02.1997 Elsevier Science Elsevier Sequoia S.A Elsevier
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!