A parallel algorithm for compile-time scheduling of parallel programs on multiprocessors

Proposes a parallel randomized algorithm, called PFAST (Parallel Fast Assignment using Search Technique), for scheduling parallel programs represented by directed acyclic graphs (DAGs) during compile-time. The PFAST algorithm has O(e) time complexity, where e is the number of edges in the DAG. This...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings : 1997 International Conference on Parallel Architectures and Compilation Techniques : San Francisco, California, November 10-14, 1997 s. 90 - 101
Hlavní autoři: Yu-Kwong Kwok, Ahmad, I.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 1997
Témata:
Application software
Computational modeling
Concurrent computing
Optimal scheduling
Parallel algorithms
Processor scheduling
Prototypes
Scheduling algorithm
Testing
Time factors
ISBN:0818680903, 9780818680908
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 Proposes a parallel randomized algorithm, called PFAST (Parallel Fast Assignment using Search Technique), for scheduling parallel programs represented by directed acyclic graphs (DAGs) during compile-time. The PFAST algorithm has O(e) time complexity, where e is the number of edges in the DAG. This linear-time algorithm works by first generating an initial solution and then refining it using a parallel random search. Using a prototype computer-aided parallelization and scheduling tool called CASCH (Computer-Aided SCHeduling), the algorithm is found to outperform numerous previous algorithms while taking dramatically smaller execution times. The distinctive feature of this research is that, instead of simulations, our proposed algorithm is evaluated and compared with other algorithms using the CASCH tool with real applications running on an Intel Paragon. The PFAST algorithm is also evaluated with randomly generated DAGs for which optimal schedules are known. The algorithm generated optimal solutions for a majority of the test cases and close-to-optimal solutions for the others. The proposed algorithm is the fastest scheduling algorithm known to us and is an attractive choice for scheduling under running time constraints.
AbstractList Proposes a parallel randomized algorithm, called PFAST (Parallel Fast Assignment using Search Technique), for scheduling parallel programs represented by directed acyclic graphs (DAGs) during compile-time. The PFAST algorithm has O(e) time complexity, where e is the number of edges in the DAG. This linear-time algorithm works by first generating an initial solution and then refining it using a parallel random search. Using a prototype computer-aided parallelization and scheduling tool called CASCH (Computer-Aided SCHeduling), the algorithm is found to outperform numerous previous algorithms while taking dramatically smaller execution times. The distinctive feature of this research is that, instead of simulations, our proposed algorithm is evaluated and compared with other algorithms using the CASCH tool with real applications running on an Intel Paragon. The PFAST algorithm is also evaluated with randomly generated DAGs for which optimal schedules are known. The algorithm generated optimal solutions for a majority of the test cases and close-to-optimal solutions for the others. The proposed algorithm is the fastest scheduling algorithm known to us and is an attractive choice for scheduling under running time constraints.
Author Yu-Kwong Kwok
Ahmad, I.
Author_xml – sequence: 1
  surname: Yu-Kwong Kwok
  fullname: Yu-Kwong Kwok
  organization: Dept. of Comput. Sci., Hong Kong Univ. of Sci. & Technol., Hong Kong
– sequence: 2
  givenname: I.
  surname: Ahmad
  fullname: Ahmad, I.
BookMark eNpFj11LwzAYhQMq6Obuxav8gc43zcfay1LUCQO9mODdSNM3XSRpStJd-O8dTPDcHHjgPHAW5HqMIxLywGDNGNRPH027X7O63qyVEADqiiygYpWqoAZ-S1Y5f8M5QkhR8jvy1dBJJ-09eqr9EJObj4HamKiJYXIei9kFpNkcsT95Nw402v_FlOKQdMg0jjSc_OzOwGDOMeV7cmO1z7j66yX5fHnet9ti9_761ja7wjEQc2FQGo0dVxJsV5pS2LKSiB30TFWdsbDpkFlmdG-U5MbUxsoarBCV5KID5EvyePE6RDxMyQWdfg6X7_wXfdFT4g
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/PACT.1997.644006
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 101
ExternalDocumentID 644006
GroupedDBID 6IE
6IK
6IL
AAJGR
AAWTH
ACGHX
ACM
ALMA_UNASSIGNED_HOLDINGS
APO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
GUFHI
LHSKQ
OCL
RIB
RIC
RIE
RIL
ID FETCH-LOGICAL-i104t-ce5caeb3650fb2c24f285eeb0d168bcf07be1f1cadc653cc9cf590f448534b0e3
IEDL.DBID RIE
ISBN 0818680903
9780818680908
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=644006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Tue Aug 26 16:51:52 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i104t-ce5caeb3650fb2c24f285eeb0d168bcf07be1f1cadc653cc9cf590f448534b0e3
PageCount 12
ParticipantIDs ieee_primary_644006
PublicationCentury 1900
PublicationDate 19970000
PublicationDateYYYYMMDD 1997-01-01
PublicationDate_xml – year: 1997
  text: 19970000
