The Assignment Problem - Archive ouverte HAL Access content directly
Conference Papers Year :

The Assignment Problem

(1, 2) , (1, 2) , (3) , (3)
1
2
3

Abstract

In the allocation problem, asynchronous processors must partition a set of items so that each processor leave knowing all items exclusively allocated to it. We introduce a new variant of the allocation problem called the assignment problem, in which processors might leave having only partial knowledge of their assigned items. The missing items in a processor's assignment must eventually be announced by other processors. While allocation has consensus power 2, we show that the assignment problem is solvable read-write wait-free when k processors compete for at least 2k − 1 items. Moreover, we propose a long-lived read-write wait-free assignment algorithm which is fair, allocating no more than 2 items per processor, and in which a slow processor may delay the assignment of at most n items, where n is the number of processors. The assignment problem and its read-write solution may be of practical interest for implementing resource allocators and work queues, which are pervasive concurrent programming patterns, as well as stream-processing systems.
Fichier principal
Vignette du fichier
final.pdf (864.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01955902 , version 1 (14-12-2018)

Identifiers

  • HAL Id : hal-01955902 , version 1

Cite

Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, Giuliano Losa. The Assignment Problem. International Conference on Distributed Computing and Networking, {ICDCN}, 2018, Varanasi, India. ⟨hal-01955902⟩
63 View
58 Download

Share

Gmail Facebook Twitter LinkedIn More