Automated Generation of BSP Automata

Bulk-Synchronous Parallel (BSP) is a bridging model between abstract execution and concrete parallel architectures that retains enough information to model performance scalability. In order to mode...

[1]  Aart J. C. Bik,et al.  Pregel: a system for large-scale graph processing , 2010, SIGMOD Conference.

[2]  Gerhard Goos,et al.  Computer Science Today: Recent Trends and Developments , 1995 .

[3]  Alan Stewart,et al.  Barrier synchronisation: Axiomatisation and relaxation , 2004, Formal Aspects of Computing.

[4]  Jean Fortin,et al.  BSP-WHY: an intermediate language for deductive verification of BSP programs , 2010, HLPP '10.

[5]  Alan J. Hu,et al.  Protocol verification as a hardware design aid , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[6]  Lei Chen,et al.  Algebraic Laws for BSP Programming , 1996, Euro-Par, Vol. II.

[7]  Viktor K. Prasanna,et al.  Fast Regular Expression Matching Using FPGAs , 2001, The 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'01).

[8]  Djelloul Ziadi,et al.  An Optimal Parallel Algorithm to Convert a Regular Expression into its Glushkov Automaton , 1999, Theor. Comput. Sci..

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

[10]  Gaétan Hains,et al.  A bulk-synchronous parallel process algebra , 2007, Comput. Lang. Syst. Struct..

[11]  Frédéric Gava,et al.  BSP-Why: A Tool for Deductive Verification of BSP Algorithms with Subgroup Synchronisation , 2015, International Journal of Parallel Programming.

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

[13]  Pascal Caron,et al.  Characterization of Glushkov automata , 2000, Theor. Comput. Sci..

[14]  Gaetan Hains,et al.  Enumerated BSP Automata , 2017 .

[15]  Virginia Niculescu.  Formal Refinement of BSP Programs with Early Cost Evaluation , 2011, 2011 10th International Symposium on Parallel and Distributed Computing.

[16]  Frédéric Loulergue,et al.  Bulk Synchronous Parallel ML: Modular Implementation and Performance Prediction , 2005, International Conference on Computational Science.

[17]  Stefano Giordano,et al.  An improved DFA for fast regular expression matching , 2008, CCRV.

[18]  Javier Esparza,et al.  Reachability Analysis of Pushdown Automata: Application to Model-Checking , 1997, CONCUR.

[19]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[20]  Fernando Pereira,et al.  Weighted Automata in Text and Speech Processing , 2005, ArXiv.

[21]  Rob H. Bisseling,et al.  Parallel Scientific Computation , 2004 .

[22]  Anne Brüggemann-Klein.  Regular Expressions into Finite Automata , 1993, Theor. Comput. Sci..

[23]  David Gay,et al.  Barrier inference , 1998, POPL '98.

[24]  Frédéric Loulergue,et al.  A Parallel Virtual Machine for Bulk Synchronous Parallel ML , 2003, International Conference on Computational Science.

[25]  Jianguo Zhou,et al.  Generating C Code from LOGS Specifications , 2005, ICTAC.

[26]  Avery Ching,et al.  One Trillion Edges: Graph Processing at Facebook-Scale , 2015, Proc. VLDB Endow..