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. Index Terms—data reordering, random walk, irregular memory access, cache performance. F

[1]  Jason Cong,et al.  Random walks for circuit clustering , 1991, [1991] Proceedings Fourth Annual IEEE International ASIC Conference and Exhibit.

[2]  FoussFrancois,et al.  Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation , 2007 .

[3]  Olivier Temam,et al.  Influence of cross-interferences on blocked loops: a case study with matrix-vector multiply , 1995, TOPL.

[4]  W. Jalby,et al.  To copy or not to copy: a compile-time technique for assessing when data copying should be used to eliminate cache conflicts , 1993, Supercomputing '93.

[5]  Uriel Feige,et al.  A Tight Lower Bound on the Cover Time for Random Walks on Graphs , 1995, Random Struct. Algorithms.

[6]  Leo Grady,et al.  Random Walks for Image Segmentation , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Jack J. Dongarra,et al.  A Portable Programming Interface for Performance Evaluation on Modern Processors , 2000, Int. J. High Perform. Comput. Appl..

[8]  Timothy A. Davis,et al.  The university of Florida sparse matrix collection , 2011, TOMS.

[9]  L. Asz.  Random Walks on Graphs: a Survey , 2022 .

[10]  David Harel,et al.  Clustering spatial data using random walks , 2001, KDD '01.

[11]  Sharad Malik,et al.  Cache miss equations: an analytical representation of cache misses , 1997, ICS '97.

[12]  Ilya Safro,et al.  Multilevel algorithms for linear ordering problems , 2009, JEAL.

[13]  David S. Johnson,et al.  Computers and Inrracrobiliry: A Guide ro the Theory of NP-Completeness , 1979 .

[14]  Marco Gori,et al.  A Random-Walk Based Scoring Algorithm Applied to Recommender Engines , 2006, WEBKDD.

[15]  Uriel Feige,et al.  A Tight Upper Bound on the Cover Time for Random Walks on Graphs , 1995, Random Struct. Algorithms.

[16]  Paul D. Hovland,et al.  Metrics and models for reordering transformations , 2004, MSP '04.

[17]  Monica S. Lam,et al.  The cache performance and optimizations of blocked algorithms , 1991, ASPLOS IV.

[18]  Jim Handy,et al.  The cache memory book , 1993 .

[19]  A. George,et al.  An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems , 1997, SIAM J. Matrix Anal. Appl..

[20]  François Fouss,et al.  Random-Walk Computation of Similarities between Nodes of a Graph with Application to Collaborative Recommendation , 2007, IEEE Transactions on Knowledge and Data Engineering.

[21]  Ilya Safro,et al.  Graph minimum linear arrangement by multilevel weighted edge contractions , 2006, J. Algorithms.

[22]  Bojan Mohar,et al.  Optimal linear labelings and eigenvalues of graphs , 1992, Discret. Appl. Math..

[23]  JOSEP DÍAZ,et al.  A survey of graph layout problems , 2002, CSUR.

[24]  Michael E. Wolf,et al.  Improving locality and parallelism in nested loops , 1992 .

[25]  Michael E. Wolf,et al.  The cache performance and optimizations of blocked algorithms , 1991, ASPLOS IV.

[26]  Francesco Romani,et al.  Heuristic Spectral Techniques for the Reduction of Bandwidth and Work-Bound of Sparse Matrices , 2001, Numerical Algorithms.

[27]  Karim Esseghir.  Improving data locality for caches , 1993 .

[28]  MartonosiMargaret,et al.  Precise miss analysis for program transformations with caches of arbitrary associativity , 1998 .

[29]  Sharad Malik,et al.  Precise miss analysis for program transformations with caches of arbitrary associativity , 1998, ASPLOS VIII.

[30]  Kathryn S. McKinley,et al.  Tile size selection using cache organization and data layout , 1995, PLDI '95.