Minimizing I/Os in Out-of-Core Task Tree Scheduling
Lists
Only you see this
Abstract
Scientific applications are usually described using directed acyclic graphs, where nodes represent tasks and edges represent dependencies between tasks. For some applications, this graph is a tree:...
BibTeX
@article{marchal2022minimizing,
author = {Loris Marchal and Samuel McCauley and Bertrand Simon and Frédéric Vivien},
title = {{Minimizing I/Os in Out-of-Core Task Tree Scheduling}},
journal = {International Journal of Foundations of Computer Science},
year = {2022},
doi = {10.1142/s0129054122500186},
}Loading related content...