A FUNCTIONAL LANGUAGE FOR DEPARTMENTAL METACOMPUTING

We have designed a functional data-parallel language called BSML for programming bulk synchronous parallel (BSP) algorithms. Deadlocks and indeterminism are avoided and the execution time can be then estimated. For very large scale applications more than one parallel machine could be needed. One speaks about metacomputing. A major problem in programming application for such architectures is their hierarchical network structures: latency and bandwidth of the network between parallel nodes could be orders of magnitude worse than those inside a parallel node. Here we consider how to extend both the BSP model and BSML, well-suited for parallel computing, in order to obtain a model and a functional language suitable for metacomputing.

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

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

[3]  Kees Verstoep,et al.  Network performance-aware collective communication for clustered wide-area systems , 2001, Parallel Comput..

[4]  Francisco Almeida,et al.  Predicting the execution time of message passing models , 1999, Concurr. Pract. Exp..

[5]  Hojung Cha,et al.  H-BSP: A Hierarchical BSP Computation Model , 2001, The Journal of Supercomputing.

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

[7]  Chris J. Scheiman,et al.  LogGP: incorporating long messages into the LogP model—one step closer towards a realistic model for parallel computation , 1995, SPAA '95.

[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]  Jean-François Méhaut,et al.  Madeleine II: a portable and efficient communication library for high-performance cluster computing , 2002, Parallel Comput..

[10]  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.

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

[12]  Guillaume Mercier,et al.  Madeleine II: a portable and efficient communication library for high-performance cluster computing , 2000, Proceedings IEEE International Conference on Cluster Computing. CLUSTER 2000.

[13]  Henri E. Bal,et al.  Sensitivity of parallel applications to large differences in bandwidth and latency in two-layer interconnects , 1999, Proceedings Fifth International Symposium on High-Performance Computer Architecture.

[14]  Daniel Le Métayer,et al.  ACE: an automatic complexity evaluator , 1988, TOPL.

[15]  David K. Gifford,et al.  Static dependent costs for estimating execution time , 1994, LFP '94.

[16]  Zsolt Németh,et al.  Characterizing Grids: Attributes, Definitions, and Formalisms , 2003, Journal of Grid Computing.

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

[18]  Franck Cappello,et al.  HiHCoHP-Toward a realistic communication model for hierarchical hyperclusters of heterogeneous processors , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[19]  Frédéric Gava,et al.  Design of Departmental Metacomputing ML , 2004, International Conference on Computational Science.

[20]  Tiffani L. Williams,et al.  Exploiting hierarchy in heterogeneous environments , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[21]  Viktor K. Prasanna,et al.  Adaptive Communication Algorithms for Distributed Heterogeneous Systems , 1999, J. Parallel Distributed Comput..

[22]  Arnold L. Rosenberg,et al.  Optimal Sharing of Partitionable Workloads in Heterogeneous Networks of Workstations , 2000, PDPTA.

[23]  Jeremy M. R. MARTIN,et al.  BSP Modelling of Two-Tiered Parallel Architectures , 1999 .

[24]  Amotz Bar-Noy,et al.  Designing broadcasting algorithms in the postal model for message-passing systems , 2005, Mathematical systems theory.

[25]  Chris Okasaki,et al.  Purely functional data structures , 1998 .

[26]  Xavier Leroy.  The objective caml system release 3 , 2001 .

[27]  Olaf Bonorden,et al.  The Paderborn University BSP (PUB) library , 2003, Parallel Comput..

[28]  John B. Shoven,et al.  I , Edinburgh Medical and Surgical Journal.

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

[30]  Frédéric Loulergue,et al.  A static analysis for Bulk Synchronous Parallel ML to avoid parallel nesting , 2005, Future Gener. Comput. Syst..

[31]  Coromoto León,et al.  Predicting the performance of parallel programs , 2004, Parallel Comput..

[32]  Dhabaleswar K. Panda,et al.  Efficient collective communication on heterogeneous networks of workstations , 1998, Proceedings. 1998 International Conference on Parallel Processing (Cat. No.98EX205).

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