FRINK Linked Data Fragments server

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

• W1973531467 endingPage "422" @default.
• W1973531467 startingPage "381" @default.
• W1973531467 abstract "The problem of scheduling a parallel program represented by a weighted directed acyclic graph (DAG) to a set of homogeneous processors for minimizing the completion time of the program has been extensively studied. The NP-completeness of the problem has stimulated researchers to propose a myriad of heuristic algorithms. While most of these algorithms are reported to be efficient, it is not clear how they compare against each other. A meaningful performance evaluation and comparison of these algorithms is a complex task and it must take into account a number of issues. First, most scheduling algorithms are based upon diverse assumptions, making the performance comparison rather meaningless. Second, there does not exist a standard set of benchmarks to examine these algorithms. Third, most algorithms are evaluated using small problem sizes, and, therefore, their scalability is unknown. In this paper, we first provide a taxonomy for classifying various algorithms into distinct categories according to their assumptions and functionalities. We then propose a set of benchmarks that are based on diverse structures and are not biased toward a particular scheduling technique. We have implemented 15 scheduling algorithms and compared them on a common platform by using the proposed benchmarks, as well as by varying important problem parameters. We interpret the results based upon the design philosophies and principles behind these algorithms, drawing inferences why some algorithms perform better than others. We also propose a performance measure called scheduling scalability (SS) that captures the collective effectiveness of a scheduling algorithm in terms of its solution quality, the number of processors used, and the running time." @default.
• W1973531467 created "2016-06-24" @default.
• W1973531467 creator A5023585194 @default.
• W1973531467 creator A5082587173 @default.
• W1973531467 date "1999-12-01" @default.
• W1973531467 modified "2023-09-25" @default.
• W1973531467 title "Benchmarking and Comparison of the Task Graph Scheduling Algorithms" @default.
• W1973531467 cites W1969750929 @default.
• W1973531467 cites W1977590451 @default.
• W1973531467 cites W1987501116 @default.
• W1973531467 cites W1989582918 @default.
• W1973531467 cites W1998978603 @default.
• W1973531467 cites W2019307327 @default.
• W1973531467 cites W2019356799 @default.
• W1973531467 cites W2023753260 @default.
• W1973531467 cites W2026899276 @default.
• W1973531467 cites W2027077493 @default.
• W1973531467 cites W2037987555 @default.
• W1973531467 cites W2043331236 @default.
• W1973531467 cites W2057108708 @default.
• W1973531467 cites W2057392949 @default.
• W1973531467 cites W2060983467 @default.
• W1973531467 cites W2065689629 @default.
• W1973531467 cites W2074464226 @default.
• W1973531467 cites W2077941545 @default.
• W1973531467 cites W2092333800 @default.
• W1973531467 cites W2096949818 @default.
• W1973531467 cites W2097911714 @default.
• W1973531467 cites W2118396891 @default.
• W1973531467 cites W2122698508 @default.
• W1973531467 cites W2144482271 @default.
• W1973531467 cites W2151038512 @default.
• W1973531467 cites W2152408640 @default.
• W1973531467 cites W2155951254 @default.
• W1973531467 cites W2158923044 @default.
• W1973531467 cites W2167384564 @default.
• W1973531467 cites W2169560887 @default.
• W1973531467 doi "https://doi.org/10.1006/jpdc.1999.1578" @default.
• W1973531467 hasPublicationYear "1999" @default.
• W1973531467 type Work @default.
• W1973531467 sameAs 1973531467 @default.
• W1973531467 citedByCount "349" @default.
• W1973531467 countsByYear W19735314672012 @default.
• W1973531467 countsByYear W19735314672013 @default.
• W1973531467 countsByYear W19735314672014 @default.
• W1973531467 countsByYear W19735314672015 @default.
• W1973531467 countsByYear W19735314672016 @default.
• W1973531467 countsByYear W19735314672017 @default.
• W1973531467 countsByYear W19735314672018 @default.
• W1973531467 countsByYear W19735314672019 @default.
• W1973531467 countsByYear W19735314672020 @default.
• W1973531467 countsByYear W19735314672021 @default.
• W1973531467 countsByYear W19735314672022 @default.
• W1973531467 countsByYear W19735314672023 @default.
• W1973531467 crossrefType "journal-article" @default.
• W1973531467 hasAuthorship W1973531467A5023585194 @default.
• W1973531467 hasAuthorship W1973531467A5082587173 @default.
• W1973531467 hasConcept C11413529 @default.
• W1973531467 hasConcept C126255220 @default.
• W1973531467 hasConcept C144133560 @default.
• W1973531467 hasConcept C162853370 @default.
• W1973531467 hasConcept C206729178 @default.
• W1973531467 hasConcept C33923547 @default.
• W1973531467 hasConcept C41008148 @default.
• W1973531467 hasConcept C48044578 @default.
• W1973531467 hasConcept C77088390 @default.
• W1973531467 hasConcept C80444323 @default.
• W1973531467 hasConcept C86251818 @default.
• W1973531467 hasConceptScore W1973531467C11413529 @default.
• W1973531467 hasConceptScore W1973531467C126255220 @default.
• W1973531467 hasConceptScore W1973531467C144133560 @default.
• W1973531467 hasConceptScore W1973531467C162853370 @default.
• W1973531467 hasConceptScore W1973531467C206729178 @default.
• W1973531467 hasConceptScore W1973531467C33923547 @default.
• W1973531467 hasConceptScore W1973531467C41008148 @default.
• W1973531467 hasConceptScore W1973531467C48044578 @default.
• W1973531467 hasConceptScore W1973531467C77088390 @default.
• W1973531467 hasConceptScore W1973531467C80444323 @default.
• W1973531467 hasConceptScore W1973531467C86251818 @default.
• W1973531467 hasIssue "3" @default.
• W1973531467 hasLocation W19735314671 @default.
• W1973531467 hasOpenAccess W1973531467 @default.
• W1973531467 hasPrimaryLocation W19735314671 @default.
• W1973531467 hasRelatedWork W1525643724 @default.
• W1973531467 hasRelatedWork W1848359393 @default.
• W1973531467 hasRelatedWork W1992741870 @default.
• W1973531467 hasRelatedWork W2067938758 @default.
• W1973531467 hasRelatedWork W2127025027 @default.
• W1973531467 hasRelatedWork W2155350564 @default.
• W1973531467 hasRelatedWork W2364921833 @default.
• W1973531467 hasRelatedWork W2382623646 @default.
• W1973531467 hasRelatedWork W2546696010 @default.
• W1973531467 hasRelatedWork W3009603553 @default.
• W1973531467 hasVolume "59" @default.
• W1973531467 isParatext "false" @default.
• W1973531467 isRetracted "false" @default.
• W1973531467 magId "1973531467" @default.
• W1973531467 workType "article" @default.