Benchmarking and Comparison of the Task Graph Scheduling Algorithms

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...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of parallel and distributed computing Vol. 59; no. 3; pp. 381 - 422
Main Authors:	Kwok, Yu-Kwong, Ahmad, Ishfaq
Format:	Journal Article
Language:	English
Published:	San Diego, CA Elsevier Inc 01.12.1999 Elsevier
Subjects:	Applied sciences benchmarks Computer science; control theory; systems Computer systems and distributed systems. User interface Exact sciences and technology multiprocessors parallel processing performance evaluation scalability scheduling Software task graphs performance evaluation scheduling benchmarks multiprocessors parallel processing scalability task graphs Performance evaluation Multiprocessor Parallel program Parallel processing NP complete problem Bench mark Scheduling Algorithm Acyclic graph Directed graph Completion time
ISSN:	0743-7315, 1096-0848
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

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.
AbstractList	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.
Author	Ahmad, Ishfaq Kwok, Yu-Kwong
Author_xml	– sequence: 1 givenname: Yu-Kwong surname: Kwok fullname: Kwok, Yu-Kwong organization: Department of Electrical and Electronic Engineering, The University of Hong Kong, Pokfulam Road, Hong Kong, f1E-mail: ykwok@eee.hku.hkf1 – sequence: 2 givenname: Ishfaq surname: Ahmad fullname: Ahmad, Ishfaq organization: Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong, f2E-mail: iahmad@cs.ust.hkf2
BackLink	http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1202348$$DView record in Pascal Francis
BookMark	eNp1kLFOwzAQQC1UJFpgZc7AmuCLk9geSwUFqRIDZbYcx27cpnZkByT-nkRFDEidbnnvdPcWaOa80wjdAc4A4-ph3zcqA855BiVlF2gOmFcpZgWboTmmBUkpgfIKLWLcYwwTNEerR-1Ue5ThYN0uka5JVv7Yy2Cjd4k3ydDqZCvjIVkH2bfJu2p189lN7LLb-WCH9hhv0KWRXdS3v_MafTw_bVcv6eZt_bpablJFGAypZJRqRSrIGad1o2jZ6AJjbYrKGJybuiZcVYZTCrjUHHgNtMhzCZpSUpGaXKP7095eRiU7E6RTNoo-2PH-bwE5zknBRqw4YSr4GIM2QtlBDta7IUjbCcBi6iWmXmLqJaYUo5b90_4WnxPYSdDjz19WBxGVHWvqxgatBtF4e079AeEEgko
CitedBy_id	crossref_primary_10_1016_j_cor_2005_01_005 crossref_primary_10_1016_j_jpdc_2012_12_011 crossref_primary_10_1023_A_1019076003163 crossref_primary_10_1109_TPDS_2009_11 crossref_primary_10_1007_s11227_017_2047_1 crossref_primary_10_1109_TII_2011_2123905 crossref_primary_10_1016_j_sysarc_2007_01_013 crossref_primary_10_1016_j_jpdc_2019_09_004 crossref_primary_10_4028_www_scientific_net_AMR_546_547_1421 crossref_primary_10_1007_s00607_018_0636_3 crossref_primary_10_1007_s11241_019_09333_z crossref_primary_10_1109_4434_895101 crossref_primary_10_1002_cpe_6761 crossref_primary_10_1016_j_future_2018_10_013 crossref_primary_10_1016_j_parco_2018_03_004 crossref_primary_10_1016_j_future_2023_11_013 crossref_primary_10_1016_j_future_2011_05_001 crossref_primary_10_1080_09537287_2017_1367860 crossref_primary_10_1177_1063293X16679001 crossref_primary_10_1155_2019_6543957 crossref_primary_10_1007_s11227_012_0751_4 crossref_primary_10_1007_s11227_018_2355_0 crossref_primary_10_1007_s11227_009_0290_9 crossref_primary_10_1016_S0743_7315_03_00013_3 crossref_primary_10_1007_s10586_006_0010_7 crossref_primary_10_1109_TPDS_2002_1011417 crossref_primary_10_20965_jdr_2014_p0381 crossref_primary_10_1007_s11831_024_10069_8 crossref_primary_10_3390_s22207803 crossref_primary_10_1109_TPDS_2020_2984821 crossref_primary_10_1007_s00170_012_3939_0 crossref_primary_10_1002_cpe_8217 crossref_primary_10_1007_s00500_014_1360_3 crossref_primary_10_1007_s10723_011_9200_5 crossref_primary_10_1287_trsc_2022_1192 crossref_primary_10_1109_TCAD_2005_858269 crossref_primary_10_1002_cpe_5060 crossref_primary_10_3745_KIPSTA_2006_13A_2_163 crossref_primary_10_1049_ip_cdt_20050196 crossref_primary_10_1109_TPDS_2008_260 crossref_primary_10_1016_j_compeleceng_2016_11_036 crossref_primary_10_1002_cpe_5987 crossref_primary_10_1016_j_jpdc_2005_05_028 crossref_primary_10_1016_j_jpdc_2009_09_008 crossref_primary_10_1016_j_jpdc_2009_11_001 crossref_primary_10_1016_j_jpdc_2013_04_006 crossref_primary_10_1016_S0743_7315_03_00011_X crossref_primary_10_1145_1105734_1105742 crossref_primary_10_1002_cpe_4124 crossref_primary_10_3233_MGS_160252 crossref_primary_10_1109_ACCESS_2017_2760801 crossref_primary_10_1109_TC_2015_2417533 crossref_primary_10_1109_TPDS_2012_311 crossref_primary_10_1016_j_parco_2021_102753 crossref_primary_10_1007_s10723_016_9386_7 crossref_primary_10_1108_IJPCC_04_2020_0029 crossref_primary_10_1109_TPDS_2009_107 crossref_primary_10_1109_TPDS_2007_1117 crossref_primary_10_1007_s00521_018_3928_9 crossref_primary_10_1016_j_jpdc_2011_01_008 crossref_primary_10_1177_1550147717736175 crossref_primary_10_1002_cpe_965 crossref_primary_10_1109_TPDS_2003_1206502 crossref_primary_10_13182_NSE02_1 crossref_primary_10_1016_j_jss_2017_05_017 crossref_primary_10_1016_j_micpro_2016_09_012 crossref_primary_10_1177_0954406215582016 crossref_primary_10_1016_j_future_2005_11_002 crossref_primary_10_1016_j_jpdc_2010_01_003 crossref_primary_10_1016_j_future_2006_11_003 crossref_primary_10_1007_s11227_008_0204_2 crossref_primary_10_1016_j_jpdc_2010_03_011 crossref_primary_10_1177_0037549704045444 crossref_primary_10_1016_j_parco_2006_08_004 crossref_primary_10_1109_TCAD_2011_2181848 crossref_primary_10_1111_exsy_12536 crossref_primary_10_4304_jcp_8_1_61_68 crossref_primary_10_1016_j_future_2018_12_004 crossref_primary_10_1016_j_bspc_2023_105435 crossref_primary_10_1016_j_pnucene_2008_09_003 crossref_primary_10_1631_jzus_A0820007 crossref_primary_10_1016_j_future_2012_12_005 crossref_primary_10_1007_s11227_012_0845_z crossref_primary_10_1016_j_jpdc_2004_11_006 crossref_primary_10_1007_s11227_010_0422_2 crossref_primary_10_1016_j_jpdc_2008_07_004 crossref_primary_10_1109_ACCESS_2019_2921477 crossref_primary_10_1016_j_jpdc_2007_03_003 crossref_primary_10_1023_A_1011186732749 crossref_primary_10_1016_j_jpdc_2005_01_006 crossref_primary_10_1007_s10766_010_0134_5 crossref_primary_10_1016_j_cmpb_2013_07_028 crossref_primary_10_1016_j_jpdc_2011_06_006 crossref_primary_10_1002_cpe_745 crossref_primary_10_1109_TPDS_2006_87 crossref_primary_10_1109_TPDS_2004_1264795 crossref_primary_10_1145_344588_344618 crossref_primary_10_1016_j_apm_2012_02_011 crossref_primary_10_1177_1094342003017002007 crossref_primary_10_1109_TPDS_2022_3179328 crossref_primary_10_1016_j_jpdc_2005_01_002 crossref_primary_10_1080_00207217_2015_1020880 crossref_primary_10_1007_s10009_014_0359_5 crossref_primary_10_1007_s11265_009_0366_z crossref_primary_10_1023_A_1022856623227 crossref_primary_10_1016_j_jocs_2017_07_004 crossref_primary_10_1007_s11227_011_0721_2 crossref_primary_10_1007_s00500_019_04520_3 crossref_primary_10_1016_j_jpdc_2008_04_001 crossref_primary_10_1145_1142020_1142024 crossref_primary_10_1007_s10617_018_9214_3 crossref_primary_10_1145_2501654_2501664 crossref_primary_10_1002_ett_5019 crossref_primary_10_1007_s10586_006_9747_2 crossref_primary_10_1016_j_compeleceng_2016_07_001 crossref_primary_10_1145_3011286_3011305
Cites_doi	10.1142/S0129626495000473 10.1137/0218016 10.1109/71.503776 10.1006/jpdc.1997.1395 10.1016/0167-8191(93)90079-Z 10.1007/BF00288685 10.1109/71.503777 10.1137/0219021 10.1109/32.62447 10.1109/71.207593 10.1109/71.722221 10.1145/361604.361619 10.1109/71.481597 10.1109/32.4634 10.1002/cpe.4330070504 10.1109/71.80160 10.1287/opre.9.6.841 10.1016/0743-7315(92)90012-C 10.1016/0743-7315(90)90042-N 10.1109/71.308533 10.1109/TC.1973.5009153 10.1109/TC.1984.1676376 10.1016/0743-7315(90)90014-G 10.1109/TC.1972.5008918 10.1016/S0022-0000(75)80008-0 10.1287/opre.39.4.680 10.1109/71.762819 10.1142/S0129626493000083 10.1145/66451.66454 10.1137/0208031
ContentType	Journal Article
Copyright	1999 Academic Press 2000 INIST-CNRS
Copyright_xml	– notice: 1999 Academic Press – notice: 2000 INIST-CNRS
DBID	AAYXX CITATION IQODW
DOI	10.1006/jpdc.1999.1578
DatabaseName	CrossRef Pascal-Francis
DatabaseTitle	CrossRef
DatabaseTitleList
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science Applied Sciences
EISSN	1096-0848
EndPage	422
ExternalDocumentID	1202348 10_1006_jpdc_1999_1578 S0743731599915782
GroupedDBID	--K --M -~X .~1 0R~ 1B1 1~. 1~5 29L 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADHUB ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CAG COF CS3 DM4 DU5 E.L EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ H~9 IHE J1W JJJVA K-O KOM LG5 LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TN5 TWZ WUQ XJT XOL XPP ZMT ZU3 ZY4 ~G- ~G0 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH
ID	FETCH-LOGICAL-c381t-a877ec3612897bdc75de400ef46ff02fbb39c6f977105e919b17422a1e77363b3
ISICitedReferencesCount	235
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000084113900003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0743-7315
IngestDate	Mon Jul 21 09:12:43 EDT 2025 Sat Nov 29 07:15:15 EST 2025 Tue Nov 18 21:19:43 EST 2025 Fri Feb 23 02:27:54 EST 2024
IsPeerReviewed	true
IsScholarly	true
Issue	3
Keywords	performance evaluation scheduling benchmarks multiprocessors parallel processing scalability task graphs Performance evaluation Multiprocessor Parallel program Parallel processing NP complete problem Bench mark Scheduling Algorithm Acyclic graph Directed graph Completion time
Language	English
License	CC BY 4.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c381t-a877ec3612897bdc75de400ef46ff02fbb39c6f977105e919b17422a1e77363b3
PageCount	42
ParticipantIDs	pascalfrancis_primary_1202348 crossref_citationtrail_10_1006_jpdc_1999_1578 crossref_primary_10_1006_jpdc_1999_1578 elsevier_sciencedirect_doi_10_1006_jpdc_1999_1578
PublicationCentury	1900
PublicationDate	1999-12-01
PublicationDateYYYYMMDD	1999-12-01
PublicationDate_xml	– month: 12 year: 1999 text: 1999-12-01 day: 01
PublicationDecade	1990
PublicationPlace	San Diego, CA
PublicationPlace_xml	– name: San Diego, CA
PublicationTitle	Journal of parallel and distributed computing
PublicationYear	1999
Publisher	Elsevier Inc Elsevier
Publisher_xml	– name: Elsevier Inc – name: Elsevier
References	Papadimitriou, Yannakakis (RF33) 1979; 8 Ahmad, Kwok, Wu, Shu (RF5) 1997 Kwok, Ahmad (RF29) 1997; 47 Fernadez, Bussell (RF17) 1973; C-22 Chung, Ranka (RF12) 1992 Shirazi, Wang, Pathak (RF39) 1990; 10 Sih, Lee (RF40) 1993; 4 Ullman (RF41) 1975; 10 Chen, Shirazi, Marquis (RF11) 1993 Hu (RF20) 1961; 19 McCreary, Gill (RF30) 1989; 32 Hwang, Xu (RF22) 1998 Kim, Browne (RF26) 1988 Wu, Gajski (RF42) 1990; 1 Garey, Johnson (RF18) 1979 Yang, Gerasoulis (RF43) 1993; 19 Ahmad, Kwok (RF2) 1998; 9 Ali, El-Rewini (RF6) 1993; 3 Colin, Chretienne (RF14) 1991; 39 Cosnard, Loi (RF15) 1995; 5 Ramamoorthy, Chandy, Gonzalez (RF36) 1972; C-21 Mehdiratta, Ghose (RF31) 1994 Park, Shirazi, Marquis (RF35) 1997 Gerasoulis, Yang (RF19) 1992; 16 Adam, Chandy, Dickson (RF1) 1974; 17 Khan, McCreary, Jones (RF25) 1994 Ahmad, Kwok (RF3) 1999; 11 Kwok, Ahmad (RF28) 1996; 7 Papadimitriou, Yannakakis (RF34) 1990; 19 Yang, Gerasoulis (RF44) 1994; 5 Al-Maasarani (RF7) 1993 Kasahara, Narita (RF24) 1984; C-33 Palis, Liou, Wei (RF32) 1996; 7 Kruatrachue, Lewis (RF27) 1987 Hwang, Xu, Arakawa (RF23) 1996; 7 Shirazi, Chen, Marquis (RF38) 1995; 7 Casavant, Kuhl (RF10) 1988; 14 El-Rewini, Lewis (RF16) 1990; 9 Baxter, Patel (RF9) 1989 Ahmad, Kwok (RF4) 1998 Al-Mouhamed (RF8) 1990; 16 Coffman, Graham (RF13) 1972; 1 Hwang, Chow, Anger, Lee (RF21) 1989; 18 Sarkar (RF37) 1989 Park (10.1006/jpdc.1999.1578_RF35) 1997 Papadimitriou (10.1006/jpdc.1999.1578_RF33) 1979; 8 Ahmad (10.1006/jpdc.1999.1578_RF3) 1999; 11 Coffman (10.1006/jpdc.1999.1578_RF13) 1972; 1 Ali (10.1006/jpdc.1999.1578_RF6) 1993; 3 Ahmad (10.1006/jpdc.1999.1578_RF2) 1998; 9 Chen (10.1006/jpdc.1999.1578_RF11) 1993 Ullman (10.1006/jpdc.1999.1578_RF41) 1975; 10 Chung (10.1006/jpdc.1999.1578_RF12) 1992 Sih (10.1006/jpdc.1999.1578_RF40) 1993; 4 Mehdiratta (10.1006/jpdc.1999.1578_RF31) 1994 Hu (10.1006/jpdc.1999.1578_RF20) 1961; 19 Kwok (10.1006/jpdc.1999.1578_RF28) 1996; 7 Palis (10.1006/jpdc.1999.1578_RF32) 1996; 7 Hwang (10.1006/jpdc.1999.1578_RF21) 1989; 18 Garey (10.1006/jpdc.1999.1578_RF18) 1979 Yang (10.1006/jpdc.1999.1578_RF44) 1994; 5 El-Rewini (10.1006/jpdc.1999.1578_RF16) 1990; 9 Al-Mouhamed (10.1006/jpdc.1999.1578_RF8) 1990; 16 Cosnard (10.1006/jpdc.1999.1578_RF15) 1995; 5 McCreary (10.1006/jpdc.1999.1578_RF30) 1989; 32 Shirazi (10.1006/jpdc.1999.1578_RF39) 1990; 10 Fernadez (10.1006/jpdc.1999.1578_RF17) 1973; C-22 Sarkar (10.1006/jpdc.1999.1578_RF37) 1989 Hwang (10.1006/jpdc.1999.1578_RF23) 1996; 7 Shirazi (10.1006/jpdc.1999.1578_RF38) 1995; 7 Adam (10.1006/jpdc.1999.1578_RF1) 1974; 17 Hwang (10.1006/jpdc.1999.1578_RF22) 1998 Gerasoulis (10.1006/jpdc.1999.1578_RF19) 1992; 16 Ahmad (10.1006/jpdc.1999.1578_RF5) 1997 Ramamoorthy (10.1006/jpdc.1999.1578_RF36) 1972; C-21 Wu (10.1006/jpdc.1999.1578_RF42) 1990; 1 Yang (10.1006/jpdc.1999.1578_RF43) 1993; 19 Ahmad (10.1006/jpdc.1999.1578_RF4) 1998 Baxter (10.1006/jpdc.1999.1578_RF9) 1989 Papadimitriou (10.1006/jpdc.1999.1578_RF34) 1990; 19 Kwok (10.1006/jpdc.1999.1578_RF29) 1997; 47 Colin (10.1006/jpdc.1999.1578_RF14) 1991; 39 Kruatrachue (10.1006/jpdc.1999.1578_RF27) 1987 Khan (10.1006/jpdc.1999.1578_RF25) 1994 Al-Maasarani (10.1006/jpdc.1999.1578_RF7) 1993 Kim (10.1006/jpdc.1999.1578_RF26) 1988 Kasahara (10.1006/jpdc.1999.1578_RF24) 1984; C-33 Casavant (10.1006/jpdc.1999.1578_RF10) 1988; 14
References_xml	– year: 1997 ident: RF35 article-title: DFRN: A new approach for duplication based scheduling for distributed memory multiprocessor systems publication-title: Proc. 11th Int'l Parallel Processing Symposium – year: 1993 ident: RF11 article-title: Performance evaluation of a novel scheduling method: Linear clustering with task duplication publication-title: Proc. Int'l Conf. Parallel and Distributed Systems – volume: 7 start-page: 522 year: 1996 end-page: 536 ident: RF23 article-title: Benchmark evaluation of the IBM SP2 for parallel signal processing publication-title: IEEE Trans. Parallel Distrib. Systems – volume: 7 start-page: 371 year: 1995 end-page: 390 ident: RF38 article-title: Comparative study of task duplication static scheduling versus clustering and non-clustering techniques publication-title: Concurrency: Practice and Experience – year: 1997 ident: RF5 article-title: Automatic parallelization and scheduling of programs on multiprocessors using CASH publication-title: Proc. 1997 Int'l Conf. Parallel Processing – volume: 7 start-page: 46 year: 1996 end-page: 55 ident: RF32 article-title: Task clustering and scheduling for distributed memory parallel architectures publication-title: IEEE Trans. Parallel Distrib. Systems – year: 1994 ident: RF25 article-title: A comparison of multiprocessor scheduling heuristic publication-title: Proc. 1994 Int'l Conf. Parallel Processing – year: 1987 ident: RF27 article-title: Duplication scheduling heuristic (DSH): A new precedence task scheduler for parallel processor systems publication-title: Technical Report – volume: 1 start-page: 330 year: 1990 end-page: 343 ident: RF42 article-title: Hypercool: a programming aid for message-passing systems publication-title: IEEE Trans. Parallel Distrib. Systems – volume: 1 start-page: 200 year: 1972 end-page: 213 ident: RF13 article-title: Optimal scheduling for two-processor systems publication-title: Acta Inform. – volume: 19 start-page: 1321 year: 1993 end-page: 1344 ident: RF43 article-title: List scheduling with and without communication delays publication-title: Parallel Comput. – volume: 5 start-page: 951 year: 1994 end-page: 967 ident: RF44 article-title: DSC: Scheduling parallel tasks on an unbounded number of processors publication-title: IEEE Trans. Parallel Distrib. Systems – volume: 16 start-page: 276 year: 1992 end-page: 291 ident: RF19 article-title: A comparison of clustering heuristics for scheduling DAGs on multiprocessors publication-title: J. Parallel Distrib. Comput. – volume: 32 start-page: 1073 year: 1989 end-page: 1078 ident: RF30 article-title: Automatic determination of grain size for efficient parallel processing publication-title: Comm. ACM – volume: 19 start-page: 841 year: 1961 end-page: 848 ident: RF20 article-title: Parallel sequencing and assembly line problems publication-title: Oper. Res. – volume: 11 start-page: 414 year: 1999 end-page: 432 ident: RF3 article-title: On parallelizing the multiprocessor scheduling problem publication-title: IEEE Trans. Parallel Distrib. Systems – year: 1989 ident: RF9 article-title: The LAST algorithm: A heuristic-based static task allocation algorithm publication-title: Proc. 1998 Int'l Conf. Parallel Processing – volume: 10 start-page: 222 year: 1990 end-page: 232 ident: RF39 article-title: Analysis and evalutation of heuristic methods for static scheduling publication-title: J. Parallel Distrib. Comput. – year: 1998 ident: RF22 publication-title: Scalable Parallel Computing: Technology, Architecture, Programming – volume: 4 start-page: 75 year: 1993 end-page: 87 ident: RF40 article-title: A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures publication-title: IEEE Trans. Parallel Distrib. Systems – volume: 5 start-page: 527 year: 1995 end-page: 538 ident: RF15 article-title: Automatic task graph generation techniques publication-title: Parallel Process. Lett. – volume: 8 start-page: 405 year: 1979 end-page: 409 ident: RF33 article-title: Scheduling interval-ordered tasks publication-title: SIAM J. Comput. – volume: 10 start-page: 384 year: 1975 end-page: 393 ident: RF41 article-title: NP-complete scheduling problems publication-title: J. Comput. System Sci. – volume: 17 start-page: 685 year: 1974 end-page: 690 ident: RF1 article-title: A comparison of list scheduling for parallel processing systems publication-title: Comm. ACM – year: 1992 ident: RF12 article-title: Application and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed-memory multiprocessors publication-title: Proc. Supercomputing '92 – year: 1989 ident: RF37 publication-title: Partitioning and Scheduling Parallel Programs for Multiprocessors – volume: 14 start-page: 141 year: 1988 end-page: 154 ident: RF10 article-title: A taxonomy of scheduling in general-purpose distributed computing systems publication-title: IEEE Trans. Software Eng. – volume: 9 start-page: 872 year: 1998 end-page: 892 ident: RF2 article-title: On exploiting task duplication in parallel program scheduling publication-title: IEEE Trans. Parallel Distrib. Systems – volume: 16 start-page: 1390 year: 1990 end-page: 1401 ident: RF8 article-title: Lower bound on the number of processors and time for scheduling precedence graphs with communication costs publication-title: IEEE Trans. Software Eng. – volume: C-33 start-page: 1023 year: 1984 end-page: 1029 ident: RF24 article-title: Practical multiprocessor scheduling algorithms for efficient parallel processing publication-title: IEEE Trans. Comput. – year: 1979 ident: RF18 publication-title: Computers and Intractability: A Guide to the Theory of NP-Completeness – year: 1988 ident: RF26 article-title: A general approach to mapping of parallel computation upon multiprocessor architectures publication-title: Proc. 1988 Int'l Conf. Parallel Processing – volume: 39 start-page: 680 year: 1991 end-page: 684 ident: RF14 article-title: C.P.M. scheduling with small computation delays and task duplication publication-title: Oper. Res. – volume: 9 start-page: 138 year: 1990 end-page: 153 ident: RF16 article-title: Scheduling parallel programs onto arbitrary target machines publication-title: J. Parallel Distrib. Comput. – year: 1993 ident: RF7 publication-title: Priority-Based Scheduling and Evaluation of Precedence Graphs with Communication Times – volume: 47 start-page: 58 year: 1997 end-page: 77 ident: RF29 article-title: Efficient scheduling of arbitrary task graphs to multiprocessors using a parallel genetic algorithm publication-title: J. Parallel Distrib. Comput. – year: 1998 ident: RF4 article-title: Optimal and near-optimal allocation of precedence-constrained task to parallel processors: Defying the high complexity using effective search technique publication-title: Proc. 1998 Int'l Conf. Parallel Processing – volume: 3 start-page: 53 year: 1993 end-page: 58 ident: RF6 article-title: The time complexity of scheduling interval orders with communication is polynomial publication-title: Parallel Process. Lett. – year: 1994 ident: RF31 article-title: A bottom-up approach to task scheduling on distibuted memory multiprocessor publication-title: Proc. 1994 Int'l Conf. Parallel Processing – volume: 7 start-page: 506 year: 1996 end-page: 521 ident: RF28 article-title: Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors publication-title: IEEE Trans. Parallel Distrib. Systems – volume: C-21 start-page: 137 year: 1972 end-page: 146 ident: RF36 article-title: Optimal scheduling strategies in a multiprocessor system publication-title: IEEE Trans. Comput. – volume: 18 start-page: 244 year: 1989 end-page: 257 ident: RF21 article-title: Scheduling precedence graphs in systems with interprocessor communication times publication-title: SIAM J. Comput. – volume: C-22 start-page: 745 year: 1973 end-page: 751 ident: RF17 article-title: Bounds on the number of processors and time for multiprocessor optimal schedules publication-title: IEEE Trans. Comput. – volume: 19 start-page: 322 year: 1990 end-page: 328 ident: RF34 article-title: Towards an architecture-independent analysis of parallel algorithms publication-title: SIAM J. Comput. – year: 1989 ident: 10.1006/jpdc.1999.1578_RF37 – year: 1979 ident: 10.1006/jpdc.1999.1578_RF18 – volume: 5 start-page: 527 year: 1995 ident: 10.1006/jpdc.1999.1578_RF15 article-title: Automatic task graph generation techniques publication-title: Parallel Process. Lett. doi: 10.1142/S0129626495000473 – year: 1998 ident: 10.1006/jpdc.1999.1578_RF4 article-title: Optimal and near-optimal allocation of precedence-constrained task to parallel processors: Defying the high complexity using effective search technique – volume: 18 start-page: 244 year: 1989 ident: 10.1006/jpdc.1999.1578_RF21 article-title: Scheduling precedence graphs in systems with interprocessor communication times publication-title: SIAM J. Comput. doi: 10.1137/0218016 – volume: 7 start-page: 506 year: 1996 ident: 10.1006/jpdc.1999.1578_RF28 article-title: Dynamic critical-path scheduling: An effective technique for allocating task graphs to multiprocessors publication-title: IEEE Trans. Parallel Distrib. Systems doi: 10.1109/71.503776 – volume: 47 start-page: 58 year: 1997 ident: 10.1006/jpdc.1999.1578_RF29 article-title: Efficient scheduling of arbitrary task graphs to multiprocessors using a parallel genetic algorithm publication-title: J. Parallel Distrib. Comput. doi: 10.1006/jpdc.1997.1395 – volume: 19 start-page: 1321 year: 1993 ident: 10.1006/jpdc.1999.1578_RF43 article-title: List scheduling with and without communication delays publication-title: Parallel Comput. doi: 10.1016/0167-8191(93)90079-Z – year: 1993 ident: 10.1006/jpdc.1999.1578_RF7 – volume: 1 start-page: 200 year: 1972 ident: 10.1006/jpdc.1999.1578_RF13 article-title: Optimal scheduling for two-processor systems publication-title: Acta Inform. doi: 10.1007/BF00288685 – volume: 7 start-page: 522 year: 1996 ident: 10.1006/jpdc.1999.1578_RF23 article-title: Benchmark evaluation of the IBM SP2 for parallel signal processing publication-title: IEEE Trans. Parallel Distrib. Systems doi: 10.1109/71.503777 – year: 1989 ident: 10.1006/jpdc.1999.1578_RF9 article-title: The LAST algorithm: A heuristic-based static task allocation algorithm – volume: 19 start-page: 322 year: 1990 ident: 10.1006/jpdc.1999.1578_RF34 article-title: Towards an architecture-independent analysis of parallel algorithms publication-title: SIAM J. Comput. doi: 10.1137/0219021 – volume: 16 start-page: 1390 year: 1990 ident: 10.1006/jpdc.1999.1578_RF8 article-title: Lower bound on the number of processors and time for scheduling precedence graphs with communication costs publication-title: IEEE Trans. Software Eng. doi: 10.1109/32.62447 – volume: 4 start-page: 75 year: 1993 ident: 10.1006/jpdc.1999.1578_RF40 article-title: A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures publication-title: IEEE Trans. Parallel Distrib. Systems doi: 10.1109/71.207593 – volume: 9 start-page: 872 year: 1998 ident: 10.1006/jpdc.1999.1578_RF2 article-title: On exploiting task duplication in parallel program scheduling publication-title: IEEE Trans. Parallel Distrib. Systems doi: 10.1109/71.722221 – volume: 17 start-page: 685 year: 1974 ident: 10.1006/jpdc.1999.1578_RF1 article-title: A comparison of list scheduling for parallel processing systems publication-title: Comm. ACM doi: 10.1145/361604.361619 – volume: 7 start-page: 46 year: 1996 ident: 10.1006/jpdc.1999.1578_RF32 article-title: Task clustering and scheduling for distributed memory parallel architectures publication-title: IEEE Trans. Parallel Distrib. Systems doi: 10.1109/71.481597 – year: 1993 ident: 10.1006/jpdc.1999.1578_RF11 article-title: Performance evaluation of a novel scheduling method: Linear clustering with task duplication – year: 1987 ident: 10.1006/jpdc.1999.1578_RF27 article-title: Duplication scheduling heuristic (DSH): A new precedence task scheduler for parallel processor systems publication-title: Technical Report – volume: 14 start-page: 141 year: 1988 ident: 10.1006/jpdc.1999.1578_RF10 article-title: A taxonomy of scheduling in general-purpose distributed computing systems publication-title: IEEE Trans. Software Eng. doi: 10.1109/32.4634 – volume: 7 start-page: 371 year: 1995 ident: 10.1006/jpdc.1999.1578_RF38 article-title: Comparative study of task duplication static scheduling versus clustering and non-clustering techniques publication-title: Concurrency: Practice and Experience doi: 10.1002/cpe.4330070504 – volume: 1 start-page: 330 year: 1990 ident: 10.1006/jpdc.1999.1578_RF42 article-title: Hypercool: a programming aid for message-passing systems publication-title: IEEE Trans. Parallel Distrib. Systems doi: 10.1109/71.80160 – volume: 19 start-page: 841 year: 1961 ident: 10.1006/jpdc.1999.1578_RF20 article-title: Parallel sequencing and assembly line problems publication-title: Oper. Res. doi: 10.1287/opre.9.6.841 – volume: 16 start-page: 276 year: 1992 ident: 10.1006/jpdc.1999.1578_RF19 article-title: A comparison of clustering heuristics for scheduling DAGs on multiprocessors publication-title: J. Parallel Distrib. Comput. doi: 10.1016/0743-7315(92)90012-C – year: 1997 ident: 10.1006/jpdc.1999.1578_RF5 article-title: Automatic parallelization and scheduling of programs on multiprocessors using CASH – year: 1997 ident: 10.1006/jpdc.1999.1578_RF35 article-title: DFRN: A new approach for duplication based scheduling for distributed memory multiprocessor systems – volume: 9 start-page: 138 year: 1990 ident: 10.1006/jpdc.1999.1578_RF16 article-title: Scheduling parallel programs onto arbitrary target machines publication-title: J. Parallel Distrib. Comput. doi: 10.1016/0743-7315(90)90042-N – year: 1994 ident: 10.1006/jpdc.1999.1578_RF31 article-title: A bottom-up approach to task scheduling on distibuted memory multiprocessor – volume: 5 start-page: 951 year: 1994 ident: 10.1006/jpdc.1999.1578_RF44 article-title: DSC: Scheduling parallel tasks on an unbounded number of processors publication-title: IEEE Trans. Parallel Distrib. Systems doi: 10.1109/71.308533 – volume: C-22 start-page: 745 year: 1973 ident: 10.1006/jpdc.1999.1578_RF17 article-title: Bounds on the number of processors and time for multiprocessor optimal schedules publication-title: IEEE Trans. Comput. doi: 10.1109/TC.1973.5009153 – volume: C-33 start-page: 1023 year: 1984 ident: 10.1006/jpdc.1999.1578_RF24 article-title: Practical multiprocessor scheduling algorithms for efficient parallel processing publication-title: IEEE Trans. Comput. doi: 10.1109/TC.1984.1676376 – year: 1988 ident: 10.1006/jpdc.1999.1578_RF26 article-title: A general approach to mapping of parallel computation upon multiprocessor architectures – volume: 10 start-page: 222 year: 1990 ident: 10.1006/jpdc.1999.1578_RF39 article-title: Analysis and evalutation of heuristic methods for static scheduling publication-title: J. Parallel Distrib. Comput. doi: 10.1016/0743-7315(90)90014-G – volume: C-21 start-page: 137 year: 1972 ident: 10.1006/jpdc.1999.1578_RF36 article-title: Optimal scheduling strategies in a multiprocessor system publication-title: IEEE Trans. Comput. doi: 10.1109/TC.1972.5008918 – volume: 10 start-page: 384 year: 1975 ident: 10.1006/jpdc.1999.1578_RF41 article-title: NP-complete scheduling problems publication-title: J. Comput. System Sci. doi: 10.1016/S0022-0000(75)80008-0 – volume: 39 start-page: 680 year: 1991 ident: 10.1006/jpdc.1999.1578_RF14 article-title: C.P.M. scheduling with small computation delays and task duplication publication-title: Oper. Res. doi: 10.1287/opre.39.4.680 – volume: 11 start-page: 414 year: 1999 ident: 10.1006/jpdc.1999.1578_RF3 article-title: On parallelizing the multiprocessor scheduling problem publication-title: IEEE Trans. Parallel Distrib. Systems doi: 10.1109/71.762819 – year: 1992 ident: 10.1006/jpdc.1999.1578_RF12 article-title: Application and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed-memory multiprocessors – year: 1998 ident: 10.1006/jpdc.1999.1578_RF22 – volume: 3 start-page: 53 year: 1993 ident: 10.1006/jpdc.1999.1578_RF6 article-title: The time complexity of scheduling interval orders with communication is polynomial publication-title: Parallel Process. Lett. doi: 10.1142/S0129626493000083 – volume: 32 start-page: 1073 year: 1989 ident: 10.1006/jpdc.1999.1578_RF30 article-title: Automatic determination of grain size for efficient parallel processing publication-title: Comm. ACM doi: 10.1145/66451.66454 – year: 1994 ident: 10.1006/jpdc.1999.1578_RF25 article-title: A comparison of multiprocessor scheduling heuristic – volume: 8 start-page: 405 year: 1979 ident: 10.1006/jpdc.1999.1578_RF33 article-title: Scheduling interval-ordered tasks publication-title: SIAM J. Comput. doi: 10.1137/0208031
SSID	ssj0011578
Score	2.0536892
Snippet	The problem of scheduling a parallel program represented by a weighted directed acyclic graph (DAG) to a set of homogeneous processors for minimizing the...
SourceID	pascalfrancis crossref elsevier
SourceType	Index Database Enrichment Source Publisher
StartPage	381
SubjectTerms	Applied sciences benchmarks Computer science; control theory; systems Computer systems and distributed systems. User interface Exact sciences and technology multiprocessors parallel processing performance evaluation scalability scheduling Software task graphs
Title	Benchmarking and Comparison of the Task Graph Scheduling Algorithms
URI	https://dx.doi.org/10.1006/jpdc.1999.1578
Volume	59
WOSCitedRecordID	wos000084113900003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1096-0848 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011578 issn: 0743-7315 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Pb9MwFLZGxwEJwQZMbDDkAxKHKaOJEzs-ljG0ARscBvQWxY69VevSqsnQ_nyefzXtpgp24BKlThpH_l6e30v8vg-ht0lWUQ3HIkHjKkqJYhEXvDRMmJyXWSWJ_YL_8ys7Pc2HQ_7dyx01Vk6A1XV-c8On_xVqaAOwTensPeCeXxQaYB9Ahy3ADtt_Av4D3MzFVWnfgYeqtU5q0Aaabdlc7lmq6j1IbmGysTXp5fh8Mhu1F56__G7EamjCx2PlyAUqw7hrxLKU6-G6DZOgcd-_vn2xzn0_6lYEHJ0MPnbvaStfesdvrdoIJTALHsrwmzLi6jGDO_UE36PFbNv6RuK0Wfw0m7py5DseHLyA8eDTSppCSr4fZ07iZ5kq-9YUNl9YGBs1-DR_gNYTlvG8h9YHx4fDz_PvSuZqgZjV3Hig8ezT98tdrgpTHk_LBh4e7VRPFkKRsw30xCOCBw77TbSm6mfoqc8nsPfWDTQFyY7Q9hwdLFoHBhxxZx14ojFYBzbWga114M46cGcdL9CPT4dnB0eR19GIJIx5G5U5Y0oSiGVzzkQlWVYpcN1Kp1TrfqKFIFxSDZkABNuKx1xAmpokZawYI5QIsoV69aRWLxHmAgK8hAupOU01g-Ca9hPI-BX8lkKxbRSFYSukJ5k3WifjwtFj08IMc2GGuTDDvI3ezc-fOnqVlWfGAYXCB4cu6CvAclb-Z3cJrq4LZyY7fzn-Cj3qnoPXqNfOrtUueih_t6Nm9sbb1h__Eoy4
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Benchmarking+and+comparison+of+the+task+graph+scheduling+algorithms&rft.jtitle=Journal+of+parallel+and+distributed+computing&rft.au=KWOK%2C+Y.-K&rft.au=AHMAD%2C+I&rft.date=1999-12-01&rft.pub=Elsevier&rft.issn=0743-7315&rft.volume=59&rft.issue=3&rft.spage=381&rft.epage=422&rft_id=info:doi/10.1006%2Fjpdc.1999.1578&rft.externalDBID=n%2Fa&rft.externalDocID=1202348
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-7315&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-7315&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-7315&client=summon