Matches in SemOpenAlex for { <https://semopenalex.org/work/W3046228672> ?p ?o ?g. }
Showing items 1 to 87 of
87
with 100 items per page.
- W3046228672 endingPage "90" @default.
- W3046228672 startingPage "79" @default.
- W3046228672 abstract "Optimal task allocation in Large-Scale Computing Systems (LSCSs) that endeavors to balance the load across limited computing resources is considered an NP-hard problem. MinMin algorithm is one of the most widely used heuristic for scheduling tasks on limited computing resources. The MinMin minimizes makespan compared to other algorithms, such as Heterogeneous Earliest Finish Time (HEFT), duplication based algorithms, and clustering algorithms. However, MinMin results in unbalanced utilization of resources especially when majority of tasks have lower computational requirements. In this work we consider a computational model where each machine has certain bounded capacity to execute a predefined number of tasks simultaneously. Based on aforementioned model, a task scheduling heuristic Extended High to Low Load (ExH2LL) is proposed that attempts to balance the workload across the available computing resources while improving the resource utilization and reducing the makespan. ExH2LL dynamically identifies task-to-machine assignment considering the existing load on all machines. We compare ExH2LL with MinMin, H2LL, Improved MinMin Task Scheduling (IMMTS), Load Balanced MaxMin (LBM), and M-Level Suffrage-Based Scheduling Algorithm (MSSA). Simulation results show that ExH2LL outperforms the compared heuristics with respect to makespan and resource utilization. Moreover, we formally model and verify the working of ExH2LL using High Level Petri Nets, Satisfiability Modulo Theories Library, and Z3 Solver." @default.
- W3046228672 created "2020-08-07" @default.
- W3046228672 creator A5055197093 @default.
- W3046228672 creator A5055323881 @default.
- W3046228672 creator A5056677620 @default.
- W3046228672 creator A5074668532 @default.
- W3046228672 creator A5077993621 @default.
- W3046228672 creator A5087253600 @default.
- W3046228672 date "2019-01-01" @default.
- W3046228672 modified "2023-10-16" @default.
- W3046228672 title "A Load Balanced Task Scheduling Heuristic for Large-Scale Computing Systems" @default.
- W3046228672 cites W1677582362 @default.
- W3046228672 cites W1979110818 @default.
- W3046228672 cites W2025397485 @default.
- W3046228672 cites W2032570272 @default.
- W3046228672 cites W2045141560 @default.
- W3046228672 cites W2144743031 @default.
- W3046228672 cites W2188905909 @default.
- W3046228672 cites W2769888378 @default.
- W3046228672 cites W2806077353 @default.
- W3046228672 doi "https://doi.org/10.32604/csse.2019.34.079" @default.
- W3046228672 hasPublicationYear "2019" @default.
- W3046228672 type Work @default.
- W3046228672 sameAs 3046228672 @default.
- W3046228672 citedByCount "15" @default.
- W3046228672 countsByYear W30462286722021 @default.
- W3046228672 countsByYear W30462286722022 @default.
- W3046228672 countsByYear W30462286722023 @default.
- W3046228672 crossrefType "journal-article" @default.
- W3046228672 hasAuthorship W3046228672A5055197093 @default.
- W3046228672 hasAuthorship W3046228672A5055323881 @default.
- W3046228672 hasAuthorship W3046228672A5056677620 @default.
- W3046228672 hasAuthorship W3046228672A5074668532 @default.
- W3046228672 hasAuthorship W3046228672A5077993621 @default.
- W3046228672 hasAuthorship W3046228672A5087253600 @default.
- W3046228672 hasBestOaLocation W30462286721 @default.
- W3046228672 hasConcept C107568181 @default.
- W3046228672 hasConcept C111919701 @default.
- W3046228672 hasConcept C120314980 @default.
- W3046228672 hasConcept C126255220 @default.
- W3046228672 hasConcept C127705205 @default.
- W3046228672 hasConcept C138959212 @default.
- W3046228672 hasConcept C173608175 @default.
- W3046228672 hasConcept C187691185 @default.
- W3046228672 hasConcept C206729178 @default.
- W3046228672 hasConcept C2524010 @default.
- W3046228672 hasConcept C31689143 @default.
- W3046228672 hasConcept C33923547 @default.
- W3046228672 hasConcept C41008148 @default.
- W3046228672 hasConcept C55416958 @default.
- W3046228672 hasConcept C68387754 @default.
- W3046228672 hasConceptScore W3046228672C107568181 @default.
- W3046228672 hasConceptScore W3046228672C111919701 @default.
- W3046228672 hasConceptScore W3046228672C120314980 @default.
- W3046228672 hasConceptScore W3046228672C126255220 @default.
- W3046228672 hasConceptScore W3046228672C127705205 @default.
- W3046228672 hasConceptScore W3046228672C138959212 @default.
- W3046228672 hasConceptScore W3046228672C173608175 @default.
- W3046228672 hasConceptScore W3046228672C187691185 @default.
- W3046228672 hasConceptScore W3046228672C206729178 @default.
- W3046228672 hasConceptScore W3046228672C2524010 @default.
- W3046228672 hasConceptScore W3046228672C31689143 @default.
- W3046228672 hasConceptScore W3046228672C33923547 @default.
- W3046228672 hasConceptScore W3046228672C41008148 @default.
- W3046228672 hasConceptScore W3046228672C55416958 @default.
- W3046228672 hasConceptScore W3046228672C68387754 @default.
- W3046228672 hasIssue "2" @default.
- W3046228672 hasLocation W30462286721 @default.
- W3046228672 hasOpenAccess W3046228672 @default.
- W3046228672 hasPrimaryLocation W30462286721 @default.
- W3046228672 hasRelatedWork W1545991362 @default.
- W3046228672 hasRelatedWork W2167574351 @default.
- W3046228672 hasRelatedWork W2225350526 @default.
- W3046228672 hasRelatedWork W2372008037 @default.
- W3046228672 hasRelatedWork W2373973180 @default.
- W3046228672 hasRelatedWork W2377713709 @default.
- W3046228672 hasRelatedWork W2978148977 @default.
- W3046228672 hasRelatedWork W3036719625 @default.
- W3046228672 hasRelatedWork W2184166483 @default.
- W3046228672 hasRelatedWork W2397293317 @default.
- W3046228672 hasVolume "34" @default.
- W3046228672 isParatext "false" @default.
- W3046228672 isRetracted "false" @default.
- W3046228672 magId "3046228672" @default.
- W3046228672 workType "article" @default.