PARALLEL AND DISTRIBUTED COMPUTATION OF SHORTEST ROUTES AND NETWORK EQUILIBRIUM MODELS

We present parallel computing implementations of the linear approximation method for solving the fixed demand network equilibrium problem. As the main computational task is that of computing shortest routes, the paper contains as well parallel computing implementations of a shortest routes algorithm. We use the PVM (Parallel Virtual Machine) environment for distributed computation on a network of 16 SUN SPARC Ultra 1 workstations operating under SOLARIS 2.4 and on a SUN SPARC Center 1000. Then we use the Solaris threads to develop a multithreading parallel implementation on the SUN SPARC Center 1000. Computational results are given for the road network of the cities of Winnipeg, Ottawa and Montreal. The results justify the benefits of the parallel computing implementation.

  • Availability:
  • Corporate Authors:

    Elsevier

    The Boulevard, Langford Lane
    Kidlington, Oxford  United Kingdom  OX5 1GB
  • Authors:
    • Florian, M
    • Chabini, I
    • Le Saux, E
  • Conference:
  • Publication Date: 1997

Language

  • English

Media Info

  • Features: Figures; References; Tables;
  • Pagination: p. 1259-64

Subject/Index Terms

Filing Info

  • Accession Number: 00767645
  • Record Type: Publication
  • ISBN: 0080429319
  • Report/Paper Numbers: Volume 3
  • Files: TRIS
  • Created Date: Aug 20 1999 12:00AM