The fusion machine

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.

@InProceedings{glw02_fm_eabs,
  author = "Philippa Gardner and Cosimo Laneve and Lucian Wischik",
  title  = "The Fusion Machine (extended abstract)",
  booktitle = "CONCUR 2002",
  year   = 2002,
  editor = "L. Brim and P. Jancar and M. Kretinsky",
  volume = "2421",
  series = "Lecture Notes in Computer Science",
  pages  = "418--433",
  publisher = "Springer-Verlag",
  url    = "http://www.wischik.com/lu/research/fm.html",
}