Pattern Matching of Parallel Values in Bulk Synchronous Parallel ML

We have designed a functional data-parallel language called BSML for programming bulk-synchronous parallel (BSP) algorithms in so-called direct mode. In a directmode BSP algorithm, the physical structure of processes is made explicit. The execution time can then be estimated and dead-locks and indeterminism are avoided. This paper outlines an extension of BSML and of the BSλ-calculus (a calculus of functional bulk synchronous parallel programs) with pattern matching of parallel values.

[1]  François Pessaux,et al.  Type-based analysis of uncaught exceptions , 2000, TOPL.

[2]  Frédéric Gava,et al.  Formal Proofs of Functional BSP Programs , 2003, Parallel Process. Lett..

[3]  Frédéric Loulergue,et al.  Développement d'applications avec Objective CAML by E. Chailloux, P. Manoury and B. Pagano, O'Reilley, 2003 , 2004, Journal of functional programming.

[4]  Cosimo Laneve,et al.  Interaction Systems I: The theory of optimal reductions , 1994, Mathematical Structures in Computer Science.

[5]  Val Tannen,et al.  A typed pattern calculus , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

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

[7]  Delia Kesner,et al.  Expression Reduction Systems with Patterns , 2003, RTA.

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

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

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

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