PARALLELIZATION OF THE CRITICAL PATH ALGO RITHM FOR A PARALLEL COMPUTER

Authors
MARRAKCHI M
Citation
M. Marrakchi, PARALLELIZATION OF THE CRITICAL PATH ALGO RITHM FOR A PARALLEL COMPUTER, RAIRO. Recherche operationnelle, 31(4), 1997, pp. 429-440
Citations number
10
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science
Journal title
RAIRO. Recherche operationnelle → ACNP
ISSN journal
03990559
Volume
31
Issue
4
Year of publication
1997
Pages
429 - 440
Database
ISI
SICI code
0399-0559(1997)31:4<429:POTCPA>2.0.ZU;2-G
Abstract
In this paper we consider parallelisation on a parallel computer with shared memory of the critical path algorithm for 2-steps graph with co nstant task cost. This graph occures in the parallelisation of block t riangular linear system resolution. We present the parallel execution time including the communication cost of the critical path algorithm, and rue theoretically and practically determine the optimal ,value of the black site which minimises the parallel execution time.