• Corpus ID: 7377289

Parallel implementation of a transport network model

@inproceedings{OCearbhaill2008ParallelIO,
  title={Parallel implementation of a transport network model},
  author={Eoin A. O'Cearbhaill and Margaret O’Mahony},
  year={2008},
  url={https://api.semanticscholar.org/CorpusID:7377289}
}
This paper describes the parallel implementation of a transport network model using a ‘SingleProgram, Multiple Data’ (SPMD) paradigm where each processor runs the same program but acts on a different subset of the data to reduce the execution time.

Figures and Tables from this paper

PVM: A Framework for Parallel Distributed Computing

The PVM system is a programming environment for the development and execution of large concurrent or parallel applications that consist of many interacting, but relatively independent, components. It

MPI: The Complete Reference

MPI: The Complete Reference is an annotated manual for the latest 1.1 version of the standard that illuminates the more advanced and subtle features of MPI and covers such advanced issues in parallel computing and programming as true portability, deadlock, high-performance message passing, and libraries for distributed and parallel computing.

Speedup Versus Efficiency in Parallel Systems

The tradeoff between speedup and efficiency that is inherent to a software system is investigated and it is shown that for any software system and any number of processors, the sum of the average processor utilization and the attained fraction of the maximum possible speedup must exceed one.

Fast parallel algorithm for all-pairs shortest path problem and its VLSI implementation

A new parallel algorithm to solve the all-pairs shortest path problem in a given graph which is considerably faster than the most recently published algorithm and has O(log/sup 2/ n) execution time and O(n log n) communication time compared to B.P. Sinha et al.'s implementation.

Implementing parallel shortest-paths algorithms

Two parallel versions of the Bellman-Ford-Moore algorithm for the single-source shortest-paths problem are implemented and the performance of these parallel programs are compared with a serial implementation of this algorithm developed by Cherkassky, Goldberg and Radzik.
...