The Community for Technology Leaders
Proceedings of IEEE International Conference on Distributed Computing Systems - ICDCS '93 (1993)
Pittsburgh, PA, USA
May 25, 1993 to May 28, 1993
ISBN: 0-8186-3770-6
pp: 178-185
A. Kumar , Cornell Univ., Ithaca, NY, USA
ABSTRACT
Recently, there has been considerable interest in the study of replica-control protocols which are based on organizing several copies of an object into logical structures, such as rectangular grids. In addition to high availability, another objective in exploiting such structures is to improve the degree of load sharing in a system. The authors extend the scope of grid structures to general grids, which allow holes in various positions of a rectangular structure and are useful to consider because they often produce availabilities that are higher than solid grids, where every position must be occupied by a node. In addition to proposing an improvement to the existing grid protocol, new insights are offered into the performance of the grids, from both availability and load sharing points of view. Algorithms for designing grids to maximize availability independently and also in conjunction with a load sharing constraint are given.<>
INDEX TERMS
data structures, distributed algorithms, distributed processing, performance evaluation, protocols, resource allocation
CITATION

A. Kumar, M. Rabinovich and R. Sinha, "A performance study of general grid structures for replicated data," Proceedings of IEEE International Conference on Distributed Computing Systems - ICDCS '93(ICDCS), Pittsburgh, PA, USA, , pp. 178-185.
doi:10.1109/ICDCS.1993.287710
92 ms
(Ver 3.3 (11022016))