Presentation 2001/10/5
A Directory-Traverse-Cost Based Technique for Handling Load Skews in Parallel Disks
AKITSUGU WATANABE, HARUO YOKOTA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Skew handling is one of the most important techniques for the performance and scalability of parallel database systems. The evaluation of load in each disk is a crucial factor to the skew handling. We propose a directory-traverse-cost based load-evaluation algorithm considering accesses for intermediate nodes in the distributed directory. We also porpose an O(|Disk#|)parallel skew handling algorithm using the proposed load-evaluation algorithm. We compare the convergence process and effectiveness of our load-evaluation algorithm with ordinary ones.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Fat-Btree / parallel disk / skew handling / search cost evaluation / load balancing / declustering
Paper # DE2001-110
Date of Issue

Conference Information
Committee DE
Conference Date 2001/10/5(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Data Engineering (DE)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Directory-Traverse-Cost Based Technique for Handling Load Skews in Parallel Disks
Sub Title (in English)
Keyword(1) Fat-Btree
Keyword(2) parallel disk
Keyword(3) skew handling
Keyword(4) search cost evaluation
Keyword(5) load balancing
Keyword(6) declustering
1st Author's Name AKITSUGU WATANABE
1st Author's Affiliation Department of Computer Science Graduate School of Information Science and Engineering in Tokyo Institute of Technology()
2nd Author's Name HARUO YOKOTA
2nd Author's Affiliation Department of Computer Science Graduate School of Information Science and Engineering in Tokyo Institute of Technology:Global Scientific Information & Computing Center in Tokyo Institute of Technology
Date 2001/10/5
Paper # DE2001-110
Volume (vol) vol.101
Number (no) 343
Page pp.pp.-
#Pages 8
Date of Issue