Abstract
We present a new model for the distributed implementation of pi-like calculi, which permits strong correctness results that are simple to prove. We describe the distributed channel machine— a distributed version of a machine proposed by Cardelli. The distributed channel machine groups pi processes at their channels (or locations), in contrast with the more common approach of incorporating additional location information within pi processes. We go on to describe the fusion machine. It uses a form of concurrent constraints called fusions— equations on channel names— to distribute fragments of these processes between remote channels. This fragmentation avoids the movement of large continuations between locations, and leads to a more efficient implementation model.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. Lévy. Explicit substitutions. Journal of Functional Programming, 1(4):375–416, 1991.
G. Berry and G. Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217–248, 1992.
L. Cardelli. An implementation model of rendezvous communication. In Seminar on Concurrency, LNCS 197:449–457, 1984.
S. Conchon and F. L. Fessant. Jocaml: Mobile agents for objective-caml. In ASA/MA’99, pages 22–29. IEEE, Computer Society Press.
C. Fournet and G. Gonthier. The reflexive chemical abstract machine and the join-calculus. In POPL’96, pages 372–385. ACM Press.
C. Fournet, J.-J. Lévy, and A. Schmitt.An asynchronous, distributed implementation of mobile ambients. InIFIP TCS 2000, LNCS 1872:348–364.
P. Gardner and L. Wischik. Explicit fusions. In MFCS 2000, LNCS 1893:373–382.
A. Giacalone, P. Mishra, and S. Prasad. FACILE: A symmetric integration of concurrent and functional programming. International Journal of Parallel Programming, 18(2):121–160, 1989.
C. Laneve, J. Parrow, and B. Victor. Solo diagrams. In TACS 2001, LNCS, 2215:127–144.
C. Laneve and B. Victor. Solos in concert. In ICALP’99, LNCS 1644:513–523.
C. Palamidessi. Comparing the expressive power of the synchronous and the asynchronous pi-calculus. In POPL’97, pages 256–265. ACM Press.
J. Parrow. Trios in concert. In Proof, Language and Interaction: Essays in Honour of Robin Milner, pages 621–637. MIT Press, 2000.
J. Parrow and B. Victor. The fusion calculus: Expressiveness and symmetry in mobile processes. In LICS’98, pages 176–185. IEEE, Computer Society Press.
B. C. Pierce and. N. Turner. Pict: A programming language based on the picalculus. In Proof, Language and Interaction: Essays in Honour of Robin Milner, pages 455–494. MIT Press, 2000.
P. Sewell. On implementations and semantics of a concurrent programming language. In CONCUR’97, LNCS 1243:391–405.
R. E. Tarjan. Efficiency of a good but not linear set union algorithm. Journal of the ACM, 22(2):215–225, 1975.
D. N. Turner. The Polymorphic Pi-Calculus: Theory and Implementation. PhD thesis, University of Edinburgh, 1996.
L. Wischik. Fusion machine prototype. http:// www.wischik.com/ lu/ research/ fusion-machine.
L. Wischik. Explicit Fusions: Theory and Implementation. PhD thesis, Computer Laboratory, University of Cambridge, 2001.
P. T. Wojciechowski. Nomadic Pict: Language and Infrastructure Design for Mobile Computation. PhD thesis, Computer Laboratory, University of Cambridge, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gardner, P., Laneve, C., Wischik, L. (2002). The Fusion Machine. In: Brim, L., Křetínský, M., Kučera, A., Jančar, P. (eds) CONCUR 2002 — Concurrency Theory. CONCUR 2002. Lecture Notes in Computer Science, vol 2421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45694-5_28
Download citation
DOI: https://doi.org/10.1007/3-540-45694-5_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44043-7
Online ISBN: 978-3-540-45694-0
eBook Packages: Springer Book Archive