Optimal Grain Size Computation for Pipelined Algorithms

Abstract : In this paper, we present a method for overlapping communications on parallel computers for pipelined algorithms. We first introduce a general theoretical model which leads to a generic computation scheme for the optimal packet size. Then, we use the OPIUM library, which provides an easy-to-use and efficient way to compute, in the general case, this optimal packet size, on the column $LU$ factorization; the implementation and performance measures are made on an Intel Paragon.
Keywords : Overlap
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00346485
Contributor : Pierre Ramet <>
Submitted on : Thursday, December 11, 2008 - 4:27:08 PM
Last modification on : Friday, May 3, 2019 - 1:30:33 AM

Identifiers

  • HAL Id : inria-00346485, version 1

Citation

Frédéric Desprez, Pierre Ramet, Jean Roman. Optimal Grain Size Computation for Pipelined Algorithms. Euro-Par'96, 1996, Lyon, France. pp.165-172. ⟨inria-00346485⟩

Share

Metrics

Record views

232