Name
Abstract | ||
|---|---|---|
In this paper we show how to analytically model two widely used distributed matrix-multiply algorithms, Cannon's 2D and Johnson's 3D, implemented within the Intel Concurrent Collections framework for shared/distributed memory execution. Our precise analytical model proceeds by estimating the computation time and communication times, taking into account factors such as the block size, communication bandwidth, processor's peak performance, etc. It then applies a roofline-based approach to determine the running time based on communication/computation bottleneck estimation.Our models are validated by comparing the estimations to the measured run times varying the problem size and work distribution, showing only marginal differences. We conclude by using our model to perform a predictive analysis on the impact of improving the computation speed by a factor of 4x. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/IPDPSW.2015.134 | 2015 IEEE 29TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS |
Keywords | Field | DocType |
Performance modeling, distributed computing, Intel Concurrent Collections | Block size,Bottleneck,Computer science,Parallel computing,Matrix decomposition,Distributed memory,Bandwidth (signal processing),Matrix multiplication,Computation,Estimator,Distributed computing | Conference |
Citations | PageRank | References |
1 | 0.35 | 17 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Kong | 1 | 89 | 6.18 |
| Louis-noël Pouchet | 2 | 880 | 47.61 |
| P. Sadayappan | 3 | 4821 | 344.32 |