Scheduling with confidence for probabilistic data-flow graphs

One of the biggest problems in high-level synthesis is to obtain a good schedule without the knowledge of exact computation time of tasks. While the target applications in high-level synthesis are becoming larger a task in the applications such as artificial intelligent systems or interface may have...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings Great Lakes Symposium on VLSI s. 150 - 155
Hlavní autoři: Tongsima, S., Chantrapornchai, C., Sha, E.H.-M., Passos, N.L.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 1997
Témata:
Application software
Computer science
Constraint optimization
Delay
High level synthesis
Knowledge engineering
Polynomials
Processor scheduling
Scheduling algorithm
Timing
ISBN:0818679042, 9780818679049
ISSN:1066-1395
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 One of the biggest problems in high-level synthesis is to obtain a good schedule without the knowledge of exact computation time of tasks. While the target applications in high-level synthesis are becoming larger a task in the applications such as artificial intelligent systems or interface may have uncertain computation time. In this paper an algorithm to schedule these repetitive tasks and optimize the schedule is presented. A probabilistic data-flow graph is employed to model the problem where each node represents a task associated with the probabilistic computation time and a set of edges represents the dependences between the tasks. A novel polynomial-time probabilistic retiming algorithm for optimizing the graph and an algorithm for computing the optimized schedule, subject to the acceptable probability and resource constraint, are presented. The optimization algorithm also guarantees to give such a short schedule length with a given qualitatively provable, confidence level. The experiments show that the resulting schedule length for a given confidence probability can be significantly reduced.
AbstractList One of the biggest problems in high-level synthesis is to obtain a good schedule without the knowledge of exact computation time of tasks. While the target applications in high-level synthesis are becoming larger a task in the applications such as artificial intelligent systems or interface may have uncertain computation time. In this paper an algorithm to schedule these repetitive tasks and optimize the schedule is presented. A probabilistic data-flow graph is employed to model the problem where each node represents a task associated with the probabilistic computation time and a set of edges represents the dependences between the tasks. A novel polynomial-time probabilistic retiming algorithm for optimizing the graph and an algorithm for computing the optimized schedule, subject to the acceptable probability and resource constraint, are presented. The optimization algorithm also guarantees to give such a short schedule length with a given qualitatively provable, confidence level. The experiments show that the resulting schedule length for a given confidence probability can be significantly reduced.
Author Tongsima, S.
Sha, E.H.-M.
Passos, N.L.
Chantrapornchai, C.
Author_xml – sequence: 1
  givenname: S.
  surname: Tongsima
  fullname: Tongsima, S.
  organization: Dept. of Comput. Sci. & Eng., Notre Dame Univ., IN, USA
– sequence: 2
  givenname: C.
  surname: Chantrapornchai
  fullname: Chantrapornchai, C.
– sequence: 3
  givenname: E.H.-M.
  surname: Sha
  fullname: Sha, E.H.-M.
– sequence: 4
  givenname: N.L.
  surname: Passos
  fullname: Passos, N.L.
BookMark eNotj81Kw0AYRQesYP_24mpeIHG-yfwuXEjRVgi4qHVbJpNvmpGYhEmk-PYW6t0czubAXZBZ13dIyD2wHIDZx225_8zBWp1LwyQ3N2TBDBilLRN8RubAlMqgsPKOrMfxi10mJFgQc_K09w3WP23sTvQcp4b6vguxxs4jDX2iQ-orV8U2jlP0tHaTy0Lbn-kpuaEZV-Q2uHbE9T-X5PD68rHZZeX79m3zXGYRNJ-yEKQpnK_QSWWYClZ5tIF7xtEELRUW0guNXF9UuCpwLtErtKCExMpisSQP125ExOOQ4rdLv8fr2eIPvNdLBg
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/GLSV.1997.580528
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE/IET 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 Engineering
Computer Science
EndPage 155
ExternalDocumentID 580528
GroupedDBID 123
29H
29N
29O
6IE
6IK
6IL
AAJGR
AAWTH
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
APO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IPLJI
OCL
RIE
RIL
RNS
ID FETCH-LOGICAL-i172t-ff583acbea56806f96ce9f2c02e8f756e35c47e27e8f4abf225ec6e91645eb9e3
IEDL.DBID RIE
ISBN 0818679042
9780818679049
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=580528&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1066-1395
IngestDate Tue Aug 26 17:58:04 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i172t-ff583acbea56806f96ce9f2c02e8f756e35c47e27e8f4abf225ec6e91645eb9e3
PageCount 6
ParticipantIDs ieee_primary_580528
PublicationCentury 1900
PublicationDate 19970000
PublicationDateYYYYMMDD 1997-01-01
PublicationDate_xml – year: 1997
  text: 19970000
