Termination Detection for Parallel Shortest Path Algorithms
暂无分享,去创建一个
[1] A. J. M. van Gasteren,et al. Derivation of a Termination Detection Algorithm for Distributed Computations , 1983, Inf. Process. Lett..
[2] G. Gallo,et al. SHORTEST PATH METHODS: A UNIFYING APPROACH , 1986 .
[3] Shing-Tsaan Huang,et al. A Fully Distributed Termination Detection Scheme , 1988, Inf. Process. Lett..
[4] Haris N. Koutsopoulos,et al. A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures , 1994, Transp. Sci..
[5] B. Golden. Shortest-Path Algorithms: A Comparison , 1975 .
[6] Michelle R. Hribar. Parallel traffic equilibrium applications , 1997 .
[7] D. Bertsekas,et al. Parallel asynchronous label-correcting methods for shortest paths , 1996 .
[8] Bruce L. Golden,et al. Technical Note - Shortest-Path Algorithms: A Comparison , 1976, Oper. Res..
[9] Michelle R. Hribar,et al. Balancing load versus decreasing communication: exploring the tradeoffs , 1996, Proceedings of HICSS-29: 29th Hawaii International Conference on System Sciences.
[10] Jean-Pierre Prost,et al. Synchronization and Load Unbalance Effects of Parallel Iterative Algorithms , 1989, ICPP.
[11] Jesper Larsson Träff,et al. An Experimental Comparison of two Distributed Single-Source Shortest Path Algorithms , 1995, Parallel Comput..
[12] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .