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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the International Conference on Distributed Computing Systems s. 83 - 92
Hlavní autoři: Kentros, Sotirios, Kari, Chadi, Kiayias, Aggelos, Russell, Alexander
Médium: Konferenční příspěvek Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.06.2015
Témata:
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
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!
Popis
Shrnutí: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 uses O(n) shared memory space that supports atomic test-and-set operations and with high probability each participating process uses O(k) internal memory space. This is the first adaptive solution for the write-all problem that has work n plus some additive term which depends only on the number of participating processes k and not the size of the problem n.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Conference-1
ObjectType-Feature-3
content type line 23
SourceType-Conference Papers & Proceedings-2
ISSN:1063-6927
DOI:10.1109/ICDCS.2015.17