No abstract

Unclassified 2a. SECURITY CLASSIFICATION AUTHORITY 3. DISTRIBUTION /AVAILABILITY OF REPORT Approved for ,.ublic release; distribution 2b. DECLASSIFICATION/ DOWNGRADING SCHEDULE is unlimited. 4. PERFORMING ORGANIZATION REPORT NUMBER(S) S. MONITORING ORGANIZATION REPORT NUMBER(S) MIT/LCS/TM-429 N00014-83-K-0125 6a. NAME OF PERFORMING ORGANIZATION 6b. OFFICE SYMBOL 7a. NAME OF MONITORING ORGANIZATION MIT Lab for Computer Science (If applicable) Office of Naval Research/Dept. of Navy 6c. ADDRESS (City, State. and ZIPCode) 7b. ADDRESS(Oty, State, and ZIPCode)

An atomic snapshot memory is a shared data structure allowing concurrent processes to store information in a collection of shared registers, all of which may be read in a single atomic scan operation. This paper presents three wait-free implementations of atomic snapshot memory. Two constructions implement wait-free single-writer atomic snapshot memory from wait-free atomic single-writer, n-reader registers. A third construction implements a wait-free n-writer atomic snapshot memory from n-writer, n-reader registers. The first implementation uses unbounded

Easy proofs are given, of the impossibility of soh, ing several consensus problems (Byzantine agreement, weak agreement, Byzantine firing squad, approximate agreement and clock synchronization) in certain communication graphs. It is shown that, in the presence ofm faults, no solution to these problems exists for communication graphs with fewer than 3m + 1 nodcs or less than 2m + l connectivity. While some of these results had previously been proved, the new proofs are much simpler, provide considerably more insight, apply to more general models of computation, and (particularly in the case of clock synchronization) significantly strengthen the results. I. introtluctionIn this paper, we present easy proofs for the impossibility of solving several conscnsus problems in particular communication graphs. We prove results for Byzantine agreement, weak agrcemcnt, the Byzantine firing squad problem, approximate agreement and clock synchronization. The bounds are all the same: tolerating m faults requires at least 3m + 1 nodes, and requires at least 2m + 1 connectivity in the communication graph. (The connectivity of a graph is the minimum number of nodcs whose removal disconnects the graph.)The work

This paper examines cache consistency conditions for multiprocessor shared memory systems. It states and motivates a weaker condition than is normally implemented. An algorithm is presented that exploits the weaker condition to achieve greater concurrency. The algorithm is shown to satisfy the weak consistency condition. Other properties of the algorithm and possible extensions are discussed.