Directory‐traverse‐cost‐based skew handling for parallel data access

• Akitsugu Watanabe

• Haruo Yokota

抄録

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 (<jats:ext-link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="http://www.interscience.wiley.com">www.interscience.wiley.com ). DOI 10.1002/scj.10445

収録刊行物

• Systems and Computers in Japan

  Systems and Computers in Japan 34 (14), 13-22, 2003-10-14

  Wiley

キーワード

• Computational Theory and Mathematics
• Hardware and Architecture
• Information Systems
• Theoretical Computer Science

詳細情報

• CRID: 1362262945600145024
• NII論文ID: 30009831248
• DOI: 10.1002/scj.10445
• ISSN: 1520684X
• ISSN: 08821666
• Web Site: https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fscj.10445
• Web Site: https://onlinelibrary.wiley.com/doi/pdf/10.1002/scj.10445
• データソース種別:
  • Crossref
  • CiNii Articles