Parallel general prefix computations with geometric, algebraic, and other applications
International Journal of Parallel Programming
An introduction to parallel algorithms
An introduction to parallel algorithms
Intelligent database tools & applications
Intelligent database tools & applications
The art of parallel programming
The art of parallel programming
Constant time BSR solutions to L1 metric and digital geometry problems
Journal of Mathematical Imaging and Vision
Solving the shortest-paths problem on bipartite permutation graphs efficiently
Information Processing Letters
Partitioning graphs into Hamiltonian ones
Parallel Computing
IEEE Transactions on Parallel and Distributed Systems
Parallel computation: models and methods
Parallel computation: models and methods
Information Processing Letters
Optimal circular arc representations: properties, recognition and construction
Journal of Computer and System Sciences
Time-efficient parallel algorithms for the longest common subsequence and related problems
Journal of Parallel and Distributed Computing
An Optimal Implementation of Broadcasting with Selective Reduction
IEEE Transactions on Parallel and Distributed Systems
Optimal Circular Arc Representations
Euro-Par '95 Proceedings of the First International Euro-Par Conference on Parallel Processing
Optimal overlap representations
ISPAN '96 Proceedings of the 1996 International Symposium on Parallel Architectures, Algorithms and Networks
Applications of BSR Model of Computation for Subsegment Problems
HIPC '97 Proceedings of the Fourth International Conference on High-Performance Computing
On Time Bounds, the Work-Time Scheduling Principle, and Optimality for BSR
IEEE Transactions on Parallel and Distributed Systems
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 |
BSR (Broadcasting with Selective Reduction) is a PRAM more powerful than any CRCW PRAM. In order to extend the Broadcast Instruction of BSR and make it more useful for a large class of applications, this article permits it to use a general form of selection, specifically, an arbitrary relational expression. BSR with general selection is denoted by BSR+. Thus, BSR or BSR with $k$ criteria ($k1$) is BSR+ in a special case. An efficient implementation for the Broadcast Instruction of BSR+ is proposed, requiring $(1/k)$th of the circuits used by the best previous implementation of BSR with $k$ criteria. Of all PRAMs, BSR+ is the most powerful in computation.