Paper Info
Title
Solving Large-Scale Network Transportation Problems On A Cluster Of Workstations
Abstract
The main goal oi this paper is to show how a cluster of workstations can be efficiently used to solve large-scale network flow problems. More specifically, the attention has been focused on the linear minimum cost how problem, so far one of the most important among all network flow problems. For its solution, an efficient parallel algorithm that resembles the one proposed in [1] has been used. The results collected are very encouraging and underscore that good reduction in the execution time can be obtained by using distributed multicomputer.
Year
DOI
Venue
1997
10.1016/S0927-5452(98)80010-5
PARALLEL COMPUTING: FUNDAMENTALS, APPLICATIONS AND NEW DIRECTIONS
Keywords
Field
DocType
transportation problem
Flow network,Computer science,Parallel algorithm,Parallel computing,Workstation,Execution time,Minimum-cost flow problem,Distributed computing
Conference
Volume
ISSN
Citations 
12
Advances in Parallel Computing
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
P. Beraldi133427.07
L. Grandinetti2374.28
F. Guerriero3666.66