Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups

The problem of cooperatively performing a set of t tasks in a decentralized computing environment subject to failures is one of the fundamental problems in distributed computing. The setting with partitionable networks is especially challenging, as algorithmic solutions must accommodate the possibil...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	SIAM journal on computing Jg. 34; H. 4; S. 848 - 862
Hauptverfasser:	Georgiou, Chryssis, Russell, Alexander, Shvartsman, Alexander A.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2005
Schlagworte:	Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Communication Competition Computer science Computer science; control theory; systems Computer systems performance. Reliability Distributed processing Exact sciences and technology Knowledge Scheduling Software Theoretical computing 68W20 Lower bound 68Q25 68W40 Task complexity partitionable networks independent tasks Competitiveness on-line algorithms distributed computation Scheduling Independent task Computing Distributed computing Competitive algorithms Upper bound Partitioning Algorithm performance Multiplicity randomized algorithms work complexity 68W15 Counting 68Q85 competitive analysis
ISSN:	0097-5397, 1095-7111
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!