Abstract
Energy efficiency and system reliability are the two main measurements in modern high-performance computing. The majority of previous recent studies have focused on realizing parallel task scheduling with low energy consumption or fast execution time. These approaches were developed with the classic scheduling model. However, the contention model is gaining increasing recognition as a more practical tool to create accurate and efficient schedules. This study proposes a contention-aware reliability management with deadline and energy budget constraints (CARMEB) algorithm for parallel task scheduling in heterogeneous computing systems. CARMEB involves three phases, namely, task priority calculation, communication edge allocation, and slack reclaiming. Results are validated by conducting extensive experiments, including randomly generated task graphs and three types of task graphs in real-world applications. This study demonstrates that our algorithm significantly improves system reliability.
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 callDisclaimer: 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.
