Optimal grain size computation for pipelined algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1123, Issue , 1996, Pages 165-172

  Desprez, Frédéric ^a   Ramet, Pierre ^b   Roman, Jean ^b  

^a UNIVERSITÉ DE LYON   (France)

^b UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

Communications overlap; Optimal packet size computation; Pipelined algorithms

Indexed keywords

GRAIN SIZE; LU FACTORIZATION; OPTIMAL PACKET SIZES; PARALLEL COMPUTER; PERFORMANCE MEASURE; PIPELINED ALGORITHMS; THEORETICAL MODELING;

PIPELINES;

EID: 84955594716     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61626-8_21     Document Type: Conference Paper

References (11)

1. T. Brandes and F. Desprez. Implementing Pipelined Computation and Communication in an HPF Compiler. Submitted to Europar’96, 1996.
2. J. Choi, J. Demmel, I. Dhillon, J. Dongarra, S. Ostrouchov, A. Petitet, K. Stanley, D. Walker, and R.C. Whaley. LAPACK Working Note: ScaLAPACK: A Portable Linear Algebra Library for Distributed Memory Computers - Design Issues and Performances. Technical Report 95, Department of Computer Science - University of Tennessee, 1995.
3. F. Desprez. A Library for Coarse Grain Macro-Pipelining in Distributed Memory Architectures. In IFIP 10.3 Conference on Programming Environments for Massively Parallel Distributed Systems, pages 365-371. Birkhaeuser Verlag AG, Basel, Switzerland, 1994.
4. F. Desprez. Procédures de Base pour le Calcul Scientifique sur Machines Parallèles à Mémoire Distribuée. PhD thesis, Institut National Polytechnique de Grenoble, January 1994. LIP ENS-Lyon.
5. F. Desprez, P. Ramet, and J. Roman. Optimal grain size computation for pipelined algorithms. Technical report, Laboratoire Bordelais de Recherche en Informatique, 1996.
6. F. Desprez and B. Tourancheau. LOCCS: Low Overhead Communication and Computation Subroutines. Future Generation Computer Systems, 10(2&3):279-284, June 1994.
7. B. Tourancheau M. Pourzandi. Recouvrement Calcul/Communication dans l’Elimination de Gauss sur un iPSC/960. Technical report, Ecole Normal Supérieure de Lyon, 1992.
8. H. Ohta, Y. Saito, M. Kainaga, and H. Ono. Optimal Tile Size Adjustement in Compiling General DOACROSS Loop Nests. In ACM Press, editor, International Conference on Supercomputing, pages 270-279, Barcelona, Spain, July 1995. ACM SIGARCH.
9. Y. Saad. Communication Complexity of the Gaussian Elimination Algorithm on Multiprocessors. Linear Algebra and Applications, 77:315-340, 1986.
10. B.S. Siegel and P.A. Steenkiste. Controlling Application Grain bize on a Network of Workstations. In Supercomputing’95, 1995.
11. C.W. Tseng. An Optimizing Fortran D Compiler for MIMD Distnbuted- Memory Machines. PhD thesis, Rice University, January 1993.