A Divide and Conquer Algorithm for DAG Scheduling under Power Constraints
We consider the problem of scheduling a parallel computation-represented as a directed acyclic graph (DAG)-on a distributed parallel system with a global resource constraint- specifically a global power budget-and configurable resources, allowing a range of different power/performance tradeoffs. The...
Uloženo v:
| Vydáno v: | SC18: International Conference for High Performance Computing, Networking, Storage and Analysis s. 466 - 477 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
01.11.2018
|
| Témata: | |
| 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 | We consider the problem of scheduling a parallel computation-represented as a directed acyclic graph (DAG)-on a distributed parallel system with a global resource constraint- specifically a global power budget-and configurable resources, allowing a range of different power/performance tradeoffs. There is a rich body of literature on the independent problems of (1) scheduling DAGs and (2) scheduling independent applications under resource constraints. Very little, however, is known about the combined problem of scheduling DAGs under resource constraints. We present a novel approximation algorithm using a divide-and-conquer method for minimizing application execution time. We prove that the length of the schedule returned by our algorithm is always within O(log n)-factor of the optimum that can be achieved with any selection of configurations for the tasks. We implement and test our algorithm on simulations of real application DAGs. We find that our divide-and-conquer method improves performance by up to 75% compared to greedy scheduling algorithms. |
|---|---|
| AbstractList | We consider the problem of scheduling a parallel computation-represented as a directed acyclic graph (DAG)-on a distributed parallel system with a global resource constraint- specifically a global power budget-and configurable resources, allowing a range of different power/performance tradeoffs. There is a rich body of literature on the independent problems of (1) scheduling DAGs and (2) scheduling independent applications under resource constraints. Very little, however, is known about the combined problem of scheduling DAGs under resource constraints. We present a novel approximation algorithm using a divide-and-conquer method for minimizing application execution time. We prove that the length of the schedule returned by our algorithm is always within O(log n)-factor of the optimum that can be achieved with any selection of configurations for the tasks. We implement and test our algorithm on simulations of real application DAGs. We find that our divide-and-conquer method improves performance by up to 75% compared to greedy scheduling algorithms. |
| Author | Hoffmann, Henry Demirci, Gokalp Marincic, Ivana |
| Author_xml | – sequence: 1 givenname: Gokalp surname: Demirci fullname: Demirci, Gokalp – sequence: 2 givenname: Ivana surname: Marincic fullname: Marincic, Ivana – sequence: 3 givenname: Henry surname: Hoffmann fullname: Hoffmann, Henry |
| BookMark | eNotjLFOwzAURY0EAy2MTCz-gQQ7r3aexyiFUqkSSIW5cuLn1lLqgJOA-HsiwXLPcs5dsMvYR2LsTopcSmEe9nVeCIm5EALMBVtIBagRcGWu2bbi6_AVHHEbHa_7-DlR4lV37FMYT2fu-8TX1Ybv2xO5qQvxyKfoZuW1_553DoYx2RDH4YZdedsNdPvPJXt_enyrn7Pdy2ZbV7vMSoVjppFapZxx2uhCk2u0dAYK8No0QhOi17YxvhXkVenBCEBSqiilbGCFYGDJ7v9-AxEdPlI42_RzQK1VqQB-AY2bRwM |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/SC.2018.00039 |
| 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 |
| EISBN | 1538683849 9781538683842 |
| EndPage | 477 |
| ExternalDocumentID | 8665753 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IL CBEJK RIE RIL |
| ID | FETCH-LOGICAL-a158t-68ec55d9d69626edb61d9323f69b06e88f6ab9fc0ef57f39038e552711b348393 |
| IEDL.DBID | RIE |
| IngestDate | Thu Jun 29 18:39:01 EDT 2023 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a158t-68ec55d9d69626edb61d9323f69b06e88f6ab9fc0ef57f39038e552711b348393 |
| PageCount | 12 |
| ParticipantIDs | ieee_primary_8665753 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-Nov |
| PublicationDateYYYYMMDD | 2018-11-01 |
| PublicationDate_xml | – month: 11 year: 2018 text: 2018-Nov |
| PublicationDecade | 2010 |
| PublicationTitle | SC18: International Conference for High Performance Computing, Networking, Storage and Analysis |
| PublicationTitleAbbrev | SC |
| PublicationYear | 2018 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| Score | 1.7278322 |
| Snippet | We consider the problem of scheduling a parallel computation-represented as a directed acyclic graph (DAG)-on a distributed parallel system with a global... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 466 |
| SubjectTerms | Approximation algorithms configuration DAG Greedy algorithms power precedence Processor scheduling Program processors resource Schedules Scheduling Task analysis |
| Title | A Divide and Conquer Algorithm for DAG Scheduling under Power Constraints |
| URI | https://ieeexplore.ieee.org/document/8665753 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwIxEJ0A8eBJDRi_04NHV7p0t9seCYh6ISRowo1st1M0UTC7i7_fTiHgwYu3pmnTZJp05k3nzQO49RhZFMbfgJOoo8SlPFKaMnHe9-Q5t0mvsEFsIhuP1WymJw2423FhEDEUn-E9DcNfvl0Va0qVdVX4JhBNaGZZtuFq7dtmdqcDqtSi0khO0t-_xFKCrxgd_e-UY-jsSXdssnMnJ9DAZRue-2xIhClkHvEzv9I_4yXrfyxWHtS_fTIfcrJh_5FNve0tFZUvGLHCSjYh9TPaUAURiLrqwOvo4WXwFG3VD6I8TlUdSYVFmlptpfagA62RsfXBlnBSGy5RKSdzo13B0aWZE5oLhdROLY6NSHzYI06htVwt8QyY6lnBrUdGOfYSq5xBXphUa9QO4wzjc2iTGeZfmwYX860FLv6evoRDsvOGkHcFrbpc4zUcFN_1e1XehFv5AdLfj70 |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwIxEJ0gmuhJDRi_7cGjK93tdmmPBESISEjAhBvZbadgomCWxd9vWwh48OKtado0mSadedN58wDuLUZmKrM3YBKUQWw4DYR0mTjre9KU6jhS2otN1Pt9MR7LQQketlwYRPTFZ_johv4vXy_UyqXKasJ_E7A92OdxHIVrttaucWZt2HS1Wq44kjrx719yKd5btI__d84JVHe0OzLYOpRTKOG8At0GaTnKFBKL-YldaR_ynDQ-pgsL62efxAadpNV4JkNrfe3KyqfE8cJyMnD6Z27D0stAFMsqvLWfRs1OsNE_CNKQiyJIBCrOtdSJtLADdZaE2oZbzCQyowkKYZI0k0ZRNLxumKRMoGuoFoYZi23gw86gPF_M8RyIiDSj2mKjFKNYC5MhVRmXEqXBsI7hBVScGSZf6xYXk40FLv-evoPDzui1N-l1-y9XcORsvqbnXUO5yFd4Awfqu3hf5rf-hn4AfTOTBA |
| 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=SC18%3A+International+Conference+for+High+Performance+Computing%2C+Networking%2C+Storage+and+Analysis&rft.atitle=A+Divide+and+Conquer+Algorithm+for+DAG+Scheduling+under+Power+Constraints&rft.au=Demirci%2C+Gokalp&rft.au=Marincic%2C+Ivana&rft.au=Hoffmann%2C+Henry&rft.date=2018-11-01&rft.pub=IEEE&rft.spage=466&rft.epage=477&rft_id=info:doi/10.1109%2FSC.2018.00039&rft.externalDocID=8665753 |