WoTUG - The place for concurrent processes

Paper Details

@InProceedings{WelchPedersen08,
  title = "{S}anta {C}laus - with {M}obile {R}eindeer and {E}lves",
  author= "Welch, Peter H. and Pedersen, Jan Bækgaard",
  editor= "Welch, Peter H. and Stepney, S. and Polack, F.A.C and Barnes, Frederick R. M. and McEwan, Alistair A. and Stiles, G. S. and Broenink, Jan F. and Sampson, Adam T.",
  pages = "455--455",
  booktitle= "{C}ommunicating {P}rocess {A}rchitectures 2008",
  isbn= "978-1-58603-907-3",
  year= "2008",
  month= "sep",
  abstract= "Mobile processes, along with mobile channels, enable
     process networks to be dynamic: they may change their size
     (number of processes, channels, barriers) and shape
     (connection topology) as they run much like living
     organisms. One of the benefits is that all connections do
     not have to be established statically, in advance of when
     they are needed and open to abuse. In classical occam, care
     had to be taken by processes not to use channels when they
     were not in the right state to use them. With occam-\π
     mobiles, we can arrange that processes simply do not have
     those channels until they get into the right state \–
     and not having such channels means that their misuse cannot
     even be expressed! Of course, it is a natural consequence of
     mobile system design that the arrivals of channels (or
     barriers or processes) are the very events triggering their
     exploitation. In our explorations so far with occam-\π,
     we have taken advantage of the mobility of data, channels
     and barriers and seen very good results. Very little work
     has been done with mobile processes: the ability to send and
     receive processes through channels, plug them into local
     networks, fire them up, stand them down and move them on
     again. This talk illustrates mobile process design through a
     solution to Trono's classical \textlessi\textgreaterSanta
     Claus Problem\textless/i\textgreater. The reindeer and elves
     are modeled as mobile processes that move through holiday
     resorts, stables, work, waiting rooms, Santa's Grotto and
     back again. All those destinations are also processes
     \– though static ones. As the reindeer and
     elves arrive at each stage, they plug in and do business. We
     will show the occam-\π mechanisms supporting mobile
     processes, confess to one weakness and consider remedies.
     The occam-\π solution did, of course, run correctly the
     first time it passed the stringent safety checks of the
     compiler and is available as open
     source (\textlesstt\textgreaterhttp://www.santaclausproblem.net\textless/tt\textgreater)."
}

If you have any comments on this database, including inaccuracies, requests to remove or add information, or suggestions for improvement, the WoTUG web team are happy to hear of them. We will do our best to resolve problems to everyone's satisfaction.

Copyright for the papers presented in this database normally resides with the authors; please contact them directly for more information. Addresses are normally presented in the full paper.

Pages © WoTUG, or the indicated author. All Rights Reserved.
Comments on these web pages should be addressed to: www at wotug.org

Valid HTML 4.01!