Asynchronous Adaptive Task Allocation

We present a randomized algorithm for asynchronous task allocation, also known as the write-all or do-all problem. Our algorithm has work complexity O(n+k 2 log 3 k) with high probability, where n the number of tasks and k the number of processes that participate in the computation. Our solution use...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Proceedings of the International Conference on Distributed Computing Systems S. 83 - 92
Hauptverfasser:	Kentros, Sotirios, Kari, Chadi, Kiayias, Aggelos, Russell, Alexander
Format:	Tagungsbericht Journal Article
Sprache:	Englisch
Veröffentlicht:	IEEE 01.06.2015
Schlagworte:	Additives Algorithms Allocations asynchronous shared memory Complexity theory Computational modeling Computer crashes Computer networks Conferences distributed computing Distributed processing Indexes Mathematical models Program processors randomized algorithms Resource management task allocation Tasks write-all
ISSN:	1063-6927
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!