A comparative study of two wavefront implementations of a LU solver algorithm

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Cellular architectures may be used to achive speedup of certain algorithms. However, when there are several ways of mapping the same algorithm onto a cellular array producing approximately the same speedup other measures of effectiveness such as efficiency should be considered in order to compare the quality of different approaches. This paper presents two ways of mapping a LU-decomposition algorithm, both with the same speedup factor but with different efficiencies.

Cite

CITATION STYLE

APA

Humberto, J., & Romero, G. (1990). A comparative study of two wavefront implementations of a LU solver algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 457 LNCS, pp. 672–681). Springer Verlag. https://doi.org/10.1007/3-540-53065-7_143

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free