Abstract
With the rapid growth of grid computing, more and more data-intensive applications have been deployed in grid environments, which in turn increase the energy consumption in high-performance computing platforms. To address the issue of energy consumption optimisation when scheduling data-intensive workflows, a novel heuristic policy called 'minimal energy consumption path' is proposed. By using this heuristic, we devise two energy-aware algorithms which are deprived from two classical scheduling algorithms. Extensive experiments are conducted to investigate the performance of the proposed algorithms, and the results show that they can significantly reduce the data-accessing energy consumption. Also, the proposed algorithms show better adaptivity than conventional scheduling algorithms, especially when the system is in presence of large-scale workflows which involve highly intensive data-accessing operations.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computational Science and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
