Improving Random Walk Performance
|Title||Improving Random Walk Performance|
|Publication Type||Conference Paper|
|Year of Publication||2009|
|Authors||Safro, I, Hovland, PD, Shin, J, Strout, MM|
Random walk simulation is employed in many experimental algorithmic applications. Ecient execution on modern computer architectur es 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.