Computer Science – Programming Languages
Scientific paper
2010-02-04
EPTCS 17, 2010, pp. 17-29
Computer Science
Programming Languages
Scientific paper
10.4204/EPTCS.17.2
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.
Bejleri Andi
Hu Raymond
Yoshida Nobuko
No associations
LandOfFree
Session-Based Programming for Parallel Algorithms: Expressiveness and Performance does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Session-Based Programming for Parallel Algorithms: Expressiveness and Performance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Session-Based Programming for Parallel Algorithms: Expressiveness and Performance will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-154688