ACM Transactions on Programming Languages and Systems (TOPLAS)
Finding the maximum, merging and sorting in a parallel computation model
CONPAR '81 Proceedings of the Conference on Analysing Problem Classes and Programming for Parallel Computing
The NYU Ultracomputer—designing a MIMD, shared-memory parallel machine (Extended Abstract)
ISCA '82 Proceedings of the 9th annual symposium on Computer Architecture
Bounds on the time for parallel RAM's to compute simple functions
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Routing, merging and sorting on parallel models of computation
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Upper and lower bounds on the performance of parallel algorithms
Upper and lower bounds on the performance of parallel algorithms
Parallel Quicksort Using Fetch-And-Add
IEEE Transactions on Computers
Process coordination with fetch-and-increment
ASPLOS IV Proceedings of the fourth international conference on Architectural support for programming languages and operating systems
ACM SIGARCH Computer Architecture News
Issues related to MIMD shared-memory computers: the NYU ultracomputer approach
ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
| Hi-index | 0.00 |
We investigate the complexity of seaching by comparisons a table of n elements on a synchronous, shared memory parallel computer with p processors. We show that O(lgn) steps are required if concurrent access to the same memory cell is not allowed, whereas only O(lgn/lgp) steps are required if simultaneous reads are allowed. We next show that it is possible to search in O(lg(n)/p) steps if more general operations are used.