𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Instancy of Snapshots and Commuting Objects

✍ Scribed by Yehuda Afek; Eytan Weisberger


Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
285 KB
Volume
30
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

✦ Synopsis


We present a sequence of constructions of commuting synchronization objects Ž . e.g., fetch-and-increment and fetch-and-add in a system of n processors from any two processor synchronization objects whose consensus number is two or more ŽHerlihy, ''Proceedings of the Tenth ACM Symposium on Principles of Distributed . Computing, 1991,'' pp. 11᎐22 . Each implementation in the sequence uses a particular type of shared memory snapshot as a building block. Later implementations in the sequence are based on higher quality snapshots. The first implementation of a fetch-and-increment uses the standard atomic snapshot concept, intro-Ž Ž .


πŸ“œ SIMILAR VOLUMES


Handbook of Applied Algorithms || Genera
✍ Nayak, Amiya; Stojmenovi, Ivan πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley & Sons, Inc. 🌐 English βš– 330 KB

discover The Benefits Of Applying Algorithms To Solve Scientific, Engineering, And Practical Problems Providing A Combination Of Theory, Algorithms, And Simulations, Handbook Of Applied Algorithms Presents An All-encompassing Treatment Of Applying Algorithms And Discrete Mathematics To Practi

The Euler Characteristics of Discrete Ob
✍ Atsushi Imiya; Ulrich Eckhardt πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 139 KB

Assuming planar 4-connectivity and spatial 6-connectivity, we first introduce the curvature indices of the boundary of a discrete object, and, using these indices of points, we define the vertex angles of discrete surfaces as an extension of the chain codes of digital curves. Second, we prove the re

On the memory overhead of distributed sn
✍ Shabtay, Lior; Segall, Adrian πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 60 KB πŸ‘ 3 views

This paper shows that the memory overhead of distributed snapshots is unbounded. Several techniques are suggested for bounding it: bounded memory-overhead versions of distributed snapshots for specific problems, like termination detection and deadlock detection; use of alternative protocols; or use

Genus Characters and the Arithmetic of C
✍ David H. Johnson; Clifford S. Queen πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 410 KB

In this paper we develop an ideal theory for certain submonoids of the nonzero integers. We associate one of these monoids to each quadratic number field and show that the genus theory of ideals and genus characters of the number field are virtually the same as the ideal theory and the characters of