Programming Research Group Technical Report TR-21-97

PRAM Programming: Theory vs. Practice Parallelisation

A V Gerbessiotis, D S Lecomber, C J Siniolakis and K R Sujithan Abstract:

In this paper we investigate the practical viability of PRAM programming within the BSP framework. We argue that there is a necessity for PRAM computations in situations where the problem exhibits poor data locality. We introduce a C++ PRAM simulator that is built on top of the Oxford BSP Toolset, BSPlib, and provide a succint PRAM language. Our approach achieves simplicity of programming over direct-mode BSP programming for reasonable overhead cost. We objectively compare optmised BSP algorithms with PRAM algorithms implemented with our C++ PRAM library and provide encouraging experimental results for the latter style of programming.


This paper is available as a 105,873 byte compressed PostScript file