hrcak mascot   Srce   HID

Izvorni znanstveni članak

Experimental Evaluation of a Parallel Max-Flow Algorithm

Goranka Nogo ; Department of Mathematics, University of Zagreb, Bijenicka 30, 10000 Zagreb, Croatia
Robert Manger   ORCID icon orcid.org/0000-0003-0953-6517 ; Department of Mathematics, University of Zagreb, Bijenicka 30, 10000 Zagreb, Croatia

Puni tekst: engleski, pdf (3 MB) str. 237-243 preuzimanja: 83* citiraj
APA 6th Edition
Nogo, G. i Manger, R. (1999). Experimental Evaluation of a Parallel Max-Flow Algorithm. Journal of computing and information technology, 7 (3), 237-243. Preuzeto s https://hrcak.srce.hr/150182
MLA 8th Edition
Nogo, Goranka i Robert Manger. "Experimental Evaluation of a Parallel Max-Flow Algorithm." Journal of computing and information technology, vol. 7, br. 3, 1999, str. 237-243. https://hrcak.srce.hr/150182. Citirano 24.02.2020.
Chicago 17th Edition
Nogo, Goranka i Robert Manger. "Experimental Evaluation of a Parallel Max-Flow Algorithm." Journal of computing and information technology 7, br. 3 (1999): 237-243. https://hrcak.srce.hr/150182
Harvard
Nogo, G., i Manger, R. (1999). 'Experimental Evaluation of a Parallel Max-Flow Algorithm', Journal of computing and information technology, 7(3), str. 237-243. Preuzeto s: https://hrcak.srce.hr/150182 (Datum pristupa: 24.02.2020.)
Vancouver
Nogo G, Manger R. Experimental Evaluation of a Parallel Max-Flow Algorithm. Journal of computing and information technology [Internet]. 1999 [pristupljeno 24.02.2020.];7(3):237-243. Dostupno na: https://hrcak.srce.hr/150182
IEEE
G. Nogo i R. Manger, "Experimental Evaluation of a Parallel Max-Flow Algorithm", Journal of computing and information technology, vol.7, br. 3, str. 237-243, 1999. [Online]. Dostupno na: https://hrcak.srce.hr/150182. [Citirano: 24.02.2020.]

Sažetak
The maximum flow problem has been studied for over forty years. One of the methods for solving this problem is the generic push-relabel algorithm. In this paper we develop a parallel version of this sequential algorithm. Our assumed model of computation is a shared-memory multiprocessor. We describe a concrete implementation of the algorithm based on the PVM package, and present the obtained numerical results.

Ključne riječi
network; maximum flow problem; parallel algorithm; PVM; experiment

Hrčak ID: 150182

URI
https://hrcak.srce.hr/150182

Posjeta: 151 *