Active Objects for Coordinating BSP Computations (Short Paper)
Pages 220 - 230
Abstract
Among the programming models for parallel and distributed computing, one can identify two important families. The programming models adapted to data-parallelism, where a set of coordinated processes perform a computation by splitting the input data; and coordination languages able to express complex coordination patterns and rich interactions between processing entities. This article takes two successful programming models belonging to the two categories and puts them together into an effective programming model. More precisely, we investigate the use of active objects to coordinate BSP processes. We choose two paradigms that both enforce the absence of data-races, one of the major sources of error in parallel programming. This article explains why we believe such a model is interesting and provides a formal semantics integrating the notions of the two programming paradigms in a coherent and effective manner.
References
[1]
Agha G Actors: A Model of Concurrent Computation in Distributed Systems 1986 Cambridge MIT Press
[2]
Azadbakht Keyvan, de Boer Frank S., and Serbanescu Vlad Multi-Threaded Actors Electronic Proceedings in Theoretical Computer Science 2016 223 51-66
[3]
Baduel L et al. Cunha JC, Rana OF, et al. Programming, composing, deploying for the grid Grid Computing: Software Environments and Tools 2006 London Springer 205-229
[4]
Bisseling R Parallel Scientific Computation: A Structured Approach Using BSP and MPI 2004 Oxford OUP
[5]
Boer FD, Serbanescu V, Hähnle R, Henrio L, Rochas J, Din CC, Johnsen EB, Sirjani M, Khamespanah E, Fernandez-Reyes K, and Yang AM A survey of active object languages ACM Comput. Surv. 2017 50 76:1-76:39
[6]
Bonorden O, Juurlink B, von Otte I, and Rieping I The paderborn university BSP (PUB) library Parallel Comput. 2003 29 2 187-207
[7]
Caromel, D., Henrio, L., Serpette, B.P.: Asynchronous and deterministic objects. In: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2004, pp. 123–134. ACM, New York (2004)
[8]
Fernandez-Reyes K, Clarke D, and McCain DS Lluch Lafuente A and Proença J ParT: an asynchronous parallel abstraction for speculative pipeline computations Coordination Models and Languages 2016 Cham Springer 101-120
[9]
Gava, F., Fortin, J.: Formal semantics of a subset of the paderborn’s BSPlib. In: 2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies, pp. 269–276 (2008)
[10]
Hains, G.: Subset synchronization in BSP computing. In: PDPTA, vol. 98, pp. 242–246 (1998)
[11]
Halstead RH Jr Multilisp: a language for concurrent symbolic computation ACM Trans. Program. Lang. Syst. 1985 7 4 501-538
[12]
Henrio L, Huet F, and István Z De Nicola R and Julien C Multi-threaded active objects Coordination Models and Languages 2013 Heidelberg Springer 90-104
[13]
Hill JMD, McColl B, Stefanescu DC, Goudreau MW, Lang K, Rao SB, Suel T, Tsantilas T, and Bisseling RH BSPlib: the BSP programming library Parallel Comput. 1998 24 1947-1980
[14]
Suijlen, W.J., BISSELING, R.: BSPonMPI (2013). http://bsponmpi.sourceforge.net
[15]
Tesson J and Loulergue F Wyrzykowski R, Dongarra J, Karczewski K, and Wasniewski J Formal semantics of DRMA-style programming in BSPlib Parallel Processing and Applied Mathematics 2008 Heidelberg Springer 1122-1129
[16]
Thies W, Karczmarek M, and Amarasinghe S Horspool RN StreamIt: a language for streaming applications Compiler Construction 2002 Heidelberg Springer 179-196
[17]
Valiant LG A bridging model for parallel computation CACM 1990 33 8 103
Index Terms
- Active Objects for Coordinating BSP Computations (Short Paper)
Index terms have been assigned to the content through auto-classification.
Recommendations
H-BSP: A Hierarchical BSP Computation Model
This paper presents a new parallel computing model, called H-BSP, which adds a hierarchical concept to the BSP(Bulk Synchronous Parallel) computing model. An H-BSP program consists of a number of BSP groups which are dynamically created at run time and ...
Portable and Efficient Parallel Computing Using the BSP Model
The Bulk-Synchronous Parallel (BSP) model was proposed by Valiant as a standard interface between parallel software and hardware. In theory, the BSP model has been shown to allow the asymptotically optimal execution of architecture-independent software ...
Fully Scalable Fault-Tolerant Simulations for BSP and CGM
In this paper we consider general simulations of algorithms designed for fully operational BSP and CGM machines on machines with faulty processors. The BSP (or CGM) machine is a parallel multicomputer consisting of p processors for which a memory of n ...
Comments
Information & Contributors
Information
Published In
Jun 2018
279 pages
ISBN:978-3-319-92407-6
DOI:10.1007/978-3-319-92408-3
© IFIP International Federation for Information Processing 2018.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 18 June 2018
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 28 Jan 2025