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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	SIAM journal on computing Ročník 34; číslo 4; s. 848 - 862
Hlavní autoři:	Georgiou, Chryssis, Russell, Alexander, Shvartsman, Alexander A.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Philadelphia, PA Society for Industrial and Applied Mathematics 01.01.2005
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!