LCS Technical Memos (1974 - 2003): Recent submissions

Now showing items 127-129 of 486

    • Integrating Message-passing and Shared-memory: Early Experience 

      Kranz, David; Johnson, Kirk; Agarwal, Anant; Kubiatowicz, John; Lim, Beng-Hong (1992-10)
      This paper discusses some of the issues involved in implementing a shared-address space programming model on large-scale, distributed-memory multiprocessors. Because message-passing mechanisms are much more efficient than ...

    • Hybrid Atomicity for Nested Transactions 

      Fekete, Alan; Lynch, Nancy A.; Weihl, William E. (1992-10)
      This paper defines the notion of hybrid atomicity for nested transaction systems, and presents and verifies an algorithm providing this property. Hybrid atomicity is a modular property; it allows the correctness of a system ...

    • More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems 

      Chaudhuri, Soma (1992-09)
      We define k-set consensus problem as an extension of the consensus problem, where each processors decides on a single value such that the set of decided values in any run is of size at most k. We require the agreement ...