Improving Random Walk Performance

13 years 5 months ago

Download www.mcs.anl.gov

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.

Ilya Safro, Paul D. Hovland, Jaewook Shin, Michell

Real-time Traffic

CSC 2007 | CSC 2009 | Random Walk | Random Walk Runtime | Random Walk Simulation |

claim paper

» Improving the Performance of the Random Walk Model for Answering Complex Questions

» Stereo matching using random walks

» Hybrid search schemes for unstructured peertopeer networks

» Recommending random walks

» Fast distributed random walks

» Grocery shopping recommendations based on basketsensitive random walk

» A random walk approach to sampling hidden databases

» Random Walk Inference and Learning in A Large Scale Knowledge Base

Post Info
More Details (n/a)

Added	09 Nov 2010
Updated	09 Nov 2010
Type	Conference
Year	2009
Where	CSC
Authors	Ilya Safro, Paul D. Hovland, Jaewook Shin, Michelle Mills Strout

Comments (0)

Sciweavers

Improving Random Walk Performance

CSC 2007 | CSC 2009 | Random Walk | Random Walk Runtime | Random Walk Simulation |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers