Work

Brief Announcement: Optimal Construction of Unique Identifiers from Bounded Registers

Year: 2025

Type: conference-paper

Abstract: In this paper, we describe an algorithm implementing the unique-id abstraction from bounded-storage registers maintaining read, write, and FAI operations. Given k registers, storing w bits each, our implementation generates up to (k - 1) · 2w unique identifiers, assuming that k ≤ 2w + 1. We show that this is asymptotically optimal: no unique-id implementation can produce more than k · 2w + k + 1 identifiers.

Source: ACM Symposium on Principles of Distributed Computing (PODC)

DOI: 10.1145/3732772.3733539

Authors: Michael Anoprenko, Petr Kuznetsov, Vitaly Aksenov

Institutions: Institut Polytechnique de Paris, Télécom Paris, Laboratoire Traitement et Communication de l’Information, City St George's, University of London

Language: English

Topic: Distributed systems and fault tolerance

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Funders: Agence Nationale de la Recherche, CHIST-ERA

Awards: G212842473, A Next-generation State-machine Replication Protocol for Blockchain