Name
Abstract | ||
|---|---|---|
When developing high performance algorithms blocking is a standard procedure to increase the locality of reference. Conflicting factors which influence the choice of blocking parameters are described in this paper. These factors include cache size, load balancing, memory overhead, algorithmic issues, and others. Optimal block sizes can be determined with respect to each of these factors. The resulting block sizes are independent of each other and can be implemented in several levels of blocking within a program. A tridiagonalization algorithm serves as an example to illustrate various blocking techniques. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1007/3-540-49164-3_13 | ACPC |
Keywords | Field | DocType |
standard procedure,conflicting factor,load balancing,optimal block size,tridiagonalization algorithm,memory overhead,cache size,high performance,resulting block size,numerical software,algorithmic issue,blocking techniques,load balance | Block size,Locality of reference,Memory hierarchy,Computer simulation,Load balancing (computing),CPU cache,Computer science,Parallel algorithm,Parallel computing,Numerical analysis | Conference |
Volume | ISSN | ISBN |
1557 | 0302-9743 | 3-540-65641-3 |
Citations | PageRank | References |
0 | 0.34 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wilfried N. Gansterer | 1 | 311 | 35.07 |
| Dieter F. Kvasnicka | 2 | 17 | 3.16 |
| Christoph W Ueberhuber | 3 | 109 | 15.89 |