Safe parallel programming with session Java

Ng, N; Yoshida, N; Pernet, O; Hu, R; Kryftis, Y

dc.contributor.author	Ng, N	en
dc.contributor.author	Yoshida, N	en
dc.contributor.author	Pernet, O	en
dc.contributor.author	Hu, R	en
dc.contributor.author	Kryftis, Y	en
dc.date.accessioned	2014-03-01T02:53:27Z
dc.date.available	2014-03-01T02:53:27Z
dc.date.issued	2011	en
dc.identifier.issn	03029743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/36329
dc.subject.other	Communication topologies	en
dc.subject.other	Compile time	en
dc.subject.other	Deadlock freedom	en
dc.subject.other	Distributed programming	en
dc.subject.other	Effective tool	en
dc.subject.other	Mesh topologies	en
dc.subject.other	Multichannel communication	en
dc.subject.other	Multiple process	en
dc.subject.other	Parallel Computation	en
dc.subject.other	Programming language	en
dc.subject.other	Typing systems	en
dc.subject.other	Computational efficiency	en
dc.subject.other	Coordination reactions	en
dc.subject.other	Java programming language	en
dc.subject.other	Parallel algorithms	en
dc.subject.other	Parallel architectures	en
dc.subject.other	Pipeline codes	en
dc.subject.other	Semantics	en
dc.subject.other	Structured programming	en
dc.subject.other	Topology	en
dc.subject.other	Parallel programming	en
dc.title	Safe parallel programming with session Java	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1007/978-3-642-21464-6_8	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-642-21464-6_8	en
heal.publicationDate	2011	en
heal.abstract	The session-typed programming language Session Java (SJ) has proved to be an effective tool for distributed programming, promoting structured programming for communications and compile-time safety. This paper investigates the use of SJ for session-typed parallel programming, and introduces new language primitives for chained iteration and multi-channel communication. These primitives allow the efficient coordination of parallel computation across multiple processes, thus enabling SJ to express the complex communication topologies often used by parallel algorithms. We demonstrate that the new primitives yield clearer and safer code for pipeline, ring and mesh topologies through implementations of representative parallel algorithms. We then present a semantics and session typing system including the new primitives, and prove type soundness and deadlock-freedom for our implementations. The benchmark results show that the new SJ is substantially faster than the original SJ and performs competitively against MPJ Express used as reference. © 2011 Springer-Verlag.	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
dc.identifier.doi	10.1007/978-3-642-21464-6_8	en
dc.identifier.volume	6721 LNCS	en
dc.identifier.spage	110	en
dc.identifier.epage	126	en