| 基于Java多线程实现所有顶点间最短路径的并行算法 |
| |
| 引用本文： | 卢昌乐,陈勇. 基于Java多线程实现所有顶点间最短路径的并行算法[J]. 天津工业大学学报, 2006, 25(4): 67-69 |
| |
| 作者姓名： | 卢昌乐 陈勇 |
| |
| 作者单位： | 天津工业大学,计算机技术与自动化学院,天津,300160 |
| |
| 摘 要： | 提出了利用Java多线程来实现并行计算的构想，并以所有顶点对间的最短路径问题为例，对此构想进行了理论分析，最后通过实验证明了此构想的正确性．文中还依据Dijkstra算法的实现原理提出了一种新的所有顶点对间的并行算法，并且利用Java多线程技术对给出的并行算法进行了实现．
|
| 关 键 词： | 最短路径 所有顶点对间的最短路径 Dijkstra算法 并行算法 Java多线程 |
| 文章编号： | 1671-024X（2006）04-0067-03 |
| 收稿时间： | 2006-05-16 |
| 修稿时间： | 2006-05-16 |
Realization of most short-path parallel algorithm during all apexes based on Java multithreading |
| |
| LU Chang-le,CHEN Yong. Realization of most short-path parallel algorithm during all apexes based on Java multithreading[J]. Journal of Tianjin Polytechnic University, 2006, 25(4): 67-69 |
| |
| Authors: | LU Chang-le CHEN Yong |
| |
| Affiliation: | School of Computer Technology and Automation, Tianjin Polytechnic University, Tianjin 300160, China |
| |
| Abstract: | The conception of realizing the parallel computation by using the Java muhithreading is put forward, and by taking the most short-path question during all apexes as the examples, the theoretical analysis is carried on, and finally the conception accuracy is proved through experiments. Meanwhile, one kind of new parrallel algorithm during all apexes is proposed based on the Dijkstra algorithm realization principle, and the parallel algorithm which has been produced is realized by using the Java muhithreading technology. |
| |
| Keywords: | most short-path all apexes to most short-path Dijkstra algorithm parallel algorithm Java muhithreading |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
