Directory‐traverse‐cost‐based skew handling for parallel data access
Akitsugu Watanabe, Haruo Yokota · Systems and Computers in Japan · 2003
Abstract Techniques for load balancing by adjusting location of data are widely studied, because they are quite influential in improving the data‐access performance and the scalability of a parallel system. To make load balancing effective, distributed directory structures, methods for evaluating loads, and distributed control mechanism for handling skews are important. In this paper, we propose a distributed algorithm to evaluate loads precisely. It counts the loads of intermediate index nodes of a distributed directory, which were ignored in previous publications. We also propose a linear‐order distributed skew‐handling algorithm adopting the proposed load evaluation algorithm. We validate the effect of our load evaluation algorithm through simulations. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(14): 13–22, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/scj.10445