Clémentin Tayou Djamegni - Synthesis of space-time optimal systolic algorithms for the Cholesky factorization

dmtcs:305 - Discrete Mathematics & Theoretical Computer Science, January 1, 2002, Vol. 5 -
Synthesis of space-time optimal systolic algorithms for the Cholesky factorizationArticle

Authors: Clémentin Tayou Djamegni 1

  • 1 Laboratoire d'Informatique [Dschang]

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 connections, that requires 3N + Θ (1) time steps and N^2/8 + Θ (N) processors, where N is the size of the problem. The number of processors required by this new design improves the best previously known bound, N^2/6 + Θ (N), induced by previous allocation methods. This is the first contribution of the paper. The second contribution stemms from the fact that the paper also introduces a new allocation method that suggests to first perform clever index transformations on the initial dependence graph of a given system of uniform recurrent equations before applying the weakest allocation method, the projection method.

Volume: Vol. 5
Published on: January 1, 2002
Imported on: March 26, 2015
Keywords: re-indexation,space-time complexity,parallel processing,projection methods,timing function,allocation function,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]

1 Document citing this article

Consultation statistics

This page has been seen 293 times.
This article's PDF has been downloaded 344 times.