Now showing items 286-288 of 3794

    • 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 ...
    • PRELUDE: A System for Portable Parallel Software 

      Weihl, William Edward; Brewer, Eric A.; Colbrook, Adrian; Dellarocas, Chrysanthos N.; Hsieh, Wilson; e.a. (1991)
      This paper describes PRELUDE, a programming language and accompanying system support for writing portable MIMD parallel programs. PRELUDE supports a methodology for designing and organizing parallel programs that makes ...