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
1997

Abstract

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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11770/138331
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 4
  • ???jsp.display-item.citation.isi??? 3
social impact