Improved Approximations for Multiprocessor Scheduling Under Uncertainty

This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty, or SUU, in which the execution of each job may fail probabilistically. This problem is motivated by the increasing use of distributed computing to handle large, computationally inten...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2008-02
Hauptverfasser:	Crutchfield, Christopher, Dzunic, Zoran, Fineman, Jeremy T, Karger, David R, Jacob, Scott
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation Chains Computer networks Distributed processing Job shops Mathematical analysis Multiprocessing Precedence constraints Production scheduling Schedules Scheduling Uncertainty
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!