On Time Bounds, the Work-Time Scheduling Principle, and Optimality for BSR
IEEE Transactions on Parallel and Distributed Systems
Merging, sorting and matrix operations on the SOME-bus multiprocessor architecture
Future Generation Computer Systems - Special issue: Advanced services for clusters and internet computing
O(1) time algorithm on BSR for constructing a binary search tree with best frequencies
PDCAT'04 Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies
| Hi-index | 0.00 |
Merging is one of the most fundamental problems in computer science. It is well lcnown that\Omega( N \over p + log log N) time is required to merge two sortedsequences each of length N on CRCW PRAM with pprocessors, where p \leq N log\alpha,N for any constant a. Inthis paper, we describe two optimal O(1) time solutionsto the problem for p = N on BSR (Broadcasting withSelective Reduction). They are the first constant timesolutions to the problem on any model of computation.We also give an optimal solution to the problem forp