Temporal shortest paths: Parallel computing implementations

被引：16

作者：

Tremblay, N ^{[1
]}

Florian, M ^{[1
]}

机构：

[1] Univ Montreal, Ctr Rech Transportat, Montreal, PQ H3C 3J7, Canada

来源：

PARALLEL COMPUTING | 2001年 / 27卷 / 12期

关键词：

temporal shortest paths; parallel computing; PVM; multithreading;

D O I：

10.1016/S0167-8191(01)00107-7

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We explore two types of parallel computing implementations for three algorithms for computing temporal shortest paths on transportation networks. One implementation is done on a distributed network of SUN SPARC workstations using PVM and the other on a shared memory computing platform, a SUN SPARC server equipped with eight processors, using threads. Computational results obtained by using three networks originating from practice are presented. The shared memory computing platform is preferred for this application. (C) 2001 Elsevier Science B.V. All rights reserved.

引用

页码：1569 / 1609

页数：41