The task allocation problem with constant communication

In the module allocation problem we are given n tasks t 1,…, t n , to be executed by m processors P 1,…, P m , subject to both execution and communication costs. The cost of any assignment of the tasks to the processors is defined as the sum of the corresponding execution costs, and the communicatio...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Discrete Applied Mathematics Ročník 131; číslo 1; s. 169 - 177
Hlavní autori:	Fernandez de la Vega, W., Lamari, M.
Médium:	Journal Article Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	Lausanne Elsevier B.V 06.09.2003 Amsterdam Elsevier New York, NY
Predmet:	Applied sciences Combinatorics Combinatorics. Ordered structures Computer science; control theory; systems Computer systems performance. Reliability Exact sciences and technology Graph theory Mathematics Operational research and scientific management Operational research. Management science Polynomial time approximation scheme Scheduling Scheduling, sequencing Sciences and techniques of general use Software Polynomial time approximation scheme Scheduling Polynomial Costs Processor Scheme Polynomial approximation Complete Constant Numerical approximation Assignment Allocation Number Optimal allocation Bipartite graph Communication Edge(graph) Approximation Complete graph Graph clique Graph theory Algorithm Cost control Polynomial time Problem Communication graph Module Edge Graph algorithm
ISSN:	0166-218X, 1872-6771
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!