Improving spatial locality of programs via data mining

In most computer systems, page fault rate is currently minimized by generic page replacement algorithms which try to model the temporal locality inherent in programs. In this paper, we propose two algorithms, one greedy and the other stochastic, designed for program specific code restructuring as a means of increasing spatial locality within a program. Both algorithms effectively decrease average working set size and hence the page fault rate. Our methods are more effective than traditional approaches due to use of domain information. We illustrate the efficacy of our algorithms on actual data mining algorithms. Categories and Subject Descriptors H.2.8 [Database Management]: Database ApplicationsData Mining Keywords Program Locality, Code Restructuring, Page Clustering

• Type: Conference
• Year: 2003
• Where: KDD
• Authors: Karlton Sequeira, Mohammed Javeed Zaki, Boleslaw K. Szymanski, Christopher D. Carothers
• Keywords: Data Mining, Data Mining Algorithms, KDD 2003, Page Fault Rate, Page Replacement Algorithms