The system will be going down for regular maintenance. Please save your work and logout.

Now showing items 295-297 of 1152

    • Randomness and Robustness in Hypercube Computation 

      Newman, Mark Joseph (1991-04)
      In this thesis we explore means by which hypercubes can compute despite faulty processors and links. We also study techniques which enable hypercubes to simulate dynamically changing networks and data structures.
    • Waiting Algorithms for Synchornization in Large-scale Multiprocessors 

      Lim, Beng-Hong; Agarwal, Anant (1991-02)
      Through analysis and experiments, this paper investigates two-phase waiting algorithms to minimize the cost of waiting for synchronization in large-scale multiprocessors. In a two-phase algorithm, a thread first waits by ...
    • An Evaluation of Concurrent Priority Queue Algorithms 

      Huang, Qin (1991-02)
      The priority queue is a fundamental data structure that is used in a large variety of parallel algorithms, such as multiprocessor scheduling and parallel best-first search of state-space graphs.