Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computing with faulty shared memory
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
ACM Computing Surveys (CSUR)
Computing with faulty shared objects
Journal of the ACM (JACM)
SIAM Journal on Computing
Fault-tolerant wait-free shared objects
Journal of the ACM (JACM)
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Benign Failure Models for Shared Memory (Preliminary Version)
WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
| Hi-index | 0.00 |
The problem of computing with faulty shared bits is addressed. The focus is on constructing a reliable test&set bit from a collection of test&set bits of which some may be faulty. Faults are modeled by allowing operations on the faulty bits to return a special distinguished value, signaling that the operation may not have taken place. Such faults are called omission faults. Some of the constructions are required to be gracefully degradingfor omission. That is, if the bound on the number of component bits which fail is exceeded, the constructed bit may suffer faults, but only faults which are no more severe than those of the components; and the constructed bit behaves as intended if the number of component bits which fail does not exceed that bound. Several efficient constructions are presented, and bounds on the space required are given. Our constructions for omission faults also apply to other fault models.