Analyze reuse distance for multithreaded sparse iterative solver

Finding the behavior of application programs has been studied by many researchers to improve the performance. Especially, reuse distance, number of distinct data element between two adjacent references to a data element, has been studied by many researchers since reuse distance is independent of hardware architecture configurations. However, with the advent of multicore architectures, predicting the behavior based on reuse distance becomes much more difficult. In this paper, we explore the reuse distance of a multithreaded sparse iterative solver on multicore architecture to predict the behavior. Experiment results show that we can use reuse distance of a multithreaded sparse iterative solver on multicore architectures to predict the behavior.