DocumentCode :
2544621
Title :
Implementation of random walk algorithm by parallel computing
Author :
Cui Jiao ; Guo Jun ; Zhang Cangsong ; Chang Xiaojun
Author_Institution :
Dept. of Comput. Sci. & Technol., Northwest Univ., Xi´an, China
fYear :
2012
fDate :
29-31 May 2012
Firstpage :
2477
Lastpage :
2481
Abstract :
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.
Keywords :
VLSI; circuit analysis computing; computational complexity; integrated circuits; parallel programming; P/G network; PAD nodes; large scale integrated circuit; parallel computing; random walk algorithm; time complexity; Algorithm design and analysis; Approximation algorithms; Computers; Legged locomotion; Parallel processing; Probability; Program processors; algorithm design; parallel computing; random walk;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Fuzzy Systems and Knowledge Discovery (FSKD), 2012 9th International Conference on
Conference_Location :
Sichuan
Print_ISBN :
978-1-4673-0025-4
Type :
conf
DOI :
10.1109/FSKD.2012.6233917
Filename :
6233917
Link To Document :
بازگشت