The Manchester prototype dataflow computer
Communications of the ACM - Special section on computer architecture
An empirical study of automatic restructuring of nonnumerical programs for parallel processors
IEEE Transactions on Computers
Speedup Versus Efficiency in Parallel Systems
IEEE Transactions on Computers
Partially asynchronous, parallel algorithms for network flow and other problems
SIAM Journal on Control and Optimization
PVM: a framework for parallel distributed computing
Concurrency: Practice and Experience
Some aspects of the parallel and distributed iterative algorithms—a survey
Automatica (Journal of IFAC)
Scalability of parallel algorithms for the all-pairs shortest-path problem
Journal of Parallel and Distributed Computing
Shortest path algorithms: a computational study with the C programming language
Computers and Operations Research
The design of a standard message passing interface for distributed memory concurrent computers
Parallel Computing - Special issue: message passing interfaces
Parallel shortest path auction algorithms
Parallel Computing
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
Parallel asynchronous label-correcting methods for shortest paths
Journal of Optimization Theory and Applications
Termination detection for parallel shortest path algorithms
Journal of Parallel and Distributed Computing
The emergence of the MPI message passing standard for parallel computing
Computer Standards & Interfaces
Distributed computation on graphs: shortest path algorithms
Communications of the ACM
Communicating sequential processes
Communications of the ACM
MPI: The Complete Reference
MPI-The Complete Reference, Volume 1: The MPI Core
MPI-The Complete Reference, Volume 1: The MPI Core
A Parallelization of Dijkstra's Shortest Path Algorithm
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Why Are PVM and MPI So Different?
Proceedings of the 4th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Shortest Path Algorithms: An Evaluation Using Real Road Networks
Transportation Science
Shortest Path Algorithms in Transportation models: classical and innovative aspects
Shortest Path Algorithms in Transportation models: classical and innovative aspects
IEEE Transactions on Software Engineering
Research on dynamic load balancing algorithms for parallel transportation simulations
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
A parallel fusion method for heterogeneous multi-sensor transportation data
MDAI'11 Proceedings of the 8th international conference on Modeling decisions for artificial intelligence
Hi-index | 0.00 |
This paper describes the parallel implementation of a transport network model. A 'Single-Program, Multiple Data' (SPMD) paradigm is employed using a simple data decomposition approach where each processor runs the same program but acts on a different subset of the data. The objective is to reduce the execution time of the model. The computationally intensive part of the model is within the assignment and simulation section and therefore this section is parallelised and executed using 1, 2, 4, 8 and 16 processors. The convergence, accuracy and performance of the parallel model are then assessed and compared to the linear implementation. The results indicate a performance increase of over 8 for the parallelised module and a speedup of 5 for the total model when the model is run using 16 processors. The efficiency, average parallelism and efficiency-execution time profile are also discussed. In the context of time savings with 16 processors compared with 1, the time saving on the IBM SP2 are of the order of 80%, and, compared to a linear implementation on a dual processor Intel machine are of the order of 86%.