In this paper we present a parallel asynchronous implementation of the e-relaxation method for solving the linear minimum cost flow problem on distributed memory message-passing multiprocessor systems. The general structure of the method is well suited to efficient parallelization, since a single iteration can be performed on several nodes simultaneously. We describe the implementation details of the parallel version on both a Fujitsu AP1000 and a clsuster of Digital Alpha workstations connected via FDDI links. The results obtained demonstrate that our implementation is capable of substantial speedups.
A Parallel Asynchronous Implementation of the e-relaxation Method for the Linear Minimum Cost Flow Problem / Beraldi, P.; Guerriero, Francesca. - In: PARALLEL COMPUTING. - ISSN 0167-8191. - 23(1997), pp. 1021-1044.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
Titolo: | A Parallel Asynchronous Implementation of the e-relaxation Method for the Linear Minimum Cost Flow Problem |
Autori: | |
Data di pubblicazione: | 1997 |
Rivista: | |
Citazione: | A Parallel Asynchronous Implementation of the e-relaxation Method for the Linear Minimum Cost Flow Problem / Beraldi, P.; Guerriero, Francesca. - In: PARALLEL COMPUTING. - ISSN 0167-8191. - 23(1997), pp. 1021-1044. |
Handle: | http://hdl.handle.net/20.500.11770/138331 |
Appare nelle tipologie: | 1.1 Articolo in rivista |