Close category search window
 

Implementation of random walk algorithm by parallel computing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Cui Jiao ; Dept. of Comput. Sci. & Technol., Northwest Univ., Xi'an, China ; Guo Jun ; Zhang Cangsong ; Chang Xiaojun

The basic concepts of random walk problem were introduced firstly. And then, the theoretical method for analyzing the large scale integrated circuit with random walk algorithm was discussed in detail. By analyzing the parallel features of random walk algorithm, the parallel computing technology was proposed to improve the efficiency of random walk algorithm. Time complexity and the main factors impacting the execution time of algorithm were analyzed as well. The experimental results show that the parallel random walk algorithm is an effective method to solve a large scale P/G network with less PAD nodes.

Published in:
Fuzzy Systems and Knowledge Discovery (FSKD), 2012 9th International Conference on

Date of Conference: 29-31 May 2012

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.