Improving Random Walk Performance

Random walk simulation is employed in many experimental algorithmic applications. Efficient execution on modern computer architectures demands that the random walk be implemented to exploit data locality for improving the cache performance. In this research, we demonstrate how different one-dimensional data reordering functionals can be used as a preprocessing step for speeding the random walk runtime.

• Type: Conference
• Year: 2009
• Where: CSC
• Authors: Ilya Safro, Paul D. Hovland, Jaewook Shin, Michelle Mills Strout
• Keywords: CSC 2007, CSC 2009, Random Walk, Random Walk Runtime, Random Walk Simulation