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

Full description

Saved in:

Bibliographic Details
Published in:	Proceedings of the International Conference on Distributed Computing Systems pp. 83 - 92
Main Authors:	Kentros, Sotirios, Kari, Chadi, Kiayias, Aggelos, Russell, Alexander
Format:	Conference Proceeding Journal Article
Language:	English
Published:	IEEE 01.06.2015
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!