×

The fusion machine (Extended abstract). (English) Zbl 1012.68527

Brim, Luboš (ed.) et al., CONCUR 2002 - concurrency theory. 13th international conference, Brno, Czech Republic, August 20-23, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2421, 418-433 (2002).
Summary: 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.
For the entire collection see [Zbl 0997.00031].

MSC:

68Q85 Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
PDFBibTeX XMLCite
Full Text: Link