DocumentCode :
3440310
Title :
Algorithm design and analysis using the WPRAM model
Author :
Nash, Jonathan M. ; Dyer, Martin E. ; Dew, Peter M.
Author_Institution :
Sch. of Comput. Studies, Leeds Univ., UK
fYear :
1997
fDate :
35521
Firstpage :
125
Lastpage :
129
Abstract :
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
Keywords :
parallel programming; software portability; BSP model; WPRAM model; parallel computing; performance analysis; portable software; shared queue data type; Algorithm design and analysis; Computer industry; Convergence; Costing; Costs; Parallel processing; Performance analysis; Programming profession; Queueing analysis; Software algorithms;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
High-Level Programming Models and Supportive Environments, 1997. Proceedings., Second International Workshop on
Conference_Location :
Geneva
Print_ISBN :
0-8186-7882-8
Type :
conf
DOI :
10.1109/HIPS.1997.582965
Filename :
582965
Link To Document :
بازگشت