[+] | [-]

Project Description

We implement and evaluate three algorithms: best PostOrder and Optimal algorithms by Liu, and MinMem algorithm.

Documentation

Coming soon.

Source Code

Download source code Download Source code

Related Papers

Mathias Jacquelin, Loris Marchal, Yves Robert and Bora Uçar. On optimal tree traversals for sparse matrix factorization. In IPDPS'2011, the 25th IEEE International Parallel and Distributed Processing Symposium, 2011, IEEE Computer Society Press.

[Bibtex]

Not available yet.
Download pdf Mathias Jacquelin, Loris Marchal, Yves Robert and Bora Uçar. On optimal tree traversals for sparse matrix factorization. Research report, RRLIP2010-30, LIP, ENS Lyon, 2010.

[Bibtex]

%% ensl-00527462, version 1
%% http://prunel.ccsd.cnrs.fr/ensl-00527462/en/
@unpublished{JACQUELIN:2010:ENSL-00527462:1,
HAL_ID = {ensl-00527462},
URL = {http://prunel.ccsd.cnrs.fr/ensl-00527462/en/},
title = { {O}n optimal tree traversals for sparse matrix factorization},
author = {{J}acquelin, {M}athias and {M}archal, {L}oris and {R}obert, {Y}ves and {U}{\c{c}}ar, {B}ora},
keywords = {{S}parse matrix factorization; {M}ultifrontal method; {A}ssembly tree; {T}ree traversal; {P}ostorder tree traversal; {I}/{O} minimization},
language = {{A}nglais},
affiliation = {{GRAAL} - {INRIA} {R}h{\^o}ne-{A}lpes / {LIP} {L}aboratoire de l'{I}nformatique du {P}arall{\'e}lisme - {CNRS} : {UMR}5668 - {INRIA} - {\'E}cole normale sup{\'e}rieure de {L}yon - {ENS} {L}yon - {U}niversit{\'e} {C}laude {B}ernard - {L}yon {I} - {L}aboratoire d'informatique du {P}arall{\'e}lisme - {L}aboratoire de l'{I}nformatique du {P}arall{\'e}lisme - {LIP} - {INRIA} - {CNRS} : {UMR}5668 - {U}niversit{\'e} {C}laude {B}ernard - {L}yon {I} - {\'E}cole normale sup{\'e}rieure de {L}yon - {ENS} {L}yon },
note = {12 pages {RRLIP}2010-30 },
URL = {http://prunel.ccsd.cnrs.fr/ensl-00527462/PDF/rr_io_complexity_on_trees.pdf},
}