Algorithm design and analysis using the WPRAM model

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 pre...

Full description

Saved in:
Bibliographic Details
Main Authors: Nash, J.M., Dyer, M.E., Dew, P.M.
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Computer industry
Convergence
Costing
Costs
Parallel processing
Performance analysis
Programming profession
Queueing analysis
Software algorithms
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
DOI:10.1109/HIPS.1997.582965