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

DOI10.1142/s0129054122500186OpenAlexW2598969590MaRDI QIDQ6169958

Bertrand Simon, Samuel McCauley, Loris Marchal, 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

schedulingout-of-coreI/O minimizationtask tree

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
• A simple proof of optimality for the MIN cache replacement policy
• Generating random binary trees -- a survey
• Memory-optimal evaluation of expression trees involving large objects
• Robust Memory-Aware Mappings for Parallel Multifrontal Factorizations
• Cache-Oblivious Algorithms
• Direct Methods for Sparse Linear Systems
• The Role of Elimination Trees in Sparse Factorization
• On the storage requirement in the out-of-core multifrontal method for sparse factorization
• An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
• Single-Machine Scheduling with Precedence Constraints
• The Generation of Optimal Code for Arithmetic Expressions
• Benchmarking optimization software with performance profiles.

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