Scheduling Distributed Clusters of Parallel Machines : Primal-Dual and LP-based Approximation Algorithms

The Map-Reduce computing framework rose to prominence with datasets of such size that dozens of machines on a single cluster were needed for individual jobs. As datasets approach the exabyte scale, a single job may need distributed processing not only on multiple machines, but on multiple clusters ....

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 80; číslo 10; s. 2777 - 2798
Hlavní autori:	Murray, Riley, Khuller, Samir, Chao, Megan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.10.2018 Springer Nature B.V
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Approximation Clusters Combinatorial analysis Completion time Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Datasets Distributed processing Employment Mapping Mathematics of Computing Production scheduling Scheduling Theory of Computation Approximation algorithms Primal-dual algorithms Machine scheduling F.2.2 Nonnumerical Algorithms and Problems LP relaxations Distributed computing
ISSN:	0178-4617, 1432-0541
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!