most citedA Makespan Lower Bound for the Scheduling of the Tiled Cholesky Factorization based on ALAP scheduling

4 citations · 4 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DC2015★ 4 cited

A Makespan Lower Bound for the Scheduling of the Tiled Cholesky Factorization based on ALAP scheduling

Willy Quach, Julien Langou

Due to the advent of multicore architectures and massive parallelism, the tiled Cholesky factorization algorithm has recently received plenty of attention and is often referenced b…