Open AccessA Makespan Lower Bound for the Scheduling of the Tiled Cholesky Factorization based on ALAP Schedule
Author(s) -
Olivier Beaumont,
Julien Langou,
Willy Quach,
Alena Shilova
Publication year - 2020
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - cholesky decomposition , job shop scheduling , schedule , scheduling (production processes) , computer science , parallel computing , factorization , mathematical optimization , upper and lower bounds , mathematics , algorithm , operating system , mathematical analysis , eigenvalues and eigenvectors , physics , quantum mechanics