Technical Report CS0956

Title: Adaptive long-lived renaming with read and write operations
Authors: Hagit Attiya and Arie Fouren
PDFNot Available
Abstract: This paper presents an adaptive algorithm for long-lived renaming using only read and write operations. A process p_i obtains a new name in the range {1,...,k(2k-1)}, where k is the maximal number of processes simultaneously participating with p_i; the number of steps performed by p_i is O(k^2 log k). The range of names is further reduced to {1,...,6k-1}, by employing the algorithm of Burns and Peterson.
CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (, rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1999
To the main CS technical reports page

Computer science department, Technion