In in Journal of Parallel and Distributed Computing Vol. 60, No. 12, December 2000, pp 1449-1479. Academic Press.
This paper describes a new design for the Light-Weight Group protocols that enables such service to function transparently. We discuss how these protocols can be applied in dynamic environments, where group mappings cannot be defined a priori and may change over time. We show that it is possible to establish mappings that promote resource sharing and, at the same time, minimize interference. These mappings can be established in an automated manner, using heuristics applied locally at each node. Experiments using an implementation in the Horus system show that significant performance improvements can be achieved with this approach.