By Topic

Improving Search Speed on Pointer-Based Large Data Structures Using a Hierarchical Clustering Copying Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Masahiro Yasugi ; Kyoto Univ., Kyoto ; Taiichi Yuasa

The increasing processor-memory performance gap makes improving the cache locality as important as the virtual memory locality. In many applications, especially in search algorithms on pointer-based large data structures, breadth-first copying algorithms increase cache misses, page faults and TLB misses. Since the depth-first copying only achieves limited locality improvement, several clustering copying algorithms have been proposed. In this paper, we propose "hierarchical clustering" which groups data objects at multiple hierarchical levels and provides better locality at both the cache and virtual memory levels of the memory hierarchy. We also propose a new copying algorithm for the hierarchical clustering, which uses multiple scan pointers and bounded workspace. Our copying algorithm almost always outperforms other algorithms; after copying, two representative microbenchmarks, employing a search tree and an array of associative lists, run approximately two (sometimes five) times faster than breadth-first copying.

Published in:

Innovative architecture for future generation high-performance processors and systems, 2007. iwia 2007. international workshop on

Date of Conference:

11-13 Jan. 2007