FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4384519012> ?p ?o ?g. }

• W4384519012 endingPage "18" @default.
• W4384519012 startingPage "1" @default.
• W4384519012 abstract "Among the available processor-level energy savings schemes, dynamic voltage and frequency scaling (DVFS) is very popular and effective due to its widespread cross-platform use in designing energy-efficient scheduling algorithms. However, rapid frequency switching by DVFS based algorithms while minimizing the energy consumptions may result transient failures in the system. To avoid such failures and their catastrophic consequences, energy-efficient scheduling algorithms with the capabilities to provide more reliable task schedules are always in demand. Therefore, this paper introduces two novel low complexity energy-efficient task scheduling algorithms for heterogeneous computing environments. We term the first algorithm as ‘binary search-based energy-efficient scheduling with reliability goal (BSESRG)’ for running parallel task graphs in heterogeneous computing systems. We show that the proposed BSESRG has the capability to reduce energy consumption, and shorten the total schedule length by meeting the reliability goals upto a certain threshold. Then, we present our second algorithm, the ‘binary search-based energy-efficient fault-tolerant scheduling with reliability goal (BSESRG-FT), which ensures meeting the reliability goals with simultaneous consideration of fault tolerance. The proposed BSESRG-FT is able to reach higher reliability goals, reduce energy consumption, and shorten the total schedule length of a parallel task graph on heterogeneous platforms. We demonstrate the working of both BSESRG and BSESRG-FT through simulation experiments considering real-world task graphs, and show the supremacy of the two proposed algorithms over their respective peers (viz., ESRG and EFSRG) in terms of energy savings, schedule lengths, run times and reliability goals. The superiority of the proposed BSESRG and BSESRG-FT over their respective competitors are also validated on the real benchmark MiBench. Moreover, from the complexity analysis, we respectively find the time complexities of BSESRG and BSESRG-FT as <inline-formula xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink><tex-math notation=LaTeX>$Omathbf {(|mathcal {X}|times |P| times log_{2}|F|)}$</tex-math></inline-formula> and <inline-formula xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink><tex-math notation=LaTeX>$Omathbf {(|mathcal {X}|times |P|^{2}times log_{2}|F|)}$</tex-math></inline-formula> confirming their better computational efficiency than the respective peers." @default.
• W4384519012 created "2023-07-18" @default.
• W4384519012 creator A5003623633 @default.
• W4384519012 creator A5032030992 @default.
• W4384519012 creator A5051231954 @default.
• W4384519012 date "2023-01-01" @default.
• W4384519012 modified "2023-09-27" @default.
• W4384519012 title "Binary Search-Based Fast Scheduling Algorithms for Reliability-Aware Energy-Efficient Task Graph Scheduling with Fault Tolerance" @default.
• W4384519012 doi "https://doi.org/10.1109/tsusc.2023.3295939" @default.
• W4384519012 hasPublicationYear "2023" @default.
• W4384519012 type Work @default.
• W4384519012 citedByCount "0" @default.
• W4384519012 crossrefType "journal-article" @default.
• W4384519012 hasAuthorship W4384519012A5003623633 @default.
• W4384519012 hasAuthorship W4384519012A5032030992 @default.
• W4384519012 hasAuthorship W4384519012A5051231954 @default.
• W4384519012 hasConcept C111919701 @default.
• W4384519012 hasConcept C11413529 @default.
• W4384519012 hasConcept C119599485 @default.
• W4384519012 hasConcept C120314980 @default.
• W4384519012 hasConcept C126255220 @default.
• W4384519012 hasConcept C127413603 @default.
• W4384519012 hasConcept C157742956 @default.
• W4384519012 hasConcept C173608175 @default.
• W4384519012 hasConcept C206729178 @default.
• W4384519012 hasConcept C2776047111 @default.
• W4384519012 hasConcept C2780165032 @default.
• W4384519012 hasConcept C33923547 @default.
• W4384519012 hasConcept C41008148 @default.
• W4384519012 hasConcept C63540848 @default.
• W4384519012 hasConcept C68387754 @default.
• W4384519012 hasConceptScore W4384519012C111919701 @default.
• W4384519012 hasConceptScore W4384519012C11413529 @default.
• W4384519012 hasConceptScore W4384519012C119599485 @default.
• W4384519012 hasConceptScore W4384519012C120314980 @default.
• W4384519012 hasConceptScore W4384519012C126255220 @default.
• W4384519012 hasConceptScore W4384519012C127413603 @default.
• W4384519012 hasConceptScore W4384519012C157742956 @default.
• W4384519012 hasConceptScore W4384519012C173608175 @default.
• W4384519012 hasConceptScore W4384519012C206729178 @default.
• W4384519012 hasConceptScore W4384519012C2776047111 @default.
• W4384519012 hasConceptScore W4384519012C2780165032 @default.
• W4384519012 hasConceptScore W4384519012C33923547 @default.
• W4384519012 hasConceptScore W4384519012C41008148 @default.
• W4384519012 hasConceptScore W4384519012C63540848 @default.
• W4384519012 hasConceptScore W4384519012C68387754 @default.
• W4384519012 hasLocation W43845190121 @default.
• W4384519012 hasOpenAccess W4384519012 @default.
• W4384519012 hasPrimaryLocation W43845190121 @default.
• W4384519012 hasRelatedWork W1498327774 @default.
• W4384519012 hasRelatedWork W1992741870 @default.
• W4384519012 hasRelatedWork W2017870684 @default.
• W4384519012 hasRelatedWork W2105370008 @default.
• W4384519012 hasRelatedWork W2117706453 @default.
• W4384519012 hasRelatedWork W2136131933 @default.
• W4384519012 hasRelatedWork W2516115930 @default.
• W4384519012 hasRelatedWork W2624610256 @default.
• W4384519012 hasRelatedWork W2915594810 @default.
• W4384519012 hasRelatedWork W2128288285 @default.
• W4384519012 isParatext "false" @default.
• W4384519012 isRetracted "false" @default.
• W4384519012 workType "article" @default.