Parallélisation de l'algorithme du chemin critique pour une machine à mémoire partagée

M. Marrakchi

RAIRO - Operations Research - Recherche Opérationnelle (1997)

  • Volume: 31, Issue: 4, page 429-440
  • ISSN: 0399-0559

How to cite

top

Marrakchi, M.. "Parallélisation de l'algorithme du chemin critique pour une machine à mémoire partagée." RAIRO - Operations Research - Recherche Opérationnelle 31.4 (1997): 429-440. <http://eudml.org/doc/105159>.

@article{Marrakchi1997,
author = {Marrakchi, M.},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {parallel computer with shared memory},
language = {fre},
number = {4},
pages = {429-440},
publisher = {EDP-Sciences},
title = {Parallélisation de l'algorithme du chemin critique pour une machine à mémoire partagée},
url = {http://eudml.org/doc/105159},
volume = {31},
year = {1997},
}

TY - JOUR
AU - Marrakchi, M.
TI - Parallélisation de l'algorithme du chemin critique pour une machine à mémoire partagée
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1997
PB - EDP-Sciences
VL - 31
IS - 4
SP - 429
EP - 440
LA - fre
KW - parallel computer with shared memory
UR - http://eudml.org/doc/105159
ER -

References

top
  1. 1. A. GERASOULIS et T. YANG, Efficient Algorithms and a Software Tool for Scheduling Parallel Computation, in Scheduling Theory and its Applications, P. CHRETIENNE, E. G. COFFMAN Jr., J. K. LENSTRA et Z. Liu, John Wiley & Sons, 1995, p. 111-143. MR1376611
  2. 2. M. COSNARD, M. MARRAKCHI, Y. ROBERT et D. TRYSTRAM, Parallel Gaussian Elimination on an MIMD Computer, Parallel Computing, 1988, 6, p. 275-296. Zbl0634.65017MR928314
  3. 3. M. COSNARD, J. M. MULLER, Y. ROBERT et D. TRYSTRAM, Communication Costs Versus Computation Costs in Parallel Gaussian Elimination, in Parallel Algorithms & Architectures, M. COSNARD, P. QUINTON, Y. ROBERT et M. TCHUENTE, Proceedings of the International Workshop, Luminy, France, North-Holland, 1986, p. 19-29. Zbl0616.65034MR875487
  4. 4. M. COSNARD et D. TRYSTRAM, Algorithmes et architectures parallèles, InterEditions, 1993. 
  5. 5. M. J. DAYDE, I. S. DUFF, J. Y. L'EXCELLENT et L. GIRAUD, Évaluation d'ordinateurs vectoriels et parallèles sur un jeu de programmes représentatifs des calculs intensifs à la division avions de l'aérospatiale, Report FR/PA/93/19, April 1993. 
  6. 6. R. E. LORD, J. S. KOWALIK et S. P. KUMAR, Solving Linear Algebraic Equations on an MIMD Computer, J. A.C.M., 1983, 30, 1, p. 103-117. Zbl0502.65017MR694482
  7. 7. M. MARRAKCHI, Optimal Parallel Scheduling for the 2-steps Graph with Constant Task Cost, Parallel Computing, 1992, 18, p. 169-176. Zbl0741.68021
  8. 8. M. MARRAKCHI, Un algorithme parallèle optimal pour la résolution d'un système triangulaire, RAIRO Rech. Opér., 1993, 27, n° 3, p. 273-280. Zbl0798.65033MR1241862
  9. 9. N. M. MISSIRLIS, Scheduling Parallel Iterative Methods on Multiprocessor Systems, Parallel Computing, 1987, 5, p. 295-302. Zbl0626.65023MR916009
  10. 10. Y. ROBERT, The Impact of Vector and Parallel Architectures on the Gaussian Elimination Algorithm, Manchester University Press, 1990. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.