College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
|Title: ||Merging on Parallel Models of Computation|
|Authors: ||Borodin, Allan B.|
Hopcroft, John E.
|Keywords: ||computer science|
|Issue Date: ||Sep-1981|
|Publisher: ||Cornell University|
|Abstract: ||A variety of models have been proposed for the study of synchronous parallel computation. We review these models and study further some prototype problems. Within a spectrum of shared memory models, we show that $\log \log n$ is asymtotically optimal for $n$ processors to merge two sorted lists containing $n$ elements.|
|Appears in Collections:||Computer Science Technical Reports|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.