Article

Formal semantics of DRMA-style programming in BSPlib

Authors:

Frédéric LoulergueAuthors Info & Claims

PPAM'07: Proceedings of the 7th international conference on Parallel processing and applied mathematics

Pages 1122 - 1129

Published: 09 September 2007 Publication History

Abstract

BSPlib is a programming library for C and Fortran which supports bulk synchronous parallelism (BSP). This paper is about a formal semantics for the DRMA programming style of the BSPlib library. The aim is to study the behavior of BSPlib programs and to propose some syntactic characterizations used to provide guarantees on semantic properties. This work is the basis for future tools dedicated to the validation of BSPlib programs.

References

[1]

Apt, K.R., Olderog, E.-R.: Verification of sequential and concurrent programs, 2nd edn. Springer, Heidelberg (1997).

Digital Library

[2]

Bougé, L.: Le modèle de programmation à parallélisme de données: une perspective sémantique. RAIRO Technique et Science Informatiques 12(5) (1993).

[3]

Chen, Y., Sanders, W.: Top-Down Design of Bulk-Synchronous Parallel Programs. Parallel Processing Letters 13(3), 389-400 (2003).

[4]

Gava, F.: Formal Proofs of Functional BSP Programs. Parallel Processing Letters 13(3), 365-376 (2003).

[5]

Gu, Y., Lee, B.-S., Cai, W.: JBSP: A BSP programming library in Java. Journal of Parallel and Distributed Computing 61(8), 1126-1142 (2001).

Digital Library

[6]

Hill, J.M.D., McColl., W.F., et al.: BSPlib: The BSP Programming Library. Parallel Computing 24, 1947-1980 (1998).

Digital Library

[7]

Jifeng, H., Miller, Q., Chen, L.: Algebraic laws for BSP programming. In: Fraigniaud, P., Mignotte, A., Bougé, L., Robert, Y. (eds.) Euro-Par 1996. LNCS, vol. 1123, pp. 359-368. Springer, Heidelberg (1996).

Digital Library

[8]

Lecomber, D.S.: Methods of BSP Programming. PhD thesis, Oxford University Computing Laboratory (July 1998).

[9]

Loulergue, F., Gava, F., Billiet, D.: Bulk Synchronous Parallel ML: Modular Implementation and Performance Prediction. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2005. LNCS, vol. 3515, pp. 1046-1054. Springer, Heidelberg (2005).

Digital Library

[10]

Miller, Q.: BSP in a Lazy Functional Context. In: Trends in Functional Programming, vol. 3, Intellect Books (May 2002).

Digital Library

[11]

Skillicorn, D.B., Hill, J.M.D., McColl, W.F.: Questions and Answers about BSP. Scientific Programming 6(3), 249-274 (1997).

[12]

Snir, M., Gropp, W.: MPI the Complete Reference. MIT Press, Cambridge (1998).

Digital Library

[13]

Stewart, A., Clint, M., Gabarró, J.: Axiomatic Frameworks for Developing BSPStyle Programs. Parallel Algorithms and Applications 14, 271-292 (2000).

[14]

Tesson, J., Loulergue, F.: Formal Semantics for the DRMA programming style subset of the BSPlib library. Technical report, LIFO, University of Orléans (to appear, November 2007).

[15]

Winskel, G.: The Formal Semantics of Programming Languages. Foundations of Computing Series. MIT Press, Cambridge (1993).

Digital Library

Cited By

Jakobsson ADabrowski FBousdira WHung CPapadopoulos G(2019)Safe usage of registers in BSPlibProceedings of the 34th ACM/SIGAPP Symposium on Applied Computing10.1145/3297280.3297421(1400-1407)Online publication date: 8-Apr-2019
https://dl.acm.org/doi/10.1145/3297280.3297421
Jakobsson A(2019)Automatic Cost Analysis for Imperative BSP ProgramsInternational Journal of Parallel Programming10.1007/s10766-018-0562-147:2(184-212)Online publication date: 15-May-2019
https://dl.acm.org/doi/10.1007/s10766-018-0562-1
Fortin JGava F(2015)Towards Mechanised Semantics of HPCProceedings of the ICA3PP International Workshops and Symposiums on Algorithms and Architectures for Parallel Processing - Volume 953210.1007/978-3-319-27161-3_20(222-237)Online publication date: 18-Nov-2015
https://dl.acm.org/doi/10.1007/978-3-319-27161-3_20

Formal semantics of DRMA-style programming in BSPlib
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language types
2. Theory of computation
  1. Models of computation
    1. Concurrency

Recommendations

Formal Semantics of a Subset of the Paderborn's BSPlib
PDCAT '08: Proceedings of the 2008 Ninth International Conference on Parallel and Distributed Computing, Applications and Technologies

PUB (Paderborn University BSPLib) is a C library supporting the development of Bulk-Synchronous Parallel (BSP) algorithms. The BSP model allows an estimation of the execution time, avoids deadlocks and indeterminism. This paper presents a formal ...
Data-Parallel Programming on MIMD Computers

The implementation of two compilers for the data-parallel programming language Dataparallel C is described. One compiler generates code for Intel and nCUBE hypercube multicomputers; the other generates code for Sequent multiprocessors. A suite of ...
Using B SP and Python to simplify parallel programming

Scientific computing is usually associated with compiled languages for maximum efficiency. However, in a typical application program, only a small part of the code is time-critical and requires the efficiency of a compiled language. It is often ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

PPAM'07: Proceedings of the 7th international conference on Parallel processing and applied mathematics

September 2007

1413 pages

ISBN:3540681051

Editors:
Roman Wyrzykowski
Czestochowa University of Technology, Institute of Computer and Information Science, Czestochowa, Poland
,
Konrad Karczewski
Czestochowa University of Technology, Institute of Computer and Information Science, Czestochowa, Poland
,
Jack Dongarra
University of Tennessee, Electrical Engineering and and Computer Science Department, Knoxville, TN
,
Jerzy Wasniewski
Technical University of Denmark, Department of Informatics and Mathematical Modelling, Lyngby, Denmark

Sponsors

Microsoft Corp.
Intel: Intel
Action S.A.
SIAM: Society for Industrial and Applied Mathematics
IBM Corporation

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 09 September 2007

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
1
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Jakobsson ADabrowski FBousdira WHung CPapadopoulos G(2019)Safe usage of registers in BSPlibProceedings of the 34th ACM/SIGAPP Symposium on Applied Computing10.1145/3297280.3297421(1400-1407)Online publication date: 8-Apr-2019
https://dl.acm.org/doi/10.1145/3297280.3297421
Jakobsson A(2019)Automatic Cost Analysis for Imperative BSP ProgramsInternational Journal of Parallel Programming10.1007/s10766-018-0562-147:2(184-212)Online publication date: 15-May-2019
https://dl.acm.org/doi/10.1007/s10766-018-0562-1
Fortin JGava F(2015)Towards Mechanised Semantics of HPCProceedings of the ICA3PP International Workshops and Symposiums on Algorithms and Architectures for Parallel Processing - Volume 953210.1007/978-3-319-27161-3_20(222-237)Online publication date: 18-Nov-2015
https://dl.acm.org/doi/10.1007/978-3-319-27161-3_20

View Options

View options

Figures

Tables

Media

View Table of Conten