Mapping the Join Calculus to Heterogeneous Hardware

Peter Calvert
(University of Cambridge Computer Laboratory)
Alan Mycroft
(University of Cambridge Computer Laboratory)

As modern architectures introduce additional heterogeneity and parallelism, we look for ways to deal with this that do not involve specialising software to every platform. In this paper, we take the Join Calculus, an elegant model for concurrent computation, and show how it can be mapped to an architecture by a Cartesian-product-style construction, thereby making use of the calculus' inherent non-determinism to encode placement choices. This unifies the concepts of placement and scheduling into a single task.

In Simon Gay and Paul Kelly: Proceedings Fifth Workshop on Programming Language Approaches to Concurrency- and Communication-cEntric Software (PLACES 2012), Tallinn, Estonia, 31 March 2012, Electronic Proceedings in Theoretical Computer Science 109, pp. 7–12.
Published: 23rd February 2013.

ArXived at: http://dx.doi.org/10.4204/EPTCS.109.2 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org