CPS implementation of a BSP composition primitive with application to the implementation of algorithmic skeletons

References

• M. Alt, Using algorithmic skeletons for efficient grid computing with predictable performance, Ph.D. thesis, Universität Münster, 2007
   Google Scholar
• Appel , A.W. 1992 . Compiling with Continuations , Cambridge : Cambridge University Press .
   Google Scholar
• Aumor , M. , Arguello , F. , Lopez , J. , Plata , O. and Zapata , L. 2001 . A data-parallel formulation for divide-and-conquer algorithms . J. Comp. , 44 ( 4 ) : 303 – 320 .
   Google Scholar
• Bamha , M. and Exbrayat , M. 2003 . Pipelining a skew-insensitive parallel join algorithm . Parallel Process. Lett. , 13 ( 3 ) : 317 – 328 .
   Google Scholar
• Biagioni , E. , Cline , K. , Lee , P. , Okasaki , C. and Stone , C. 1998 . Safe-for-space threads in standard ml . High. Order Symbolic Comput. , 11 ( 2 ) : 209 – 225 .
   Google Scholar
• Bisseling , R.H. 2004 . Parallel Scientific Computation. A Structured Approach using BSP and MPI , Oxford : Oxford University Press .
   Google Scholar
• Bonorden , O. , Juurlink , B. , Otte , I.V. and Rieping , O. 2003 . The Paderborn university BSP (PUB) library . Parallel Comput. , 29 ( 2 ) : 187 – 207 .
   Google Scholar
• Bonorden , O. , Gehweiler , J. and auf der Heide , F.M. 2006 . A Web Computing environment for parallel algorithms in java . Scalable Comput. Practice and Experience , 7 ( 2 ) : 1 – 14 .
   Google Scholar
• J. Chroboczek, Continuation passing for C: A space-efficient implementation of concurrency, Tech. rep., PPS (University of Paris 7) (2005)
   Google Scholar
• Clément , F. , Martin , V. , Vodicka , A. , Cosmo , R.D. and Weis , P. 2006 . Domain decomposition and skeleton programming with OCamlP3l . Parallel Comput. , 32 : 539 – 550 .
   Google Scholar
• Cole , M. 2004 . Bringing skeletons out of the closet: A pragmatic manifesto for skeletal parallel programming . Parallel Comput. , 30 ( 3 ) : 389 – 406 .
   Google Scholar
• Danvy , O. and Nielsen , L.R. 2005 . Cps transformation of beta-redexes . Inf. Process. Lett. , 94 ( 5 ) : 217 – 225 .
   Google Scholar
• Dargaye , Z. and Leroy , X. 2007 . “ Mechanized verification of CPS transformations ” . In Logic for Programming, Artificial Intelligence and Reasoning, (LPAR) , LNAI Vol. 4790 , 211 – 225 . Berlin : Springer .
   Google Scholar
• Dehne , F. 1999 . Special issue on coarse-grained parallel algorithms . Algorithmica , 14 : 173 – 421 .
   Google Scholar
• Falcou , J. , Serot , J. , Chateau , T. and Lapreste , J.T. 2006 . QUAFF: Efficient C++ design for parallel skeletons . Parallel Comput. , 32 ( 7–8 ) : 604 – 615 .
   Google Scholar
• I. Garnier and F. Gava, New implementation of a parallel composition primitive for a functionnal BSP language, Technical Report 5, LACL, University of Paris East (2008)
   Google Scholar
• Gava , F. 2005a . External memory in bulk synchronous parallel ML . Scalable Comput.: Practice and Experience , 6 ( 4 ) : 43 – 70 .
   Google Scholar
• F. Gava, Approches fonctionnelles de la programmation parallèle et des méta-ordinateurs; sémantiques, implantation et certification (2005b), Ph.D. thesis, University of Paris-East
   Google Scholar
• Gava , F. 2007 . “ Implementation of the parallel Superposition in bulk-synchronous parallel ML ” . In The International Conference on Computational Science (ICCS) , Part I, LNCS Edited by: Shi , Y. , Albada , G.D.v. , Dongarra , J. and Sloot , P.M.A. Vol. 4487 , 611 – 619 . Berlin : Springer-Verlag .
   Google Scholar
• Gava , F. 2008a . “ BSP functional programming; Examples of a cost based methodology ” . In ICCS , LNCS Edited by: Bubak , M. Vol. 5101 , 375 – 385 . Berlin : Springer-Verlag .
   Google Scholar
• Gava , F. 2008b . A modular implementation of parallel data structures in BSML . Parallel Process. Lett. , 18 ( 1 ) : 39 – 53 .
   Google Scholar
