A simple, memory-efficient bounded concurrent timestamping algorithm

Abstract

Several constructions have been proposed for implementing a Bounded Concurrent Timestamp System (BCTS). Some constructions are basedon a recursively defined Precedence Graph. Such constructions have been viewedas hardto understandandto prove correct. Other constructions that are basedon the Traceable Use abstraction first proposed by Dwork and Waarts have been regardedas simple and have therefore been preferred. The Dwork-Waarts (DW) algorithm, however, is not space-efficient. Haldar and Vitanyi (HV) gave a more space-efficient construction basedon Traceable Use, starting with only safe and regular registers as building blocks. In this paper, we present a new algorithm by making simple modifications to DW. Our algorithm is simple and is more memory-efficient than the DW and HV algorithms. © Springer-Verlag Berlin Heidelberg 2002.