List Scheduling Algorithm for Heterogeneous Systems by an Optimistic Cost Table

Efficient application scheduling algorithms are important for obtaining high performance in heterogeneous computing systems. In this paper, we present a novel list-based scheduling algorithm called Predict Earliest Finish Time (PEFT) for heterogeneous computing systems. The algorithm has the same ti...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on parallel and distributed systems Ročník 25; číslo 3; s. 682 - 694
Hlavní autoři:	Arabnejad, Hamid, Barbosa, Jorge G.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.03.2014 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms Application scheduling Computation DAG scheduling Graphs Heuristic algorithms Processors Program processors random graphs generator Schedules Scheduling Scheduling algorithms State of the art static scheduling Tables (data) Tasks Time complexity
ISSN:	1045-9219, 1558-2183
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	Efficient application scheduling algorithms are important for obtaining high performance in heterogeneous computing systems. In this paper, we present a novel list-based scheduling algorithm called Predict Earliest Finish Time (PEFT) for heterogeneous computing systems. The algorithm has the same time complexity as the state-of-the-art algorithm for the same purpose, that is, O(v2.p) for v tasks and p processors, but offers significant makespan improvements by introducing a look-ahead feature without increasing the time complexity associated with computation of an optimistic cost table (OCT). The calculated value is an optimistic cost because processor availability is not considered in the computation. Our algorithm is only based on an OCT that is used to rank tasks and for processor selection. The analysis and experiments based on randomly generated graphs with various characteristics and graphs of real-world applications show that the PEFT algorithm outperforms the state-of-the-art list-based algorithms for heterogeneous systems in terms of schedule length ratio, efficiency, and frequency of best results.
AbstractList	Efficient application scheduling algorithms are important for obtaining high performance in heterogeneous computing systems. In this paper, we present a novel list-based scheduling algorithm called Predict Earliest Finish Time (PEFT) for heterogeneous computing systems. The algorithm has the same time complexity as the state-of-the-art algorithm for the same purpose, that is, $(O(v arrow up .p))$ for $(v)$ tasks and $(p)$ processors, but offers significant makespan improvements by introducing a look-ahead feature without increasing the time complexity associated with computation of an optimistic cost table (OCT). The calculated value is an optimistic cost because processor availability is not considered in the computation. Our algorithm is only based on an OCT that is used to rank tasks and for processor selection. The analysis and experiments based on randomly generated graphs with various characteristics and graphs of real-world applications show that the PEFT algorithm outperforms the state-of-the-art list-based algorithms for heterogeneous systems in terms of schedule length ratio, efficiency, and frequency of best results. Efficient application scheduling algorithms are important for obtaining high performance in heterogeneous computing systems. In this paper, we present a novel list-based scheduling algorithm called Predict Earliest Finish Time (PEFT) for heterogeneous computing systems. The algorithm has the same time complexity as the state-of-the-art algorithm for the same purpose, that is, $(O(v^2.p))$ for $(v)$ tasks and $(p)$ processors, but offers significant makespan improvements by introducing a look-ahead feature without increasing the time complexity associated with computation of an optimistic cost table (OCT). The calculated value is an optimistic cost because processor availability is not considered in the computation. Our algorithm is only based on an OCT that is used to rank tasks and for processor selection. The analysis and experiments based on randomly generated graphs with various characteristics and graphs of real-world applications show that the PEFT algorithm outperforms the state-of-the-art list-based algorithms for heterogeneous systems in terms of schedule length ratio, efficiency, and frequency of best results. Efficient application scheduling algorithms are important for obtaining high performance in heterogeneous computing systems. In this paper, we present a novel list-based scheduling algorithm called Predict Earliest Finish Time (PEFT) for heterogeneous computing systems. The algorithm has the same time complexity as the state-of-the-art algorithm for the same purpose, that is, O(v2.p) for v tasks and p processors, but offers significant makespan improvements by introducing a look-ahead feature without increasing the time complexity associated with computation of an optimistic cost table (OCT). The calculated value is an optimistic cost because processor availability is not considered in the computation. Our algorithm is only based on an OCT that is used to rank tasks and for processor selection. The analysis and experiments based on randomly generated graphs with various characteristics and graphs of real-world applications show that the PEFT algorithm outperforms the state-of-the-art list-based algorithms for heterogeneous systems in terms of schedule length ratio, efficiency, and frequency of best results.
Author	Barbosa, Jorge G. Arabnejad, Hamid
Author_xml	– sequence: 1 givenname: Hamid surname: Arabnejad fullname: Arabnejad, Hamid email: hamid.arabnejad@fe.up.pt organization: Dept. de Eng. Inf., Lab. de Intel. Artificial e Cienc. dos Comput., Univ. do Porto, Porto, Portugal – sequence: 2 givenname: Jorge G. surname: Barbosa fullname: Barbosa, Jorge G. email: jbarbosa@fe.up.pt organization: Dept. de Eng. Inf., Lab. de Intel. Artificial e Cienc. dos Comput., Univ. do Porto, Porto, Portugal
BookMark	eNp1kDFv2zAQhYkiAWon3bp1IdClQ-TwRFISR8Nt6gIGHMDOTFDU0WEgiy5JD_73keMiQ4BOd8P3PTy8KbkawoCEfAU2A2Dqfvv4czMrGfCZrD-RCUjZFCU0_Gr8mZCFKkF9JtOUXhgDIZmYkPXKp0w39hm7Y--HHZ33uxB9ft5TFyJdYsYYdjhgOCa6OaWM-0TbEzUDXR-y34-2t3QRxpCtaXu8JdfO9Am__Ls35Onh13axLFbr338W81VhuShz4doKOJfWgcOuQtnYTjbYqLYzLetAooOq64xsFTcceM0ctE7Y0ijHhFOS35Afl9xDDH-PmLIeq1jse_NWVYMELlRdA4zo9w_oSzjGYWynQSgpZAn1ObC8UDaGlCI6bX022YchR-N7DUyfN9bnjfV5Yy3rUbr7IB2i35t4-h_-7YJ7RHxHK1GDqhR_BYrEiFc
CODEN	ITDSEO
CitedBy_id	crossref_primary_10_3390_electronics13040763 crossref_primary_10_4018_IJGHPC_2017070105 crossref_primary_10_1007_s00521_021_06289_9 crossref_primary_10_1007_s10115_024_02268_3 crossref_primary_10_1108_JEDT_11_2020_0474 crossref_primary_10_1007_s10586_024_04689_9 crossref_primary_10_1002_cpe_5842 crossref_primary_10_1007_s10951_024_00831_y crossref_primary_10_1016_j_sysarc_2022_102741 crossref_primary_10_1007_s11227_014_1368_6 crossref_primary_10_1109_TSUSC_2023_3295939 crossref_primary_10_1016_j_jpdc_2015_10_001 crossref_primary_10_1109_TCC_2023_3269144 crossref_primary_10_1007_s10586_022_03819_5 crossref_primary_10_3233_WEB_220094 crossref_primary_10_1109_TCC_2024_3468913 crossref_primary_10_1007_s11227_024_06550_7 crossref_primary_10_1007_s41870_018_0231_z crossref_primary_10_1002_cpe_4639 crossref_primary_10_1007_s41870_021_00787_8 crossref_primary_10_1007_s11277_023_10337_z crossref_primary_10_1109_JIOT_2024_3524506 crossref_primary_10_1109_TC_2023_3278541 crossref_primary_10_1109_TVT_2024_3389951 crossref_primary_10_1016_j_sysarc_2022_102739 crossref_primary_10_1049_tje2_12059 crossref_primary_10_1109_TSUSC_2017_2705183 crossref_primary_10_1016_j_knosys_2023_110369 crossref_primary_10_1007_s11227_022_04687_x crossref_primary_10_1145_3767164 crossref_primary_10_1109_TWC_2024_3483658 crossref_primary_10_1007_s00607_021_00930_0 crossref_primary_10_1016_j_jss_2015_06_016 crossref_primary_10_1145_3610300 crossref_primary_10_1155_2019_6543957 crossref_primary_10_1109_TASE_2021_3054501 crossref_primary_10_3390_s21165430 crossref_primary_10_1016_j_jpdc_2022_05_011 crossref_primary_10_1007_s11831_024_10069_8 crossref_primary_10_1016_j_comnet_2022_109490 crossref_primary_10_1016_j_future_2016_10_003 crossref_primary_10_1002_cpe_8217 crossref_primary_10_1109_TVT_2024_3387548 crossref_primary_10_1016_j_future_2015_07_021 crossref_primary_10_1016_j_jpdc_2017_06_005 crossref_primary_10_1109_TSC_2025_3536309 crossref_primary_10_1002_cpe_5060 crossref_primary_10_1016_j_simpat_2016_02_006 crossref_primary_10_1016_j_jpdc_2024_104915 crossref_primary_10_1016_j_future_2019_12_054 crossref_primary_10_1002_cpe_5063 crossref_primary_10_1007_s11227_023_05186_3 crossref_primary_10_1109_TII_2016_2571667 crossref_primary_10_1016_j_procs_2019_12_131 crossref_primary_10_1007_s10723_021_09552_4 crossref_primary_10_3390_s21206857 crossref_primary_10_1007_s11227_023_05806_y crossref_primary_10_1007_s00607_024_01327_5 crossref_primary_10_1109_TPDS_2020_2984719 crossref_primary_10_1109_TVT_2023_3266582 crossref_primary_10_1109_TPDS_2018_2851221 crossref_primary_10_26599_TST_2022_9010065 crossref_primary_10_1007_s11227_018_2726_6 crossref_primary_10_1002_cpe_5987 crossref_primary_10_1016_j_future_2017_04_025 crossref_primary_10_1016_j_future_2024_04_028 crossref_primary_10_1145_3616869 crossref_primary_10_1007_s10586_019_02965_7 crossref_primary_10_1111_exsy_12356 crossref_primary_10_1155_2014_465702 crossref_primary_10_1109_TSC_2025_3536317 crossref_primary_10_1007_s42514_022_00116_w crossref_primary_10_1016_j_sysarc_2021_102385 crossref_primary_10_1109_TNSM_2024_3387707 crossref_primary_10_1007_s11227_017_1991_0 crossref_primary_10_1016_j_jss_2017_10_001 crossref_primary_10_1145_3462776 crossref_primary_10_1007_s10723_016_9386_7 crossref_primary_10_1016_j_sysarc_2024_103173 crossref_primary_10_1007_s11227_022_04323_8 crossref_primary_10_1016_j_sysarc_2016_04_008 crossref_primary_10_1109_TCAD_2024_3445815 crossref_primary_10_1186_s13677_022_00374_7 crossref_primary_10_1109_TGRS_2023_3327279 crossref_primary_10_1109_JIOT_2022_3168885 crossref_primary_10_1007_s40747_021_00528_1 crossref_primary_10_1109_TPDS_2023_3245089 crossref_primary_10_1002_cpe_6456 crossref_primary_10_1109_ACCESS_2024_3462518 crossref_primary_10_1016_j_jcss_2017_01_005 crossref_primary_10_1016_j_jpdc_2019_01_006 crossref_primary_10_1109_TMC_2020_3040007 crossref_primary_10_1007_s11042_018_7051_9 crossref_primary_10_1145_3358236 crossref_primary_10_1016_j_future_2019_07_043 crossref_primary_10_1007_s11227_023_05325_w crossref_primary_10_1109_TMC_2024_3453069 crossref_primary_10_1007_s11227_016_1637_7 crossref_primary_10_3390_app13095412 crossref_primary_10_3390_electronics10020209 crossref_primary_10_1007_s10586_025_05576_7 crossref_primary_10_1007_s12065_022_00751_w crossref_primary_10_1109_TPDS_2021_3076687 crossref_primary_10_3390_fi13100263 crossref_primary_10_1002_cpe_7306 crossref_primary_10_1007_s11227_018_2553_9 crossref_primary_10_1016_j_ins_2016_08_003 crossref_primary_10_1007_s10586_024_04468_6 crossref_primary_10_1109_TII_2022_3188347 crossref_primary_10_1109_TNSE_2023_3272351 crossref_primary_10_1109_JSYST_2021_3087527 crossref_primary_10_1109_ACCESS_2019_2956759 crossref_primary_10_1109_ACCESS_2018_2825648 crossref_primary_10_1155_2022_7862911 crossref_primary_10_1145_3563946 crossref_primary_10_1007_s00500_017_2897_8 crossref_primary_10_1016_j_future_2016_11_016 crossref_primary_10_1007_s11227_015_1438_4 crossref_primary_10_1016_j_future_2023_10_015 crossref_primary_10_1002_cpe_4731 crossref_primary_10_1007_s10586_019_02978_2 crossref_primary_10_1016_j_sysarc_2020_101916 crossref_primary_10_1016_j_future_2016_01_004 crossref_primary_10_1109_ACCESS_2021_3063456 crossref_primary_10_1007_s10922_024_09863_3 crossref_primary_10_1016_j_cosrev_2021_100416 crossref_primary_10_1016_j_swevo_2021_100841 crossref_primary_10_4018_IJIRR_2019100101 crossref_primary_10_1007_s10723_015_9355_6 crossref_primary_10_1109_ACCESS_2023_3234998 crossref_primary_10_1109_TPDS_2021_3059447 crossref_primary_10_1007_s10586_023_04061_3 crossref_primary_10_1109_TC_2021_3052389 crossref_primary_10_1142_S0218126625503244 crossref_primary_10_3390_su11071826 crossref_primary_10_1016_j_compeleceng_2025_110377 crossref_primary_10_1177_1550147717742073 crossref_primary_10_1002_spe_2555 crossref_primary_10_1007_s11036_019_01356_x crossref_primary_10_1109_TMC_2021_3123165 crossref_primary_10_3389_fenrg_2024_1358310 crossref_primary_10_1007_s00607_017_0558_5 crossref_primary_10_1016_j_parco_2021_102828 crossref_primary_10_1007_s11227_019_02892_9 crossref_primary_10_1016_j_jksuci_2021_05_011 crossref_primary_10_1109_TCAD_2020_3012861 crossref_primary_10_1109_TKDE_2018_2884724 crossref_primary_10_1016_j_sysarc_2019_101706 crossref_primary_10_1109_TC_2022_3191970 crossref_primary_10_1016_j_sysarc_2025_103434 crossref_primary_10_1109_TVT_2024_3385108 crossref_primary_10_1145_3631527 crossref_primary_10_1016_j_neucom_2018_11_034 crossref_primary_10_1109_ACCESS_2024_3507376 crossref_primary_10_1007_s10586_024_04833_5 crossref_primary_10_1016_j_future_2015_08_009 crossref_primary_10_1051_itmconf_20160708001 crossref_primary_10_1016_j_comnet_2025_111445 crossref_primary_10_1109_ACCESS_2017_2715279 crossref_primary_10_1155_2016_3676149 crossref_primary_10_1109_ACCESS_2020_3037205 crossref_primary_10_1016_j_future_2025_107941 crossref_primary_10_1016_j_sysarc_2020_101936 crossref_primary_10_1002_spe_3153 crossref_primary_10_1007_s10723_023_09711_9 crossref_primary_10_1109_TSC_2021_3051046 crossref_primary_10_1007_s11227_022_04703_0 crossref_primary_10_1016_j_future_2019_05_002 crossref_primary_10_1109_ACCESS_2019_2957998 crossref_primary_10_1155_2021_9529022 crossref_primary_10_1109_TCAD_2017_2717782 crossref_primary_10_1007_s12083_018_0662_0 crossref_primary_10_1587_transinf_2016EDP7346 crossref_primary_10_1109_TII_2019_2962531 crossref_primary_10_1016_j_jksuci_2019_02_010 crossref_primary_10_1007_s00607_023_01175_9 crossref_primary_10_1016_j_micpro_2019_01_011 crossref_primary_10_1007_s00607_018_0636_3 crossref_primary_10_1002_cpe_6520 crossref_primary_10_1016_j_jestch_2023_101611 crossref_primary_10_1007_s11227_021_03789_2 crossref_primary_10_1007_s10586_024_04843_3 crossref_primary_10_1007_s11277_018_5895_y crossref_primary_10_1145_3687463 crossref_primary_10_4018_IJDST_2018100102 crossref_primary_10_1016_j_future_2024_107678 crossref_primary_10_1109_TASE_2020_3046673 crossref_primary_10_1109_ACCESS_2019_2957765 crossref_primary_10_1109_TSUSC_2017_2711362 crossref_primary_10_1007_s12652_020_02884_1 crossref_primary_10_1016_j_knosys_2021_107255 crossref_primary_10_1016_j_jocs_2016_09_008 crossref_primary_10_1016_j_eswa_2023_121327 crossref_primary_10_4018_JITR_2018100110 crossref_primary_10_1007_s11227_018_2355_0 crossref_primary_10_1109_TCAD_2021_3049688 crossref_primary_10_1002_ett_4744 crossref_primary_10_1007_s11390_019_1962_4 crossref_primary_10_1016_j_knosys_2024_111366 crossref_primary_10_1016_j_sysarc_2023_103051 crossref_primary_10_1080_03772063_2018_1486740 crossref_primary_10_3390_app13010191 crossref_primary_10_1007_s11227_016_1917_2 crossref_primary_10_1155_2022_6752527 crossref_primary_10_1016_j_mejo_2022_105367 crossref_primary_10_1016_j_micpro_2023_104802 crossref_primary_10_1109_JIOT_2025_3567149 crossref_primary_10_1109_TPDS_2022_3232326 crossref_primary_10_1016_j_future_2024_02_025 crossref_primary_10_1109_TASE_2023_3247973 crossref_primary_10_1002_spe_3292 crossref_primary_10_1016_j_cie_2024_110450 crossref_primary_10_1007_s10586_017_0976_3 crossref_primary_10_1109_ACCESS_2021_3074833 crossref_primary_10_1016_j_ijepes_2022_108292 crossref_primary_10_1007_s00500_018_3657_0 crossref_primary_10_1109_TNSE_2024_3496902 crossref_primary_10_1002_cpe_5573 crossref_primary_10_1016_j_elerap_2019_100884 crossref_primary_10_1109_TR_2024_3377732 crossref_primary_10_1145_3701997 crossref_primary_10_1109_TPDS_2020_3014896 crossref_primary_10_4018_IJWSR_2021100101 crossref_primary_10_1016_j_cpc_2021_107844 crossref_primary_10_1016_j_procs_2014_05_046 crossref_primary_10_1016_j_jocs_2022_101873 crossref_primary_10_1016_j_cor_2024_106805 crossref_primary_10_1016_j_jksuci_2020_02_006 crossref_primary_10_1109_ACCESS_2020_2971351 crossref_primary_10_1109_ACCESS_2019_2911653 crossref_primary_10_1109_JIOT_2023_3237727 crossref_primary_10_1016_j_future_2017_07_052 crossref_primary_10_1016_j_comcom_2023_08_023 crossref_primary_10_1016_j_comnet_2021_108361 crossref_primary_10_1007_s00607_021_00935_9 crossref_primary_10_1016_j_procs_2015_11_053 crossref_primary_10_1109_COMST_2022_3199544 crossref_primary_10_1007_s10586_025_05468_w crossref_primary_10_1109_ACCESS_2020_2974188 crossref_primary_10_1016_j_ins_2022_05_053 crossref_primary_10_1016_j_jocs_2022_101805 crossref_primary_10_1002_cpe_7148 crossref_primary_10_1080_09540091_2022_2052265 crossref_primary_10_1109_TVT_2017_2674302 crossref_primary_10_1007_s40031_024_01113_z crossref_primary_10_3390_mi13071067 crossref_primary_10_25046_aj0203192 crossref_primary_10_1007_s11227_021_03685_9 crossref_primary_10_1145_3711849 crossref_primary_10_1109_TPDS_2017_2730876 crossref_primary_10_1109_TC_2021_3131040 crossref_primary_10_1007_s11227_016_1711_1 crossref_primary_10_1109_TVT_2023_3238771 crossref_primary_10_1109_TPDS_2017_2735400 crossref_primary_10_1145_3477037 crossref_primary_10_1109_TVT_2023_3329141 crossref_primary_10_1007_s00521_019_04118_8 crossref_primary_10_1186_s13677_017_0081_4 crossref_primary_10_3390_en14123473 crossref_primary_10_1007_s11276_023_03283_y crossref_primary_10_1016_j_future_2025_107733 crossref_primary_10_3389_fenvs_2022_996483 crossref_primary_10_1007_s00500_018_3229_3 crossref_primary_10_1007_s11227_018_2498_z crossref_primary_10_1007_s10586_024_04732_9 crossref_primary_10_1109_TSC_2019_2923912 crossref_primary_10_1109_TMC_2021_3112466 crossref_primary_10_1007_s11227_023_05109_2 crossref_primary_10_1109_TPDS_2021_3053150 crossref_primary_10_1016_j_comcom_2023_04_020 crossref_primary_10_1002_spe_2802 crossref_primary_10_1051_matecconf_201711901047 crossref_primary_10_1109_TPDS_2021_3135876 crossref_primary_10_1109_JIOT_2024_3491944 crossref_primary_10_1109_ACCESS_2020_2993069 crossref_primary_10_1109_TPDS_2016_2526682 crossref_primary_10_1186_s13677_023_00434_6 crossref_primary_10_1016_j_sysarc_2021_102329 crossref_primary_10_1109_TPDS_2018_2808959 crossref_primary_10_1109_TCAD_2021_3059569 crossref_primary_10_3390_electronics11162557 crossref_primary_10_1145_3702236 crossref_primary_10_1109_TASE_2023_3336807 crossref_primary_10_3390_app10061937 crossref_primary_10_1007_s00607_017_0581_6 crossref_primary_10_1109_JIOT_2024_3374969 crossref_primary_10_1007_s13042_024_02115_5 crossref_primary_10_1016_j_autcon_2024_105520 crossref_primary_10_1016_j_future_2018_03_055 crossref_primary_10_1007_s11227_022_04684_0 crossref_primary_10_1016_j_simpat_2016_10_009 crossref_primary_10_1016_j_future_2015_01_004 crossref_primary_10_1016_j_jss_2015_11_023 crossref_primary_10_3233_JCM_170755 crossref_primary_10_1016_j_future_2019_10_003 crossref_primary_10_1016_j_ins_2019_10_035 crossref_primary_10_1007_s42514_022_00098_9 crossref_primary_10_1109_TPDS_2020_3041829 crossref_primary_10_1016_j_future_2025_107758 crossref_primary_10_1002_cpe_5654 crossref_primary_10_1016_j_future_2024_107576 crossref_primary_10_1016_j_sysarc_2023_102938 crossref_primary_10_1002_cpe_7150 crossref_primary_10_1109_TCAD_2022_3228504 crossref_primary_10_1007_s11227_017_2094_7 crossref_primary_10_1109_ACCESS_2023_3314735 crossref_primary_10_1007_s11042_023_14739_w crossref_primary_10_1016_j_compeleceng_2023_108653 crossref_primary_10_3390_electronics9060936 crossref_primary_10_1109_TMC_2022_3188770 crossref_primary_10_1109_ACCESS_2020_2977496 crossref_primary_10_1002_cpe_5898 crossref_primary_10_1142_S0219649221500350 crossref_primary_10_1016_j_engappai_2025_110337
Cites_doi	10.1016/0743-7315(90)90042-N 10.1109/71.993206 10.1109/71.707547 10.1002/jos.115 10.1109/HCW.2000.843747 10.1016/j.jpdc.2007.05.015 10.1016/j.parco.2005.04.002 10.3844/jcssp.2007.94.103 10.1007/11564621_22 10.1109/71.207593 10.1109/SUPERC.1992.236653 10.1007/978-1-84628-757-2_4 10.1109/ISPDC.2003.1267650 10.1007/978-3-642-29737-3_49 10.1109/CLUSTR.2006.311868 10.1007/BFb0024750 10.1155/2005/128026 10.1109/71.80160 10.1109/SBAC-PAD.2004.1 10.1109/ICPPW.2001.951956 10.1006/jpdc.1999.1581 10.1109/HCW.1999.765092 10.1016/S0022-0000(75)80008-0 10.1007/978-0-387-09457-1_7 10.1109/PDP.2010.56
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Mar 2014
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Mar 2014
DBID	97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3
DOI	10.1109/TPDS.2013.57
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering Engineering Research Database
DatabaseTitle	CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList	Technology Research Database Technology Research Database
Database_xml	– sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science
EISSN	1558-2183
EndPage	694
ExternalDocumentID	3208824681 10_1109_TPDS_2013_57 6471969
Genre	orig-research
GroupedDBID	--Z -~X .DC 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACIWK AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD HZ~ H~9 ICLAB IEDLZ IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNI RNS RZB TN5 TWZ UHB VH1 AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D RIG F28 FR3
ID	FETCH-LOGICAL-c342t-fb61335cf1fed6e58cd58e89bdab0d15ef16dda5b93a31370f1bf4c2a9f04f953
IEDL.DBID	RIE
ISICitedReferencesCount	461
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000334672200016&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	1045-9219
IngestDate	Sun Sep 28 09:09:52 EDT 2025 Mon Jun 30 05:45:09 EDT 2025 Tue Nov 18 22:05:37 EST 2025 Sat Nov 29 08:05:40 EST 2025 Wed Aug 27 02:52:20 EDT 2025
IsDoiOpenAccess	false
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	3
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c342t-fb61335cf1fed6e58cd58e89bdab0d15ef16dda5b93a31370f1bf4c2a9f04f953
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23
OpenAccessLink	http://hdl.handle.net/10216/97674
PQID	1495452175
PQPubID	85437
PageCount	13
ParticipantIDs	crossref_citationtrail_10_1109_TPDS_2013_57 proquest_miscellaneous_1513497711 crossref_primary_10_1109_TPDS_2013_57 ieee_primary_6471969 proquest_journals_1495452175
PublicationCentury	2000
PublicationDate	2014-03-01
PublicationDateYYYYMMDD	2014-03-01
PublicationDate_xml	– month: 03 year: 2014 text: 2014-03-01 day: 01
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE transactions on parallel and distributed systems
PublicationTitleAbbrev	TPDS
PublicationYear	2014
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref12 ref15 ref14 ref31 ref30 ref11 ref10 ref32 ref16 ref19 ref18 (ref1) 2013 Garey (ref17) 1979 ref24 ref23 ref26 ref25 ref20 ref21 Coffman (ref13) 1976 Berriman (ref5) Iverson (ref22) ref27 (ref2) 2013 ref29 ref8 ref7 ref9 ref4 ref3 ref6 Suter (ref28) 2010
References_xml	– ident: ref16 doi: 10.1016/0743-7315(90)90042-N – year: 2010 ident: ref28 article-title: DAG Generation Program – ident: ref30 doi: 10.1109/71.993206 – ident: ref3 doi: 10.1109/71.707547 – ident: ref8 doi: 10.1002/jos.115 – ident: ref25 doi: 10.1109/HCW.2000.843747 – volume-title: Montage: An Astronomical Image Mosaic Engine year: 2013 ident: ref1 – ident: ref14 doi: 10.1016/j.jpdc.2007.05.015 – volume-title: USC Epigenome Center year: 2013 ident: ref2 – ident: ref19 doi: 10.1016/j.parco.2005.04.002 – ident: ref20 doi: 10.3844/jcssp.2007.94.103 – ident: ref21 doi: 10.1007/11564621_22 – ident: ref27 doi: 10.1109/71.207593 – volume-title: Computers and Intractability: A Guide to the Theory of NP-Completeness year: 1979 ident: ref17 – ident: ref11 doi: 10.1109/SUPERC.1992.236653 – ident: ref9 doi: 10.1007/978-1-84628-757-2_4 – ident: ref18 doi: 10.1109/ISPDC.2003.1267650 – ident: ref4 doi: 10.1007/978-3-642-29737-3_49 – ident: ref26 doi: 10.1109/CLUSTR.2006.311868 – ident: ref24 doi: 10.1007/BFb0024750 – volume-title: Computer and Job-Shop Scheduling Theory year: 1976 ident: ref13 – ident: ref15 doi: 10.1155/2005/128026 – ident: ref32 doi: 10.1109/71.80160 – ident: ref7 doi: 10.1109/SBAC-PAD.2004.1 – ident: ref12 doi: 10.1109/ICPPW.2001.951956 – ident: ref23 doi: 10.1006/jpdc.1999.1581 – ident: ref29 doi: 10.1109/HCW.1999.765092 – ident: ref31 doi: 10.1016/S0022-0000(75)80008-0 – start-page: 593 volume-title: Proc. Astronomical Data Analysis Software and Systems (ADASS) XIII ident: ref5 article-title: Montage: A Grid Enabled Image Mosaic Service for the National Virtual Observatory – ident: ref10 doi: 10.1007/978-0-387-09457-1_7 – ident: ref6 doi: 10.1109/PDP.2010.56 – start-page: 93 volume-title: Proc. Fourth Heterogeneous Computing Workshop (HCW ’95) ident: ref22 article-title: Parallelizing Existing Applications in a Distributed Heterogeneous Environment
SSID	ssj0014504
Score	2.584124
Snippet	Efficient application scheduling algorithms are important for obtaining high performance in heterogeneous computing systems. In this paper, we present a novel...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	682
SubjectTerms	Algorithms Application scheduling Computation DAG scheduling Graphs Heuristic algorithms Processors Program processors random graphs generator Schedules Scheduling Scheduling algorithms State of the art static scheduling Tables (data) Tasks Time complexity
Title	List Scheduling Algorithm for Heterogeneous Systems by an Optimistic Cost Table
URI	https://ieeexplore.ieee.org/document/6471969 https://www.proquest.com/docview/1495452175 https://www.proquest.com/docview/1513497711
Volume	25
WOSCitedRecordID	wos000334672200016&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: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1558-2183 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014504 issn: 1045-9219 databaseCode: RIE dateStart: 19900101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlR3JSsUwcFDxoAd38bkRQU9abZqkbY7iggdRwSd4K1lV0Fd5i-DfO8nrK4J68FbIkISZzNbZAPZzlXkjlU2cQm7iuRFJaShLKPfeCWllKWOh8HVxc1M-Psq7KThqa2GcczH5zB2HzxjLt7UZhV9lJzlKUpnLaZguinxcq9VGDLiIowLRuxCJRDZsk9zlSffu_D4kcbHjoIS-qZ84T-WHEI6a5XLxf3dagoXGgiSnY5Ivw5TrrcDiZDoDaZh1Bea_tRpchdtrpCcuPqNqCRXo5PT1qe6_DJ_fCJqt5CpkxdT4mFw9GpCmjTnRn0T1yC1KlbfYz5mc1bhJN1RbrcHD5UX37CpphikkhvFsmHiNipsJ46l3NneiNFaUrpTaKp1aKpynubVKaMkUo6xIPdWem0xJn3IvBVuHmV7dcxtAEE5nWmqTMsNLYZT1imsbYnQIn_EOHE5wXJmm03gYePFaRY8jlVWgSBUoUomiAwct9Pu4w8YfcKsB-y1Mg_gObE_IVzXsN6iC28fRMClEB_baZURViIaoiMoKTR3G0fqldPP3nbdgDo_m44SzbZgZ9kduB2bNx_Bl0N-Nr-8LA1Pa6g
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlR1dSxwxcFBb0D5o6wc9tW0K7VO752aT7G0exVau9HoKvYJvIZ8q6G25j4L_3klubxGqD74FMoQwk_nKfAF8KnURrNQu8xq5iZdWZJWlLKM8BC-kk5VMhcKD3nBYXVzI8xX42tbCeO9T8pnvxmWK5bvazuNX2VGJklSWchVeCM6LfFGt1cYMuEjDAtG_EJlERmzT3OXR6Pzb75jGxbpRDT1QQGmiyn9iOOmW063n3eo1bDY2JDleEP0NrPjxNmwt5zOQhl234dWDZoM7cDZAiuLmFSqXWINOjm8u68n17OqWoOFK-jEvpsbn5Ov5lDSNzIm5I3pMzlCu3KaOzuSkxkNGsd5qF_6cfh-d9LNmnEJmGS9mWTCoupmwgQbvSi8q60TlK2mcNrmjwgdaOqeFkUwzynp5oCZwW2gZch6kYHuwNq7H_i0QhDOFkcbmzPJKWO2C5sbFKB3CF7wDX5Y4VrbpNR5HXtyo5HPkUkWKqEgRJXod-NxC_1302HgCbidiv4VpEN-BwyX5VMOAUxUdP46mSU904GO7jaiK8RCdUKnQ2GEc7V9K9x8_-QOs90e_BmrwY_jzADbwGnyRfnYIa7PJ3L-Dl_bf7Ho6eZ9e4j2KEt4x
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=List+Scheduling+Algorithm+for+Heterogeneous+Systems+by+an+Optimistic+Cost+Table&rft.jtitle=IEEE+transactions+on+parallel+and+distributed+systems&rft.au=Arabnejad%2C+Hamid&rft.au=Barbosa%2C+Jorge+G.&rft.date=2014-03-01&rft.pub=IEEE&rft.issn=1045-9219&rft.volume=25&rft.issue=3&rft.spage=682&rft.epage=694&rft_id=info:doi/10.1109%2FTPDS.2013.57&rft.externalDocID=6471969
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1045-9219&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1045-9219&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1045-9219&client=summon