• Causal Memory: Definitions, Implementation, and Programming 

      Ahamad, Mustaque; Neiger, Gil; Kohli, Prince; Burns, James Edward; Hutto, Phillip W. (Georgia Institute of Technology, 1993)
      The abstraction of a shared memory is of growing importance in distributed computing systems. Traditional memory consistency ensures that all processes agree on a common order of all operations on memory. Unfortunately, ...
    • A Characterization of Scalable Shared Memories 

      Kohli, Prince; Neiger, Gil; Ahamad, Mustaque (Georgia Institute of Technology, 1993)
      The traditional consistency requirements of shared memory are expensive to provide both in large scale multiprocessor systems and also in distributed systems that implement a shared memory abstraction in software. As a ...
    • The Complexity of Almost-Optimal Coordination 

      Bazzi, Rida Adnan; Neiger, Gil (Georgia Institute of Technology, 1993)
      The problem of fault-tolerant coordination is fundamental in distributed computing. In the past, researchers have considered the complexity of achieving optimal simultaneous coordination under various failure ...
    • Distributed Consensus Revisited 

      Neiger, Gil (Georgia Institute of Technology, 1993)
      Distributed Consensus is a classical problem in distributed computing. It requires the correct processors in a distributed system to agree on a common value despite the failure of other processors. This problem is ...
    • Simplifying Fault-Tolerance: Providing the Abstraction of Crash Failures 

      Bazzi, Rida Adnan; Neiger, Gil (Georgia Institute of Technology, 1993)
      The difficulty of designing fault-tolerant distributed algorithms increases with the severity of failures that an algorithm must tolerate. This paper considers methods that automatically translate algorithms tolerant ...
    • Space-Efficient Atomic Snapshots in Synchronous Systems 

      Neiger, Gil; Singh, Ranu (Georgia Institute of Technology, 1993)
      We consider the problem of implementing an atomic snapshot memory in synchronous distributed systems. An atomic snapshot memory is an array of memory locations, one per processor. Each processor may update its own ...
    • Using Knowledge to Optimally Achieve Coordination in Distributed Systems 

      Neiger, Gil; Bazzi, Rida Adnan (Georgia Institute of Technology, 1993)
      The problem of coordinating the actions of individual processors is fundamental in distributed computing. Researchers have long endeavored to find efficient solutions to a variety of problems involving coordination. ...