• Gava , F. and Loulergue , F. 2005 . A static analysis for bulk synchronous parallel ML to avoid parallel nesting . Future Generation Comput. Syst. , 21 ( 5 ) : 665 – 671 .
   Google Scholar
• L. Gesbert, Développement systématique et sureté d'exécution en programmation parallèle structurée (2009), Ph.D. thesis, University of Paris-East
   Google Scholar
• Gesbert , L. , Gava , F. , Loulergue , F. and Dabrowski , F. 2010 . Bulk synchronous parallel ML with exceptions . Future Generation Comput. Syst. , 26 ( 3 ) : 486 – 490 .
   Google Scholar
• A. Ghuloum, E. Sprangle, J. Fang, G. Wu, and X. Zhou, Ct: A flexible parallel programming model for tera-scale architectures, Technical report, Intel Research (2007)
   Google Scholar
• Gorlatch , S. 2004 . Send-receive considered harmful: Myths and realities of message passing . ACM TOPLAS , 26 ( 1 ) : 47 – 56 .
   Google Scholar
• GU , Y. , Le , B.-S. and Wentong , C. 2001 . Jbsp: A bsp programming library in java . J. Parallel Distrib. Comput. , 61 ( 8 ) : 1126 – 1142 .
   Google Scholar
• Heintze , N. 1995 . “ Control-flow analysis and type systems ” . In Static Analysis Symposium (SAS) , no. 983 in LNCS Edited by: Mycroft , A. Berlin : Springer .
   Google Scholar
• Herrmann , C.A. 2005 . Generating message-passing programs from abstract specifications by partial evaluation . Parallel Process. Lett. , 15 ( 3 ) : 305 – 320 .
   Google Scholar
• Hinsen , K. 2007 . Parallel scripting with Python . Comput. Sci. Eng. , 9 ( 6 ) : 82 – 89 .
   Google Scholar
• Kim , J. and Yi , K. “ Interconnecting between CPS terms and non-CPS terms ” . Edited by: Sabry , A. Technical Report, number 545, Computer Science Department, Indiana University, 2001
   Google Scholar
• E.A. Lee, The problem with threads, Technical Report UCB/EECS-2006-1, Electrical Engineering and Computer Sciences University of California at Berkeley (2006)
   Google Scholar
• Loulergue , F. 2003a . “ Parallel superposition for bulk synchronous parallel ML ” . In in ICCS , number 2659 in LNCS Edited by: Peter , M. Sloot , A. 223 – 232 . Springer .
   Google Scholar
• Loulergue , F. 2003b . “ Parallel superposition for bulk synchronous parallel ML ” . In ICCS , number 2669 in LNCS Edited by: Peter , M. and Sloot , A. Springer Verlag .
   Google Scholar
• Plotkin , G.D. 1975 . Call-by-name, call-by-value and the lambda-calculus . Theor. Comput. Sci. , 1 ( 2 ) : 125 – 159 .
   Google Scholar
• Pottier , F. and Rémy , D. 2005 . “ The essence of ML type inference ” . In Advanced Topics in Types and Programming Languages , chapter 10 Edited by: Pierce , B.C. 389 – 489 . Cambridge, MA : MIT Press .
   Google Scholar
• Shivers , O. 1997 . “ Continuations and threads: Expressing machine concurrency directly in advanced languages ” . In Second ACM SIGPLAN Workshop on Continuations
   Google Scholar
• Signoles , J. 2003 . “ Calcul statique des applications de modules paramétrés ” . In JFLA 21 – 36 .
   Google Scholar
• Skillicorn , D.B. , Hill , J.M.D. and McColl , W.F. 1997 . Questions and answers about BSP . Sci. Program. , 6 ( 3 ) : 249 – 274 .
   Google Scholar
• Snir , M. and Gropp , W. 1998 . MPI the Complete Reference , Cambridge, Mass : MIT Press .
   Google Scholar
• Srinivasan , S. 2006 . “ A thread of one's own ” . In New Horizons in Compilers Workshop
   Google Scholar
• Thielecke , H. 2003 . From control effects to typed continuation passing . ACM SIGPLAN Not. , 38 ( 1 ) : 139 – 149 .
   Google Scholar
• Tiskin , A. 2001 . A new way to divide and conquer . Parall. Proc. Lett. , 11 ( 4 ) : 409 – 422 .
   Google Scholar
• Wadler , P. 1994 . Monads and composable continuations . Lisp and Symbolic Comput. , 7 ( 1 ) : 39 – 56 .
   Google Scholar
• Wand , M. 1980 . “ Continuation-based multiprocessing ” . In Lisp Conference 19 – 28 . ACM
   Google Scholar