Art

J-GLOBAL ID：200902205932153621   Reference number：09A0595005

A Solution of the All-Pairs Shortest Paths Problem on the Cell Broadband Engine Processor

Cell Broadband Engineプロセッサでの全点対間最短路問題の解法

Author (2)： MATSUMOTO Kazuya (Univ. Aizu, Aizuwakamatsu-shi, JPN) ,  SEDUKHIN Stanislav G. (Univ. Aizu, Aizuwakamatsu-shi, JPN)
Material： IEICE Transactions on Information and Systems (Institute of Electronics, Information and Communication Engineers)  (IEICE Trans Inf Syst (Inst Electron Inf Commun Eng))
Volume： E92-D  Issue： 6  Page： 1225-1231  Publication year： Jun. 01, 2009 
JST Material Number： L1371A  ISSN： 0916-8532  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： *shortest route problem ,  graph theory ,  *microprocessor ,  heterocomputer system ,  computer algorithm ,  SIMD ,  memory hierarchy
Semi thesaurus term： *All-Pairs Shortest Paths problem ,  *multicore processor ,  Floyd Warshallアルゴリズム

JST classification (2)： Basics of graph theory  (IA02020S) ,  Digital computer systems in general  (JC02010O)

Reference (23)：

• BONDHUGULA, U. Hardware/software integration for FPGA-based all-pairs shortest-paths. Proc. 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, April 2006. 2006, 152-164
• FINK, E. A survey of sequential and systolic algorithms for the algebraic path problem. 1992
• FLOYD, R. W. Algorithm 97 : Shortest path. Commun. ACM. 1962, 5, 6, 345
• GAEKE, B. R. Memory-intensive benchmarks : IRAM vs. cache-based machines. Int'l Parallel and Distributed Processing Symposium, April 2002. 2002, 30-36
• GRIEM, G. Transitive closure on the imagine stream processor. Proc. Fifth Workshop on Media and Stream Processors (MSP-5), 2003. 2003

Terms in the title (4)： プロセッサ ,  点 ,  最短路問題 ,  解法