2013/02/26 by Peter Calvert, Alan Mycroft
Computer Science · #cs.DC #cs.PL
paper · pdf · doi:10.4204/eptcs.109.2
published as EPTCS 109, 2013, pp. 7-12 · In Proceedings PLACES 2012, arXiv:1302.5798
arxiv created 2013/02/26 · arxiv updated 2013/02/27
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.