Thumbnail
Access Restriction
Subscribed

Author Haldar, Sibsankar ♦ Vitnyi, Paul
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2002
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Concurrent reading while writing ♦ Label ♦ Labeling and scan ♦ Nonatomic operation execution ♦ Operation execution ♦ Operation---read and write ♦ Regular and atomic ♦ Shared variable---safe ♦ Timestamp system ♦ Traceability ♦ Vector clock ♦ Wait-freedom
Abstract Shared registers are basic objects used as communication mediums in asynchronous concurrent computation. A concurrent timestamp system is a higher typed communication object, and has been shown to be a powerful tool to solve many concurrency control problems. It has turned out to be possible to construct such higher typed objects from primitive lower typed ones. The next step is to find efficient constructions. We propose a very efficient wait-free construction of bounded concurrent timestamp systems from 1-writer shared registers. This finalizes, corrects, and extends a preliminary bounded multiwriter construction proposed by the second author in 1986. That work partially initiated the current interest in wait-free concurrent objects, and introduced a notion of discrete vector clocks in distributed algorithms.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2002-01-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 49
Issue Number 1
Page Count 26
Starting Page 101
Ending Page 126


Open content in new tab

   Open content in new tab
Source: ACM Digital Library