PublicationDecade 1990
PublicationTitle Proceedings : 1997 International Conference on Parallel Architectures and Compilation Techniques : San Francisco, California, November 10-14, 1997
PublicationTitleAbbrev PACT
PublicationYear 1997
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000445423
Score 1.2506841
Snippet Proposes a parallel randomized algorithm, called PFAST (Parallel Fast Assignment using Search Technique), for scheduling parallel programs represented by...
SourceID ieee
SourceType Publisher
StartPage 90
SubjectTerms Application software
Computational modeling
Concurrent computing
Optimal scheduling
Parallel algorithms
Processor scheduling
Prototypes
Scheduling algorithm
Testing
Time factors
Title A parallel algorithm for compile-time scheduling of parallel programs on multiprocessors
URI https://ieeexplore.ieee.org/document/644006
WOSCitedRecordID wos644006&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/eLvHCXMwlV09T8MwELWgYmAqlCK-5YE1rZPYTjxWFRVT1aFI3ar4coZKIUFpyu_HjtNWSCxsSaRYka343p3vvUfIMwOd5VKzQChhAg4aAp0rC-QUWjwcGYzBm00k83m6WqlFp7PdcmEQsW0-w5G7bM_y8wp2rlQ2trG7ldc-TRLpqVqHcgrjXFhk0Co8OgV4V37o9HX29-n-lJKp8WIyXTqiXjLyY_7yVmlDy6z_r4-6IMMjRY8uDsHnkpxgOSD9vUcD7X7ZK7KaUKfuXRRY0Kx4r-pN8_FJLVKlrpncbgmBc5enNse1McdR02lljm903VtbWpXUtx56XkFVb4fkbfaynL4GnZtCsLEpVxMACshs6mwhmdERRNxEqUDULA9lqsGwRGNoQshykCIGUGCEYsambyLmmmF8TXplVeINocKYOA-1DnMluZPgs5gviwWXKDPNtb4lAzdP6y8vmLH2U3T359N7cu4VYV1V44H0mnqHj-QMvpvNtn5qF_kHD5WnmA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwFG4MmugJRYy_7cHroNvasR4JkWBEwgETbmR9e1US3MwY_v2264CYePG2LVmztFnf917f932EPDJQSRop5gkptMdBgadSaYCcRIOHA40hOLOJ3mQSz-dyWutsV1wYRKyaz7BjL6uz_DSHjS2VdU3sruS1DwXnAXNkrV1BhXEuDDaoNB6tBrwtQNQKO9v7eHtOyWR32h_MLFWv13Gj_nJXqYLLsPmvzzol7T1Jj0534eeMHGDWIs2tSwOtf9pzMu9Tq--9WuGKJqv3vFiWH5_UYFVq28nNpuBZf3lqslwTdSw5neZ6_0bdv7WmeUZd86FjFuTFuk3ehk-zwcir_RS8pUm6Sg9QQGKSZwPKtAog4DqIBaJiqR_FCjTrKfS1D0kKkQgBJGghmTYJnAi5YhhekEaWZ3hJqNA6TH2l_FRG3IrwGdSXhIJHGCWKK3VFWnaeFl9OMmPhpuj6z6cP5Hg0ex0vxs-Tlxty4vRhbY3jljTKYoN35Ai-y-W6uK8W_Af1hKrf
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+%3A+1997+International+Conference+on+Parallel+Architectures+and+Compilation+Techniques+%3A+San+Francisco%2C+California%2C+November+10-14%2C+1997&rft.atitle=A+parallel+algorithm+for+compile-time+scheduling+of+parallel+programs+on+multiprocessors&rft.au=Yu-Kwong+Kwok&rft.au=Ahmad%2C+I.&rft.date=1997-01-01&rft.pub=IEEE&rft.isbn=9780818680908&rft.spage=90&rft.epage=101&rft_id=info:doi/10.1109%2FPACT.1997.644006&rft.externalDocID=644006
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818680908/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818680908/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818680908/sc.gif&client=summon&freeimage=true