Synthesis of space-time optimal systolic algorithms for the Cholesky factorization

Synthesis of space-time optimal systolic algorithms for the Cholesky factorization

In this paper we study the synthesis of space-time optimal systolic arrays for the Cholesky Factorization (CF). First, we discuss previous allocation methods and their application to CF. Second, stemming from a new allocation method we derive a space-time optimal array, with nearest neighbor connect...

Full description

Bibliographic Details
Main Author: Clémentin Tayou Djamegni
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2002-01-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
re-indexation
space-time complexity
parallel processing
projection methods
timing function
allocation function
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:https://dmtcs.episciences.org/305/pdf

Internet

https://dmtcs.episciences.org/305/pdf

Similar Items