PARALLEL PROCESSING FOR NETWORK ANALYSIS - DECOMPOSING SHORTEST-PATH ALGORITHMS FOR MIMD COMPUTERS
Yuemin Ding, Paul J. Densham, Marc P. Armstrong · Iowa Research Online (The University of Iowa) · 1992
A classification scheme for spatial problems is presented and used to develop strategies for decomposing a popular shortest path algorithm into parallel processes. Several decompositions are implemented on a four-node Transputer Array, running in a host PC. Representative results are presented for shortest path problems with a range of network sizes and characteristics.