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.
Cite
CITATION STYLE
Abascal, P., Alonso, P., Cortina, R., Díaz, I., & Ranilla, J. (2004). Analyzing the efficiency of block-cyclic checkerboard partitioning in neville elimination. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3019, pp. 963–968). Springer Verlag. https://doi.org/10.1007/978-3-540-24669-5_124
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
