Memory access analysis and optimization approaches on splay trees

Authors:
Wei Jiang;Chen Ding;Roland Cheng
Affiliations:
University of Rochester, Rochester, New York;University of Rochester, Rochester, New York;University of Rochester, Rochester, New York
Venue:
LCR '04 Proceedings of the 7th workshop on Workshop on languages, compilers, and run-time support for scalable systems
Year:
2004

Citing 3
Cited 1

Self-adjusting binary search trees

Journal of the ACM (JACM)
Predicting whole-program locality through reuse distance analysis

PLDI '03 Proceedings of the ACM SIGPLAN 2003 conference on Programming language design and implementation
Array regrouping and structure splitting using whole-program reference affinity

Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation

A web personalizing technique using adaptive data structures: The case of bursts in web visits

Journal of Systems and Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Splay trees, a type of self-adjusting search tree, are introduced and analyzed. Since they have been widely used in search problems, any performance improvements will yield great benefits. First, the paper introduces some background about splay trees and memory hierarchies. Then, it presents two heuristic algorithms, based on research in reference affinity and data regrouping. These algorithms have good locality, reduce memory transfers, and decrease cache miss rates on different architectures. Finally, the paper evaluates the performance gain of these algorithms on random inputs and Spec2K benchmark programs.