Top-Down Design of Bulk-Synchronous Parallel Programs

This paper studies top-down program development techniques for Bulk-Synchronous Parallelism. In that context a specification formalism LOGS, for 'the Logic of Global Synchrony', has been proposed for the specification and high-level development of BSP designs. This paper extends the use of LOGS to provide support for the protection of local variables in BSP programs, thus completing the link between specifications and programs.

[1]  Alan Stewart,et al.  BSP-style Computation: a Semantic Investigation , 2001, Comput. J..

[2]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[3]  Yifeng Chen.  Cumulative Computing , 2003, MFPS.

[4]  Cornelis Vuik,et al.  Parallelism in ILU-preconditioned GMRES , 1998, Parallel Comput..

[5]  Lei Chen,et al.  Algebraic Laws for BSP Programming , 1996, Euro-Par, Vol. II.

[6]  Yifeng Chen,et al.  A fixpoint theory for non-monotonic parallelism , 2002, Theor. Comput. Sci..

[7]  Quentin Miller,et al.  BSP in a Lazy Functional Context , 2001, Scottish Functional Programming Workshop.

[8]  David Lecomber.  Methods of BSP programming , 1998 .

[9]  Yifeng Chen,et al.  Logic of global synchrony , 2001, TOPL.

[10]  Yifeng Chen.  Formal methods for global synchrony , 2001 .

[11]  David B. Skillicorn.  Building BSP Programs Using the Refinement Calculus , 1998, IPPS/SPDP Workshops.

[12]  Frédéric Loulergue,et al.  Parallel Juxtaposition for Bulk Synchronous Parllel ML , 2003, Euro-Par.

[13]  Torsten Suel,et al.  BSPlib: The BSP programming library , 1998, Parallel Comput..