Matrix computations (3rd ed.)
LAPACK Users' guide (third ed.)
LAPACK Users' guide (third ed.)
An efficient list scheduling algorithm for time placement problem
Computers and Electrical Engineering
Analyzing the Energy-Time Trade-Off in High-Performance Computing Applications
IEEE Transactions on Parallel and Distributed Systems
List scheduling for jobs with arbitrary release times and similar lengths
Journal of Scheduling
Green Supercomputing Comes of Age
IT Professional
Updating an LU Factorization with Pivoting
ACM Transactions on Mathematical Software (TOMS)
Programming matrix algorithms-by-blocks for thread-level parallelism
ACM Transactions on Mathematical Software (TOMS)
Communications of the ACM
GREENCOMP '10 Proceedings of the International Conference on Green Computing
The International Exascale Software Project roadmap
International Journal of High Performance Computing Applications
Hi-index | 0.00 |
This paper analyzes the impact on power consumption of two DVFS-control strategies when applied to the execution of dense linear algebra operations on multi-core processors. The strategies considered here, prototyped as the Slack Reduction Algorithm (SRA) and the Race-to-Idle Algorithm (RIA), adjust the operation frequency of the cores during execution of a collection of tasks (in which many dense linear algebra algorithms can be decomposed) with a very different approach to save energy. A power-aware simulator, in charge of scheduling the execution of tasks to processor cores, is employed to evaluate the performance benefits of these power-control policies for two reference algorithms for the LU factorization, a key operation for the solution of linear systems of equations.