This paper describes the ARS library package, which supports two implementation versions of an object-based system: a shared-variable and a message-passing version. The two versions have the same object structure and synchronisation but differ in their process structure and inter-process communicati
Efficient and Robust Sharing of Memory in Message-Passing Systems
โ Scribed by Hagit Attiya
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 154 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0196-6774
No coin nor oath required. For personal study only.
โฆ Synopsis
A simulation of a wait-free, atomic, single-writer multireader register in an asynchronous message passing system is presented. The simulation can withstand ลฝ . ลฝ the failure of up to half of the processors and requires O n messages for each . read or write operation , assuming there are n q 1 processors in the system. It ลฝ 2 . ลฝ improves on the previous simulation, which requires O n messages for each . read or write operation . The message complexity of the new simulation is within a constant factor of the optimum. The new simulation improves the complexity of algorithms for the following problems in the message-passing model in the presence of processor failures: multiwriter multireader registers, concurrent time-stamp systems, l l-exclusion, atomic snapshots, randomized consensus, implementation of data structures, as well as improved fault-tolerant algorithms for any solvable decision task.
๐ SIMILAR VOLUMES
## Abstract We report a feasibility study for the application of our newly developed highly efficient and robust fluorescenceโresonanceโenergyโtransfer (FRET) system to DNA. A 2โฒโoligodeoxynucleotide, **12**, equipped with a quinolinone derivative as donor and a (bathophenanthroline)ruthenium(II) c
## Abstract An efficient, reusable and scalable protocol for the rapid and selective oxidation of aliphatic, terminal alkenes to epoxides is developed.