A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A Runtime Approach to Dynamic Resource Allocation for Sparse Direct Solvers
2014
2014 43rd International Conference on Parallel Processing
To face the advent of multicore processors and the ever increasing complexity of hardware architectures, programming models based on DAG-of-tasks parallelism regained popularity in the high performance, scientific computing community. In this context, enabling HPC applications to perform efficiently when dealing with graphs of parallel tasks that could potentially run simultaneously is a great challenge. Even if a uniform runtime system is used underneath, scheduling multiple parallel tasks
doi:10.1109/icpp.2014.57
dblp:conf/icpp/HugoGWN14
fatcat:chugulbzhfd7xgv5vnongaoi3e