Session-Based Programming for Parallel Algorithms: Expressiveness and Performance

Andi Bejleri
(Imperial College)
Raymond Hu
(Imperial College)
Nobuko Yoshida
(Imperial College)

This paper investigates session programming and typing of benchmark examples to compare productivity, safety and performance with other communications programming languages. Parallel algorithms are used to examine the above aspects due to their extensive use of message passing for interaction, and their increasing prominence in algorithmic research with the rising availability of hardware resources such as multicore machines and clusters. We contribute new benchmark results for SJ, an extension of Java for type-safe, binary session programming, against MPJ Express, a Java messaging system based on the MPI standard. In conclusion, we observe that (1) despite rich libraries and functionality, MPI remains a low-level API, and can suffer from commonly perceived disadvantages of explicit message passing such as deadlocks and unexpected message types, and (2) the benefits of high-level session abstraction, which has significant impact on program structure to improve readability and reliability, and session type-safety can greatly facilitate the task of communications programming whilst retaining competitive performance.

In Alastair R. Beresford and Simon Gay: Proceedings Second International Workshop on Programming Language Approaches to Concurrency and Communication-cEntric Software (PLACES 2009), York, UK, 22nd March 2009, Electronic Proceedings in Theoretical Computer Science 17, pp. 17–29.
Published: 6th February 2010.

ArXived at: http://dx.doi.org/10.4204/EPTCS.17.2 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org