O'Reilly logo

Operating Systems: Concurrent and Distributed Software Design by Tim Harris, Jean Bacon

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

23.2. Process groups

Many algorithms assume that a certain number of components are participating, indeed the algorithm may make use of the number of processes involved and their identities. Before such an algorithm commences we need to have a means of controlling group membership. Typical primitives for managing groups are as follows:

create(group-name, <list-of-processes>)
kill(group-name)
join(group-name, process)
leave(group-name, process)

The system may provide a 'group server' to which all these requests must be sent or it may be that join and leave may be sent to any member of the group. It would of course be necessary for a process to have the necessary access privilege to be able to kill a group.

It is necessary to specify whether communication ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required