The design and analysis of parallel algorithms
The design and analysis of parallel algorithms
A bridging model for parallel computation
Communications of the ACM
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
An introduction to parallel algorithms
An introduction to parallel algorithms
Parallel sorting by regular sampling
Journal of Parallel and Distributed Computing
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Scalable parallel geometric algorithms for coarse grained multicomputers
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
IEEE Transactions on Parallel and Distributed Systems
Parallel and distributed computing handbook
Parallel and distributed computing handbook
Parallel computation: models and methods
Parallel computation: models and methods
An Optimal Implementation of Broadcasting with Selective Reduction
IEEE Transactions on Parallel and Distributed Systems
Applications of BSR Model of Computation for Subsegment Problems
HIPC '97 Proceedings of the Fourth International Conference on High-Performance Computing
| Hi-index | 0.00 |
In this paper we present our investigations to implement some computational geometry problems (point in a polygon, intersection problem, convex hull) under the framework of BSR (Broadcasting with Selective Reduction) model of parallel computing, then under the framework of BSP (Bulk Synchronous Parallel model) programs. BSR is a (theoretical) model with the capabilities of PRAM models augmented with a broadcast mechanism. BSR offers concise notations that facilitates the specification part. BSP is suitable for concrete implementation because it also characterizes prediction in terms of a small set of machine parameters. So, instead of implementing in hardware the primitives of the BSR model we consider practical rules to translate BSR constructions into BSP ones. We also validate the discussion by translating BSR programs into BSP programs. We run them both on Silicon Graphics Origin2000 and on a Bi-Pentium 300MHz. The results encourage us to develop computational geometry problems starting from a BSR specification that is automatically translated into efficient BSP implementations. The results are pretty good and demonstrate that BSR can be used as a specification language which is implemented in software by BSP primitives.