Name
Title | ||
|---|---|---|
Analyzing the efficiency of block-cyclic checkerboard partitioning in Neville elimination |
Abstract | ||
|---|---|---|
In this paper we analyze the performance of the Neville method when a block-cyclic checkerboard partitioning is used. This partitioning can exploit more concurrency than the striped method because the matrix computation can be divided out among more processors than in the case of striping. Concretely, it divides the matrix into blocks and maps them in a cyclic way among the processors. The performance of this parallel system is measured in terms of efficiency, which in this case is close to one when the optimum block size is used and it is run on a Parallel PC Cluster. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/978-3-540-24669-5_124 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
matrix computation,parallel systems | Block size,Data striping,Computer science,Checkerboard,Concurrency,Matrix (mathematics),Parallel computing,Exploit,Numerical linear algebra | Conference |
Volume | ISSN | Citations |
3019 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 4 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Policarpo Abascal | 1 | 0 | 0.34 |
| Pedro Alonso | 2 | 24 | 3.96 |
| Raquel Cortina | 3 | 25 | 4.93 |
| Irene Díaz | 4 | 139 | 25.16 |
| José Ranilla | 5 | 242 | 29.11 |