Synthesis of space-time optimal systolic algorithms for the Cholesky factorization
Discrete mathematics & theoretical computer science, Tome 5 (2002).

Voir la notice de l'article provenant de la source Episciences

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.
@article{DMTCS_2002_5_a11,
     author = {Tayou Djamegni, Cl\'ementin},
     title = {Synthesis of space-time optimal systolic algorithms for the {Cholesky} factorization},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {5},
     year = {2002},
     doi = {10.46298/dmtcs.305},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.305/}
}
TY  - JOUR
AU  - Tayou Djamegni, Clémentin
TI  - Synthesis of space-time optimal systolic algorithms for the Cholesky factorization
JO  - Discrete mathematics & theoretical computer science
PY  - 2002
VL  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.305/
DO  - 10.46298/dmtcs.305
LA  - en
ID  - DMTCS_2002_5_a11
ER  - 
%0 Journal Article
%A Tayou Djamegni, Clémentin
%T Synthesis of space-time optimal systolic algorithms for the Cholesky factorization
%J Discrete mathematics & theoretical computer science
%D 2002
%V 5
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.305/
%R 10.46298/dmtcs.305
%G en
%F DMTCS_2002_5_a11
Tayou Djamegni, Clémentin. Synthesis of space-time optimal systolic algorithms for the Cholesky factorization. Discrete mathematics & theoretical computer science, Tome 5 (2002). doi : 10.46298/dmtcs.305. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.305/

Cité par Sources :