The Las-Vegas Processor Identity Problem
โ
Shay Kutten; Rafail Ostrovsky; Boaz Patt-Shamir
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 214 KB
We study the classical problem of assigning unique identifiers to identical concurrent processes. In this paper, we consider the asynchronous shared memory model, and the correctness requirement is that upon termination of the algorithm, the processes must have unique IDs always. Our results include