Publication

Fast Randomized Test-and-Set and Renaming

Abstract

Most people believe that renaming is easy: simply choose a name \emph{at random}; if more than one process selects the same name, then try again. We highlight the issues that occur when trying to implement such a scheme and shed new light on the read-write complexity of randomized renaming in an asynchronous environment. At the heart of our new perspective stands an adaptive implementation of a randomized test-and-set object, that has poly-logarithmic step complexity per operation, with high probability. Interestingly, our implementation is anonymous, as it does not require process identifiers. Based on this implementation, we present two new randomized renaming algorithms. The first ensures a tight namespace of nn names using O(nlog4n)O( n \log^4 n) total steps, with high probability. This improves on the best previously known namespace-optimal algorithm by almost a quadratic factor. The second algorithm achieves a namespace of size k(1+ϵ)k (1 + \epsilon) using O(klog4k/log2(1+ϵ))O( k \log^4 k / \log^2 (1 + \epsilon) ) total steps, both with high probability, where kk is the total contention in the execution. It is the first \emph{adaptive} randomized renaming algorithm, and it improves on existing deterministic solutions by providing a smaller namespace, and by lowering complexity.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.