Name
Abstract | ||
|---|---|---|
Irregular applications based on sparse matrices are at the core of many important scientific computations. Since the importance of such applications is likely to increase in the future, high-performance parallel and distributed systems must provide adequate support for such applications. We characterize a family of irregular scientific applications and derive the demands they will place on the communication systems of future parallel systems. Running time of these applications is dominated by repeated sparse matrix vector product (SMVP) operations. Using simple performance models of the SMVP, we investigate requirements for bisection bandwidth, sustained bandwidth during each processing element (PE), burst bandwidth during block transfers, and block latencies for PEs under different assumptions about sustained computational throughput. Our model indicates that block latencies ar-e likely to be rile most problematic engineering challenge for future communication networks. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1109/HPCA.1998.650548 | HPCA |
Keywords | Field | DocType |
stress,application software,communication networks,parallel systems,communication system,performance engineering,scientific computing,parallel processing,finite element methods,parallel computing,computer architecture,computer science,sparse matrix,bandwidth,computations,throughput,distributed systems,systems analysis,sparse matrices,finite element analysis | Telecommunications network,Performance engineering,Computer science,Systems analysis,Parallel computing,Communications system,Bandwidth (signal processing),Bisection bandwidth,Throughput,Sparse matrix,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-8186-8323-6 | 8 | 0.66 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David R. O'hallaron | 1 | 1243 | 126.28 |
| jonathan richard shewchuk | 2 | 1860 | 137.92 |
| Thomas R. Gross | 3 | 2807 | 404.74 |