Automated generation of BSP automata

Abstract : Bulk-Synchronous Parallel (BSP) is a bridging model between abstract execution and concrete parallel architecture. In order to model BSP program executions Hains adapted the finite automata theory to the BSP paradigm by introducing BSP automata theory. Benefit provided by BSP automata is twofold: modeling BSP program control and parallelizing finite state automata. The lack of generation algorithm of BSP automata and the illusory lack of application of this theory has been preventing this theory from being used. We propose in this paper an algorithm that generates a BSP automaton recognizing a defined BSP language. In order to demonstrate the usefulness of BSP automata and help to design its use, two applications of the BSP automata theory are provided. The parallel recognition of an expression and debugging of a BSP program.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01319565
Contributor : Frédéric Loulergue <>
Submitted on : Friday, May 20, 2016 - 8:15:54 PM
Last modification on : Thursday, January 17, 2019 - 3:10:02 PM

Identifiers

  • HAL Id : hal-01319565, version 1

Collections

Citation

Thibaut Tachon, Gaétan Hains, Frédéric Loulergue, Chong Li. Automated generation of BSP automata. High Level Parallel Programming and Applications (HLPP), Jul 2016, Münster, Germany. ⟨hal-01319565⟩

Share

Metrics

Record views

144