| Abstract |
|---|
| The BSP provides a simple cost model, by using supersteps to developparallel software. This paper demonstrates how the cost model can bepreserved when developing software for irregular problems, whichrequire dynamic load balancing and introduce runtime task dependencies.Shared data types are used within a superstep to support the dynamicsharing patterns within an application. Scalable performance isderived through weakened forms of shared data consistency, in orderto support highly concurrent implementations. An example of a priorityqueue to support a solution of the travelling salesman problem isgiven, with performance results provided for the Cray T3D. |
| Contact |
| Jonathan Nash The School of Computer Studies ,The University of Leeds ,Leeds LS2 9JT , , nash@scs.leeds.ac.uk |