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...
Gespeichert in:
| Veröffentlicht in: | SC18: International Conference for High Performance Computing, Networking, Storage and Analysis S. 466 - 477 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
01.11.2018
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| 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 Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE/IET Electronic Library (IEL) (UW System Shared) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET 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.7280637 |
| 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/eLvHCXMwlV1NTwIxEG2AePCkBozf6cGjld3tbj-OBES9EBI04Ua27RRNFMyy-PvtFAIevHhrmjZNpmlnpn1vHiG3yjnuNFgWTqFgOaiEmSz1TFoZ8ufgP4rSR7EJORqp6VSPG-Rux4UBgAg-g3tsxr98t7RrfCrrqvhNwJukKaXccLX2ZTO7kz4itRAamaD09y-xlOgrhkf_W-WYdPakOzreuZMT0oBFmzz36AAJU0BDxk_DyHCNV7T3MV-GpP7tk4aQkw56j3QSbO8QVD6nyAqr6BjVz3DCKopA1KsOeR0-vPSf2Fb9gJVpoWomFNiicNoJHZIOcEakLgRb3AttEgFKeVEa7W0CvpCe64QrwHJqaWp4HsIefkpai-UCzgjNSo5lz6TQkOR56bUNcZktjMqkkYXLzkkbzTD72hS4mG0tcPF39yU5RDtvCHlXpFVXa7gmB_a7fl9VN3FXfgDo2479 |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwIxEJ0gmuhJDRi_7cGjld3tttseCYgQkZCACTey207RRMEsi7_fdjHgwYu3pmnTZJp2Ztr35gHcSmOYUaipO4WCxigDmkWhpYlOXP7s_AdPbSk2kQwGcjJRwwrcbbgwiFiCz_DeN8u_fLPQK_9U1pDlNwHbgV0ex1G4ZmttC2c2Ri2P1fLgyMCLf_-SSym9Refwf-scQX1LuyPDjUM5hgrOa9BrkranTCFxOT9xI91FnpPm-2zh0vrXD-KCTtJuPpKRs77xsPIZ8bywnAy9_pmfsCxlIIplHV46D-NWl_7oH9A05LKgQqLm3CgjlEs70GQiNC7cYlaoLBAopRVppqwO0PLEMhUwib6gWhhmLHaBDzuB6nwxx1MgUcp84bNEKAziOLVKu8hM80xGSZZwE51BzZth-rkucTH9scD53903sN8dP_en_d7g6QIOvM3X9LxLqBb5Cq9gT38Vb8v8utyhb4qfkkQ |
| 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 |