期刊文献+

GIS的前k个最短路径分布式多线程实现 被引量:2

Distributed Multithreading Implementation of the K-th Shortest Paths Problem for GIS
下载PDF
导出
摘要 与求最短路径问题类似,求前k个最短路径问题也是一个经典的网络优化问题,并被广泛应用于实际。对求前k个最短路径问题的顺序算法和并行算法进行了研究,提出了一种基于ChandyandMisra算法的分布式多线程算法,并成功应用于基于Java实现的通信GIS系统中的自动电路调度。 The problem of listing the K-th shortest paths (for a given integer K >1) is a classical network programming problem as well as the shortest path problem. This paper researches two different types of algorithms: sequential algorithm and parallel algorithm, and puts forward a distributed multithreading algorithm based on Chandy and Misra algorithm, which is applied to the automatic circuit scheduling for the communication GIS system of optical cable.
作者 袁贞明 张量
出处 《计算机工程》 EI CAS CSCD 北大核心 2005年第9期37-38,162,共3页 Computer Engineering
关键词 最短路径 GIS 片行算法 线程 Shortest path GIS Parallel algorithm Thread
  • 相关文献

参考文献6

  • 1Fredman M L,Tarjan R E.Fibonacci Heaps and Their Uses in Improved Network Optimaization Algorithms.Journal of the ACM,1987,34(3): 596-615
  • 2Paige R C,Kruskal C P.Parallel Algorithm for Shortest Paths Poblems.1985: 14-20
  • 3Hoffman W,Pavley R.A Method of Solution of the Nth Best Path Problem.Journal of the ACM,1959,6: 506-514
  • 4Fox B L.Calculating Kth Shortest Paths.INFOR,Canadian Journal of Operational Research,1973,11(1): 66-70
  • 5Eppstein D.Finding the k Shortest Paths.SIAM Journal on Computing,1999,28(2): 652-673
  • 6Thulasiraman P,Tiao X M,Gao G R.Multithreading Implementation of a Distributed Shortest Path Algorithm on EARTH Multiprocessor.Proceedings of the 1996 International Conference on High- Performance Computing,1996: 336-340

同被引文献22

  • 1牛宝茹,刘俊蓉,王政伟.干旱半干旱地区植被覆盖度遥感信息提取研究[J].武汉大学学报(信息科学版),2005,30(1):27-30. 被引量:109
  • 2诸云强,贾萍,江东,李爽.国家资源环境遥感监测数据系统设计[J].吉首大学学报(自然科学版),2005,26(1):30-32. 被引量:4
  • 3黎刚.环境遥感监测技术进展[J].环境监测管理与技术,2007,19(1):8-11. 被引量:30
  • 4COHEN E.Efficient parallel shortest-paths in digraphs with a separator deeomposition[J].Algorithms, 1996(21 ) : 331-357.
  • 5TRAFF J L,ZAROLIAGIS C D.A simple parallel algorithm for the single2source shortest path problem on planar digraphs[J].Journal of Parallel and Distributed Computing, 2000,60(9) : 1103.
  • 6ADAMSON P,TICK E.Greedy partitionecd algorithms for the shortest path problem[J].International Journal of Parallel Programming, 1991 , 20 : 271-298.
  • 7TRAFF J L.An experimental comparison of two distributed single--source sbortest path algorithmns[J].Parallel Computing, 1995,21 : 1505-1532.
  • 8ROMEIJN H E, SMITH R L.Parallel algorithms for solving aggregated shortest path problems[D].The University of Michigan, September 1993.
  • 9BERTSEKAS D,GUERRIERO F,MUSMANNO R.Parallel asynchronous label-correcting methods for shortest paths[J] Journal of Optimization Theory and Applications, 1996,88: 297- 320.
  • 10Xu H. Modification of normalised difference water index (NDWI) to enhance open water features in remotely sensed imagery. International Journal of Remote Sensing, 2006, 27(14): 3025-3033.

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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