A bridging model for parallel computation
Communications of the ACM
Synchronization without contention
ASPLOS IV Proceedings of the fourth international conference on Architectural support for programming languages and operating systems
A methodology for implementing highly concurrent data objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
An optimal randomized planar convex hull algorithm with good empirical performance
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Implementation Issues Relating to the WPRAM Model for Scalable Computing
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
| Hi-index | 0.00 |
The takeup of parallel computing has been hampered by the lack of portable software. The BSP model allows the design of portable code for regular computations. This paper describes the use of the WPRAM model to support more irregular problems. A shared queue data type is described, which provides predictable and scalable performance characteristics. The queue can be used to structure the sharing of data in a parallel system, resulting in code which is portable and amenable to performance analysis.