A Parallel Asynchronous Implementation of the e-relaxation Method for the Linear Minimum Cost Flow Problem

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.



Titolo: A Parallel Asynchronous Implementation of the e-relaxation Method for the Linear Minimum Cost Flow Problem
Autori: 
BERALDI, Patrizia
GUERRIERO, Francesca
Data di pubblicazione: 1997
Rivista: 
PARALLEL COMPUTING  
Handle: http://hdl.handle.net/20.500.11770/138331
Appare nelle tipologie:1.1 Articolo in rivista

File in questo prodotto:
Non ci sono file associati a questo prodotto.
Utilizza questo identificativo per citare o creare un link a questo documento:
http://hdl.handle.net/20.500.11770/138331
  • Citazioni
  • PubMed Central ND
  • Scopus
  • WOS

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
 
 
 
Powered by IRIS-about IRIS-Utilizzo dei cookie
Logo CINECA  Copyright © 2021