2 papers
cs.CC2024
Tightening I/O Lower Bounds through the Hourglass Dependency Pattern
Lionel Eyraud-Dubois, Guillaume Iooss, Julien Langou +1
When designing an algorithm, one cares about arithmetic/computational complexity, but data movement (I/O) complexity plays an increasingly important role that highly impacts perfor…
cs.DC2014
Parallel scheduling of task trees with limited memory
Lionel Eyraud-Dubois, Loris Marchal, Oliver Sinnen +1
This paper investigates the execution of tree-shaped task graphs using multiple processors. Each edge of such a tree represents some large data. A task can only be executed if all…