Now showing items 280-282 of 1152

    • Preventing Recursion Deadlock in Concurrent Object-oriented Systems 

      Brewer, Eric A.; Waldspurger, Carl A. (1992-02)
      This paper presents solutions to the problem of deadlock due to recursion in concurrent object-oriented programming languages. Two language-independent, system-level mechanisms for solving this problem are proposed: a ...
    • Full Abstraction and the Context Lemma 1 

      Jim, Trevor; Meyer, Albert R. (1991-12)
      It is impossible to add a combinator to PCF to achieve full abstraction for models such as Berry's stable domains in a way analogous to the addition of the "parallel-or" combinator that achieves full abstraction for the ...
    • Scalable Reader-writer Locks for Parallel Systems 

      Hsieh, William C.; Weihl, William E. (1991-11)
      Current algorithms for reader-writer synchronization exhibit poor scalability because they do not allow readers to acquire locks independently. We describe two new algorithms for reader-writer synchronization that allow ...