Access Restriction

Author Ellen, Faith ♦ Fatourou, Panagiota ♦ Ruppert, Eric
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©2007
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Distributed computing ♦ Lower bound ♦ Registers ♦ Shared memory ♦ Snapshot ♦ Wait-free
Abstract A snapshot object is an abstraction of the problem of obtaining a consistent view of the contents of shared memory in a distributed system, despite concurrent changes to the memory. There are implementations of $\textit{m}-component$ snapshot objects shared by $\textit{n}$ ≥ $\textit{m}$ processes using $\textit{m}$ registers. This is the minimum number of registers possible. We prove a time lower bound for implementations that use this minimum number of registers. It matches the time taken by the fastest such implementation. Our proof yields insight into the structure of any such implementation, showing that processes must access the registers in a very constrained way. We also prove a time lower bound for snapshot implementations using single-writer registers in addition to $\textit{m}$ historyless objects (such as registers and swap objects).
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 2007-12-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 54
Issue Number 6

Open content in new tab

   Open content in new tab
Source: ACM Digital Library