PublicationDecade 1990
PublicationTitle Proceedings Great Lakes Symposium on VLSI
PublicationTitleAbbrev GLSV
PublicationYear 1997
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000451914
ssj0020533
Score 1.2540804
Snippet One of the biggest problems in high-level synthesis is to obtain a good schedule without the knowledge of exact computation time of tasks. While the target...
SourceID ieee
SourceType Publisher
StartPage 150
SubjectTerms Application software
Computer science
Constraint optimization
Delay
High level synthesis
Knowledge engineering
Polynomials
Processor scheduling
Scheduling algorithm
Timing
Title Scheduling with confidence for probabilistic data-flow graphs
URI https://ieeexplore.ieee.org/document/580528
WOSCitedRecordID wos580528&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/eLvHCXMwlZ07T8MwEMctWjHAUihFvOWB1W3ixHY8MCEKA6oqFVC3yrHPqBJqUR_w9fE5aQGJhS3OksjW6V6-35-Qa576VDqdMJeXjgVLLFmRgWaptD7lBolpLopNqMGgGI_1sOZsx1kYAIiXz6CLj7GX7-Z2jaWynkD-ftEgDaVkNaq1LadETAp6mjrXwhHT2OiUiNnTIqIfEd6mY_oewTubtd60LxPdu38cveAEn-pWH_sluhJ9Tr_1r789IJ3v2T063HqlQ7IDszZpbcQbaG3LbbL_g0R4RG5G4fAc3kp_pViapSFN9pXeKA1hLUXdmcjiRawzxWulzL_NP2nkXS875Ll_93T7wGplBTYNAcuKeS-KzNgSjJBFIr2WFrTnNuFQeCUkZMLmCrgKy9yUPhg9WAkhlMwFlBqyY9KczWdwQih3PjEQspiS-9wl0uQiOEDw3nFjgBenpI1bM3mv4BmTalfO_nx7TvYqOixWOC5Ic7VYwyXZtR-r6XJxFQ_8C9lspew
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3PT8IwFMcbRRP1giLG3_bgtbB1bbcePBkRIxIS0HAjXftqSAwYfui_b9sN1MSLt3WXLW1e3q--zxehaxrbWBgZEcNyQ5wl5iRLQJJYaBtT5YlpJohNpN1uNhzKXsnZDrMwABAun0HDP4ZevpnqpS-VNbnn72ebaIszRqNiWGtdUAmgFO9rymzLD5mGVqfwoD3JA_zR49tkSOADeme1lqsGZiSb953-i5_hSxvF537JrgSv06r-63_3Uf17eg_31n7pAG3ApIaqK_kGXFpzDe39YBEeopu-Oz7j76W_Yl-cxS5RtoXiKHaBLfbKM4HG68HO2F8sJfZt-okD8XpeR8-tu8Ftm5TaCmTsQpYFsZZnidI5KC6ySFgpNEhLdUQhsykXkHDNUqCpWzKVW2f2oAW4YJJxyCUkR6gymU7gGGFqbKTA5TE5tcxEQjHuXCBYa6hSQLMTVPNbM3ov8BmjYldO_3x7hXbag6fOqPPQfTxDuwUr1tc7zlFlMVvCBdrWH4vxfHYZDv8LrlypMw
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+Great+Lakes+Symposium+on+VLSI&rft.atitle=Scheduling+with+confidence+for+probabilistic+data-flow+graphs&rft.au=Tongsima%2C+S.&rft.au=Chantrapornchai%2C+C.&rft.au=Sha%2C+E.H.-M.&rft.au=Passos%2C+N.L.&rft.date=1997-01-01&rft.pub=IEEE&rft.isbn=9780818679049&rft.issn=1066-1395&rft.spage=150&rft.epage=155&rft_id=info:doi/10.1109%2FGLSV.1997.580528&rft.externalDocID=580528
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1066-1395&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1066-1395&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1066-1395&client=summon