期刊文献+

基于Java多线程实现所有顶点间最短路径的并行算法 被引量:1

Realization of most short-path parallel algorithm during all apexes based on Java multithreading
在线阅读 下载PDF
导出
摘要 提出了利用Java多线程来实现并行计算的构想,并以所有顶点对间的最短路径问题为例,对此构想进行了理论分析,最后通过实验证明了此构想的正确性.文中还依据Dijkstra算法的实现原理提出了一种新的所有顶点对间的并行算法,并且利用Java多线程技术对给出的并行算法进行了实现. 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.
作者 卢昌乐 陈勇
出处 《天津工业大学学报》 CAS 2006年第4期67-69,共3页 Journal of Tiangong University
关键词 最短路径 所有顶点对间的最短路径 DIJKSTRA算法 并行算法 JAVA 多线程 most short-path all apexes to most short-path Dijkstra algorithm parallel algorithm Java muhithreading
  • 相关文献

参考文献3

二级参考文献39

  • 1Casanova H, Dongarra J. Using Agent-based Software for Scientific :Computing in the NetSolve System[J]. Parallel Computing, 1998, 24:1777-1790.
  • 2Rauchwerger L. Run-time Parallelization:Its Time Has Come[J].Parallel Computing, 1998, 24: 527-556.
  • 3American National Standards Institute. ANSI Technical CommitteeX3H5. Parallel Processing Model for High-Level Programming Languages, 1993.
  • 4IEEE. POSIX P1003.4a: Threads Extension for Portable Operating Systems. Piscataway,NJ: IEEE Press, 1994.
  • 5OpenMP Standards Board. OpenMP: a Proposed Industry Standard API for Shared MemoryProgramming. 1997. http://www. openmp.org/openmp/mp-documents/paper/paper.Html.
  • 6Parallel Computing Forum. PCF: parallel Fortran extensions. Fortran Forum,1991,10(3):1.
  • 7Silicon Graphics, IRIS Power C User's Guide, Silicon Graphics Computer Systems,Mountain View, CA, 1989.
  • 8Tucker, L.W., Mainwaring, a. CMMD: active messages on the CM-5. Parallel Computing,1994,20(4):481-496.
  • 9Kolawa, A. Parasoft: a comprehensive approach to parallel and distributedcomputing. In: IEEE Computer Society, ed. Proceedings of the Workshop on ClusterComputing. Los Alamitos, CA: IEEE Press, 1992.
  • 10Pierce, P., Regnier, G. The paragon implementation of the NX message passinginterface. In: IEEE Computer Society, ed. Proceedings of the Scalable High-PerformanceComputing Conference. Los Alamitos, CA: IEEE Press, 1994, 184~190.

共引文献52

同被引文献12

  • 1蒋峰.Java多线程编程中线程生存期和优先级的探讨[J].计算机工程与设计,2004,25(5):785-787. 被引量:4
  • 2封玮,周世平.Java中的线程池及实现[J].计算机系统应用,2004,13(8):16-18. 被引量:7
  • 3印旻;王行彦.Java语言与面向对象程序设计[M]{H}北京:清华大学出版社,2007.
  • 4耿祥义;张跃平.Java程序设计精编教程[M]{H}北京:清华大学出版社,2010.
  • 5BRUCE ECKEL.Java编程思想[M]北京:机械工业出版社,2009.
  • 6胡伏湘;雷军环.Java程序设计实用教程[M]{H}北京:清华大学出版社,2009.
  • 7张亦辉;冯华;胡洁.Java面向对象程序设计[M]{H}北京:人民邮电出版社,2008.
  • 8席国庆.深入体验 Java项目开发[M]{H}北京:清华大学出版社,2011.
  • 9叶乃文;王丹.Java语言程序设计教程[M]{H}北京:机械工业出版社,2010.
  • 10霍斯特曼.Java核心技术卷Ⅱ:高级特性[M]{H}上海:上海大学出版社,2008.

引证文献1

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部