Analysis, evaluation, and comparison of algorithms for scheduling task graphs on parallel processors
In this paper, we survey algorithms that allocate a parallel program represented by an edge-weighted directed acyclic graph (DAG), also called a task graph or macro-dataflow graph, to a set of homogeneous processors, with the objective of minimizing the completion time. We analyze 21 such algorithms...
Uložené v:
| Vydané v: | Proceedings Second International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'96) s. 207 - 213 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
1996
|
| Predmet: | |
| ISBN: | 0818674601, 9780818674600 |
| ISSN: | 1087-4089 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | In this paper, we survey algorithms that allocate a parallel program represented by an edge-weighted directed acyclic graph (DAG), also called a task graph or macro-dataflow graph, to a set of homogeneous processors, with the objective of minimizing the completion time. We analyze 21 such algorithms and classify them into four groups. The first group includes algorithms that schedule the DAG to a bounded number of processors directly. These algorithms are called the bounded number of processors (BNP) scheduling algorithms. The algorithms in the second group schedule the DAG to an unbounded number of clusters and are called the unbounded number of clusters (UNC) scheduling algorithms. The algorithms in the third group schedule the DAG using task duplication and are called the task duplication based (TDB) scheduling algorithms. The algorithms in the fourth group perform allocation and mapping on arbitrary processor network topologies. These algorithms are called the arbitrary processor network (APN) scheduling algorithms. The design philosophies and principles behind these algorithms are discussed, and the performance of all of the algorithms is evaluated and compared against each other on a unified basis by using various scheduling parameters. |
|---|---|
| AbstractList | In this paper, we survey algorithms that allocate a parallel program represented by an edge-weighted directed acyclic graph (DAG), also called a task graph or macro-dataflow graph, to a set of homogeneous processors, with the objective of minimizing the completion time. We analyze 21 such algorithms and classify them into four groups. The first group includes algorithms that schedule the DAG to a bounded number of processors directly. These algorithms are called the bounded number of processors (BNP) scheduling algorithms. The algorithms in the second group schedule the DAG to an unbounded number of clusters and are called the unbounded number of clusters (UNC) scheduling algorithms. The algorithms in the third group schedule the DAG using task duplication and are called the task duplication based (TDB) scheduling algorithms. The algorithms in the fourth group perform allocation and mapping on arbitrary processor network topologies. These algorithms are called the arbitrary processor network (APN) scheduling algorithms. The design philosophies and principles behind these algorithms are discussed, and the performance of all of the algorithms is evaluated and compared against each other on a unified basis by using various scheduling parameters. |
| Author | Min-You Wu Yu-Kwong Kwok Ahmad, I. |
| Author_xml | – sequence: 1 givenname: I. surname: Ahmad fullname: Ahmad, I. organization: Dept. of Comput. Sci., Hong Kong Univ., Hong Kong – sequence: 2 surname: Yu-Kwong Kwok fullname: Yu-Kwong Kwok organization: Dept. of Comput. Sci., Hong Kong Univ., Hong Kong – sequence: 3 surname: Min-You Wu fullname: Min-You Wu |
| BookMark | eNotkE1PAjEYhJuIiYD8AD31B7DYsrv9OBLiBwlRE_VM3nbfQrVsN-1iwr93E5zLHOaZOcyEjNrYIiF3nC04Z_ph8_G-el1wrcWiZkqr8opMmOJKyEowPiJjzpQsqiG6IbOcv9mgulai0mPSrFoI5-zznOIvhBP0PrZzCm1DbTx2kHyOLY2OQtjH5PvDMVMXE832gM0p-HZPe8g_dJ-gO2Q6sEMHQsBAuxQt5hxTviXXDkLG2b9PydfT4-f6pdi-PW_Wq23hOav6whmHpraNUNKiEADciUoaU1e1tgBLZ6TUS2ERmXTMNNpAaY1yki05w1KXU3J_2fWIuOuSP0I67y6flH_cxFqf |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/ISPAN.1996.508983 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EndPage | 213 |
| ExternalDocumentID | 508983 |
| GroupedDBID | 23M 29O 6IE 6IF 6IK 6IL 6IM 6IN AAJGR AAWTH ACGFS ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IPLJI M43 OCL RIE RIL RNS |
| ID | FETCH-LOGICAL-i104t-fbfeb5cd687ce66aa1f647bb5459caa2fb77926cee07f0bd9ba3cb8f70210e393 |
| IEDL.DBID | RIE |
| ISBN | 0818674601 9780818674600 |
| ISICitedReferencesCount | 51 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=508983&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1087-4089 |
| IngestDate | Tue Aug 26 17:11:53 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i104t-fbfeb5cd687ce66aa1f647bb5459caa2fb77926cee07f0bd9ba3cb8f70210e393 |
| PageCount | 7 |
| ParticipantIDs | ieee_primary_508983 |
| PublicationCentury | 1900 |
| PublicationDate | 19960000 |
| PublicationDateYYYYMMDD | 1996-01-01 |
| PublicationDate_xml | – year: 1996 text: 19960000 |
| PublicationDecade | 1990 |
| PublicationTitle | Proceedings Second International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'96) |
| PublicationTitleAbbrev | ISPAN |
| PublicationYear | 1996 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0000558649 ssj0020396 |
| Score | 1.5133868 |
| Snippet | In this paper, we survey algorithms that allocate a parallel program represented by an edge-weighted directed acyclic graph (DAG), also called a task graph or... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 207 |
| SubjectTerms | Algorithm design and analysis Clustering algorithms Computer science Concurrent computing Network topology Parallel processing Polynomials Processor scheduling Scheduling algorithm Software algorithms |
| Title | Analysis, evaluation, and comparison of algorithms for scheduling task graphs on parallel processors |
| URI | https://ieeexplore.ieee.org/document/508983 |
| WOSCitedRecordID | wos508983&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 | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV27TsMwFLVoxcBUKEW85YGxbp2XHY8IUcFSVQKkbpWfUBGSKkn5fmwnaYXEwpZEeThOrHvPtc85ANwRzgPDtEIyDRlyGTFiWAVIKxYomphEBsKbTdD5PF0u2aLV2fZcGK21X3ymJ27Tz-WrQm5dqWxqkwmWRj3Qo5Q0VK1dOQUnSUockmixFo68NVeA7RiK7WVe-tGJt8UWgbTCO91-N9sZYDZ9flnczx2Fj0yap_1yXfFBZzb4V3OPwWhP3oOLXVg6AQc6H4JB594A28F8ClSnRzKGe8nvMeS5gnJnTggLA3n2XpTr-uOrgjbDhRYO2_DkWOyw5tUn9JLXFbTnOhnxLNMZ3DTsg6KsRuBt9vj68IRazwW0tsCsRkYYLRKpSEqlJv5LkpgKYRMtJjkPjaCUhcS-A6YGC8UEj6RIDXXYUUcsOgP9vMj1OYA8oTHnRhkiRIyNvZVSAedOAEaFKoovwND12WrTyGqsmu66_PPoFThqlku72sc16NflVt-AQ_ldr6vy1v8KP9y4sbg |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwGA06BX2azol38-DjuqXXNI8iyoazDJywt5GrDms72s7fb5J2G4IvvrWllzRt-L7zJeccAO4iSl1FpHB47BHHZMQOQcJ1pCCuwKEKucus2QROkng2I5NGZ9tyYaSUdvGZ7JtNO5cvcr4ypbKBTiZI7O-CvTAIPFSTtTYFFRSGcWSwRIO2kG_NuVykR1GgL7Tij0a-LdAYpJHeWe-v5ztdRAaj18l9Ykh8Ub9-3i_fFRt2ntr_avAR6G7pe3CyCUzHYEdmHdBe-zfAZjifALFWJOnBreh3D9JMQL6xJ4S5gjR9z4tF9fFVQp3jQg2IdYAyPHZY0fITWtHrEupzjZB4msoULmv-QV6UXfD29Dh9GDqN64Kz0NCschRTkoVcRDHmMrLfMgowYzrVIpxSTzGMiRfpd0BYISYIoz5nscIGPUqf-KegleWZPAOQhjigVAkVMRYgpW8lhEupkYARnvCDc9AxfTZf1sIa87q7Lv48egsOhtOX8Xw8Sp4vwWG9eNpUQq5AqypW8hrs8-9qURY39rf4AUmltP8 |
| 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%3Abook&rft.genre=proceeding&rft.title=Proceedings+Second+International+Symposium+on+Parallel+Architectures%2C+Algorithms%2C+and+Networks+%28I-SPAN%2796%29&rft.atitle=Analysis%2C+evaluation%2C+and+comparison+of+algorithms+for+scheduling+task+graphs+on+parallel+processors&rft.au=Ahmad%2C+I.&rft.au=Yu-Kwong+Kwok&rft.au=Min-You+Wu&rft.date=1996-01-01&rft.pub=IEEE&rft.isbn=9780818674600&rft.issn=1087-4089&rft.spage=207&rft.epage=213&rft_id=info:doi/10.1109%2FISPAN.1996.508983&rft.externalDocID=508983 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1087-4089&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1087-4089&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1087-4089&client=summon |