Parallel Juxtaposition for Bulk Synchronous Parllel ML

The BSMLlib library is a library for Bulk Synchronous Parallel (BSP) programming with the functional language Objective Caml. It is based on an extension of the λ-calculus by parallel operations on a parallel data structure named parallel vector. An attempt to add a parallel composition to this approach led to a non-confluent calculus and to a restricted form of parallel composition. This paper presents a new, simpler and more general semantics for parallel composition.

[1]  Simon L. Peyton Jones,et al.  Processing Transactions on GRIP, a Parallel Graph Reducer , 1993, PARLE.

[2]  Friedhelm Meyer auf der Heide,et al.  Truly Efficient Parallel Algorithms: c-Optimal Multisearch for an Extension of the BSP Model (Extended Abstract) , 1995, ESA.

[3]  Frédéric Loulergue.  Distributed Evaluation of Functional BSP Programs , 2001, Parallel Process. Lett..

[4]  David B. Skillicorn,et al.  Questions and Answers about BSP , 1997, Sci. Program..

[5]  Friedhelm Meyer auf der Heide,et al.  Truly Efficient Parallel Algorithms: 1-optimal Multisearch for an Extension of the BSP Model , 1998, Theor. Comput. Sci..

[6]  Susanna Pelagatti.  Structured development of parallel programs , 1997 .

[7]  Yasushi Hayashi,et al.  Shape-based cost analysis of skeletal parallel programs , 2001 .

[8]  Olaf Bonorden,et al.  The Paderborn university BSP (PUB) library-design, implementation and performance , 1999, Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing. IPPS/SPDP 1999.

[9]  Frédéric Loulergue.  Implementation of a Functional Bulk Synchronous Parallel Programming Library , 2002, IASTED PDCS.

[10]  Leslie G. Valiant,et al.  Direct Bulk-Synchronous Parallel Algorithms , 1994, J. Parallel Distributed Comput..

[11]  Simon L. Peyton Jones,et al.  The Implementation of Functional Programming Languages , 1987 .

[12]  Frédéric Loulergue,et al.  Parallel composition and bulk synchronous parallel functional programming , 2000, Scottish Functional Programming Workshop.

[13]  William F. McColl.  Universal Computing , 1996, Euro-Par, Vol. I.

[14]  George Horatiu Botorog,et al.  Efficient High-Level Parallel Programming , 1998, Theor. Comput. Sci..

[15]  Arndt Bode,et al.  PARLE '93 Parallel Architectures and Languages Europe , 1993, Lecture Notes in Computer Science.

[16]  Michael F. P. O'Boyle,et al.  Compiler Reduction of Invalidation Traffic in Virtual Shared Memory Systems , 1996, Euro-Par, Vol. I.

[17]  Jocelyn Sérot,et al.  Skeletons for parallel image processing: an overview of the SKIPPER project , 2002, Parallel Comput..

[18]  Clyde P. Kruskal,et al.  Submachine Locality in the Bulk Synchronous Setting (Extended Abstract) , 1996, Euro-Par, Vol. II.

[19]  Frédéric Loulergue.  DISTRIBUTED EVALUATION OF FUNCTIONAL BSP PROGRAMS , 2001 .

[20]  Frédéric Loulergue,et al.  A Polymorphic Type System for Bulk Synchronous Parallel ML , 2003, PaCT.

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

[22]  Alexander Tiskin,et al.  The design and analysis of bulk-synchronous parallel algorithms , 1998 .

[23]  Murray Cole,et al.  Algorithmic Skeletons: Structured Management of Parallel Computation , 1989 .

[24]  Konrad Hinsen.  Parallel Programming with BSP in Python , 2000 .

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

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

[27]  Emmanuel Chailloux,et al.  Caml Flight: a Portable SPMD Extension of ML for Distributed Memory Multiprocessors , 1995 .

[28]  Keshav Pingali,et al.  I-structures: data structures for parallel computing , 1986, Graph Reduction.

[29]  Frédéric Loulergue,et al.  A calculus of functional BSP programs , 2000, Sci. Comput. Program..

[30]  Prakash Panangaden,et al.  The Essence of Concurrent ML , 1997 .

[31]  Peter G. Harrison,et al.  Parallel Programming Using Skeleton Functions , 1993, PARLE.

[32]  Olaf Bonorden,et al.  Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example , 2002 .

[33]  Alexander Tiskin,et al.  A New Way to Divide and Conquer , 2001, Parallel Process. Lett..

[34]  William F. McColl,et al.  Scalability, portability and predictability: The BSP approach to parallel programming , 1996, Future Gener. Comput. Syst..

[35]  D. B. Skillicorn.  Multiprogramming BSP Programs , 1996 .