Bulk synchronous parallel ML: Semantics and implementation of the parallel juxtaposition

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3967 LNCS, Issue , 2006, Pages 475-486

  Loulergue, F ^a   Benheddi, R ^a   Gava, F ^b   Louis Regis D ^a  

^a UNIVERSITÉ D'ORLÉANS   (France)

^b UNIVERSITÉ PARIS EST CRÉTEIL   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33745890227     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11753728_48     Document Type: Conference Paper

References (23)

1. W. Bäumker, A. adn Dittrich and F. Meyer auf der Heide. Truly efficient parallel algorithms: c-optlmal multisearch for an extension of the BSP model. In 3rd European Symposium on Algorithms (ESA), pages 17-30, 1995.
2. Y. Bertot and P. Costéran. Interactive Theorem Proving and Progmm Development. Springer, 2004.
3. R. Bisseling. Parallel Scientific Computation. A structured approach using BSP and MPI. Oxford University Press, 2004.
4. O. Bonorden, B. Juurlink, I. von Otte, and O. Rieping. The Paderborn University BSP (PUB) library. Parallel Computing, 29(2):187-207, 2003.
5. O. Bonorden, F. Moyer auf der Heide, and R. Wanka. Composition of Efficient Nested BSP Algorithms: Minimum Spanning Tree Computation as an Instructive Example. In Proceedings of PDPTA, 2002.
6. E. Chailloux, P. Manoury, and B. Pagano. Développement d'applications avec Objective Caml. O'Reilly France, 2000.
7. P. de la Torre and C. P. Kruskal. Submachine locality in the bulk synchronous setting. In L. Bougé et al., eds., Euro-Par'96, LNCS 1123-1124, Springer, 1996.
8. F. Dehne. Special issue on coarse-grained parallel algorithms. Algorithmica, 14: 173-421, 1999.
9. F. Gava. Formal Proofs of Functional BSP Programs. Parallel Processing Letters, 13(3):365-376, 2003.
10. F. Gava. Approches fonctionnelles de la programmation parallèle et des métaordinateurs. Sémantiques, implantations et certification, PhD thesis, University Paris Val-de-Marne, LACL, 2005.
11. F. Gava and F. Loulergue. A Static Analysis for Bulk Synchronous Parallel ML to Avoid Parallel Nesting. Future Generation Computer Systems, 21(5):665-671, 2005.
12. G. Hains. Subset synchronization in BSP computing. In H.R.Arabnia, ed., Proceedings of PDPTA, vol. I, pages 242-246, CSREA Press, 1998.
13. J.M.D. Hill, W.F. McColl, and al. BSPlib: The BSP Programming Library. Parallel Computing, 24:1947-1980, 1998.
14. X. Leroy, D. Doligez, J. Garrigue, D. Rémy, and J. Vouillon. The Objective Caml System release 3.09, 2005. web pages at www.ocaml.org.
15. F. Loulergue. Parallel Composition and Bulk Synchronous Parallel Functional Programming. In S. Gilmore, ed., Trends in Functional Programming, Volume 2, pages 77-88. Intellect Books, 2001.
16. F. Loulergue. Parallel Juxtaposition for Bulk Synchronous Parallel ML. In H. Kosch et al., eds., Euro-Par 2003, LNCS 2790, pages 781-788, Springer, 2003.
17. F. Loulergue. Parallel Superposition for Bulk Synchronous Parallel ML. In Peter M. A. Sloot et al., eds., Proceedings of ICCS 2003, Part I, LNCS 2659, pages 223-232, Springer, 2003.
18. F. Loulergue, F. Gava, and D. Billiet. BSML: Modular Implementation and Performance Prediction. In Vaidy S. Sunderam et al., eds., Proceedings of ICCS 2005, Part II, LNCS 3515, pages 1046-1054, Springer, 2005.
19. J. M. R. Martin and A. Tiskin. BSP modelling a two-tiered parallel architectures. In B. M. Cook, ed., WoTUG'99, pages 47-55, 1999.
20. D. B. Skillicorn, J. M. D. Hill, and W. F. McColl. Questions and Answers about BSP. Scientific Programming, 6(3):249-274, 1997.
21. A. Tiskin. A New Way to Divide and Conquer. Parallel Processing Letters, (4), 2001.
22. Leslie G Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8): 103-111, August 1990.
23. A. Zavanella. Skeletons and BSP : Performance Portability for Parallel Programming. PhD thesis, Universita degli studi di Pisa, 1999.