Re: [moca] all-you-can-eat calculi

[Pawel Wojciechowski <Pawel.Wojciechowski@xxxxxxx>]

Hi Martin,

> one input consumes as many outputs as possible in one go.

why only one, not all inputs on 'x' ?  :-)

> have already been studied. in particular, i'd like to hear
> about applications where this form of communication
> is natural. 

not sure if useful (probably not) but perhaps you might
think of distributed algorithms with unknown number
of processes (that can dynamically join/leave/crash/
migrate in ad-hoc networks etc.)

e.g. a distributed consensus algorithm accepts a number 
of outputs (each with a possibly different value) and 
completes by reducing some number of inputs (each input 
consumes exactly the _same_ value, chosen from those that
were output).

Both the number of inputs and outputs are initially unknown
since processes can crash at any time.

If you reduce the consensus problem to only one input, you 
may get the application of all-you-can-eat communication,
I guess. 

Distributed quorum systems may provide another example, 
but I'm not sure.

Pawel






  
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
The "models for mobility" mailing list     mailto:moca@xxxxxxxxxxxxxxx
 http://www-sop.inria.fr/mimosa/personnel/Davide.Sangiorgi/moca.html