UWSpace is currently experiencing technical difficulties resulting from its recent migration to a new version of its software. These technical issues are not affecting the submission and browse features of the site. UWaterloo community members may continue submitting items to UWSpace. We apologize for the inconvenience, and are actively working to resolve these technical issues.
 

Graph Locality Prefetcher for Graph Database

Thumbnail Image

Files

Yin_Zhuoran.pdf (1.42 MB)

Date

2015-04-30

Authors

Yin, Zhuoran

Journal Title

Journal ISSN

Volume Title

Publisher

University of Waterloo

Abstract

This work presents a hardware prefetcher to improve the performance of accessing graph data representing large and complex networks. We represent complex networks as graphs, and queries amount to traversals on the graph. Unlike conventional memory hierarchies that exploit spatial and temporal locality, we observe that graph traversals do not necessarily exhibit these same notions of locality. This results in degraded performance of the memory hierarchy. Consequently, our hardware prefetcher exploits locality that is intrinsic to graph traversals, which we call graph-locality to improve the performance of the memory hierarchy. We design and evaluate our prototype using a micro-architectural simulator, and deploy benchmarks from GDBench that is oriented to evaluate the performance of graph database systems.

Description

Keywords

prefetching, graph-locality, embedded hardware

LC Keywords

Citation

URI

http://hdl.handle.net/10012/9291

Collections

Theses
Electrical and Computer Engineering