Minimizing I/Os in Out-of-Core Task Tree Scheduling

DOI10.1142/S0129054122500186MaRDI QIDQ6169958zbMATH OpenOpenAlexFDO

Authors Loris Marchal, Samuel McCauley, Bertrand Simon, Frédéric Vivien

Publication date 15 August 2023

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054122500186

zbMATH Keywords

I/O minimizationout-of-coreschedulingtask tree

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A fully asynchronous multifrontal solver using distributed dynamic scheduling
• A simple proof of optimality for the MIN cache replacement policy
• An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
• Benchmarking optimization software with performance profiles.
• Cache-oblivious algorithms
• Direct Methods for Sparse Linear Systems
• Generating random binary trees -- a survey
• scientific article; zbMATH DE number 1424322 (Why is no real title available?)
• Memory-optimal evaluation of expression trees involving large objects
• On the storage requirement in the out-of-core multifrontal method for sparse factorization
• Robust memory-aware mappings for parallel multifrontal factorizations
• Single-Machine Scheduling with Precedence Constraints
• The Generation of Optimal Code for Arithmetic Expressions
• The Role of Elimination Trees in Sparse Factorization

This page was built for publication: Minimizing I/Os in Out-of-Core Task Tree Scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169958)