Soft scheduling in high level synthesis
In this paper, we establish a theoretical framework for a new concept of scheduling called soft scheduling. In contrasts to the traditional schedulers referred as hard schedulers, soft schedulers make soft decisions at a time, or decisions that can be adjusted later. Soft scheduling has a potential...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 224 |
|---|---|
| container_issue | |
| container_start_page | 219 |
| container_title | |
| container_volume | |
| creator | Zhu, Jianwen Gajski, Daniel D. |
| description | In this paper, we establish a theoretical framework for a new concept of scheduling called soft scheduling. In contrasts to the traditional schedulers referred as hard schedulers, soft schedulers make soft decisions at a time, or decisions that can be adjusted later. Soft scheduling has a potential to alleviate the phase coupling problem that has plagued traditional high level synthesis (HLS), HLS for deep submicron design and VLIW code generation. We then develop a specific soft scheduling formulation, called threaded schedule, under which a linear, optimal (in the sense of online optimality) algorithm is guaranteed. |
| doi_str_mv | 10.1145/309847.309917 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>proquest_acm_b</sourceid><recordid>TN_cdi_proquest_miscellaneous_27116478</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>27116478</sourcerecordid><originalsourceid>FETCH-LOGICAL-a2377-58652bc78a9062492d66e77e77bf3292c2d25fd6581102bbce7f1f90050548f53</originalsourceid><addsrcrecordid>eNqNkEFLxDAQhQMquKw9eu9JL3adSZpMcpRFV2HBgwreQtMm22q31c1W8N_bpYJXHwPv8jE8PsbOERaIubwWYHROi7EM0hFLDGmUGlEgGHHMZkBCZwjwesqSGN9gDJGRxGfs8qkP-zSWta-Gtuk2adOldbOp09Z_-TaN392-9rGJZ-wkFG30yW_P2cvd7fPyPls_rh6WN-us4IIok1pJ7krShQHFc8MrpTzReC4IbnjJKy5DpQ7rgDtXegoYDIAEmesgxZxdTH8_dv3n4OPebptY-rYtOt8P0XJCVDnpP7Aot9b1_Xu0CPagw0467KRjBK_-BVq3a3wQP0ZoW1o</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype><pqid>27116478</pqid></control><display><type>conference_proceeding</type><title>Soft scheduling in high level synthesis</title><source>IEEE Electronic Library (IEL)</source><creator>Zhu, Jianwen ; Gajski, Daniel D.</creator><contributor>Irwin, Mary Jane</contributor><creatorcontrib>Zhu, Jianwen ; Gajski, Daniel D. ; Irwin, Mary Jane</creatorcontrib><description>In this paper, we establish a theoretical framework for a new concept of scheduling called soft scheduling. In contrasts to the traditional schedulers referred as hard schedulers, soft schedulers make soft decisions at a time, or decisions that can be adjusted later. Soft scheduling has a potential to alleviate the phase coupling problem that has plagued traditional high level synthesis (HLS), HLS for deep submicron design and VLIW code generation. We then develop a specific soft scheduling formulation, called threaded schedule, under which a linear, optimal (in the sense of online optimality) algorithm is guaranteed.</description><identifier>ISSN: 0738-100X</identifier><identifier>ISBN: 9781581131093</identifier><identifier>ISBN: 1581131097</identifier><identifier>DOI: 10.1145/309847.309917</identifier><language>eng</language><publisher>New York, NY, USA: ACM</publisher><subject>Hardware -- Integrated circuits -- Logic circuits</subject><ispartof>Proceedings - ACM IEEE Design Automation Conference, 1999, p.219-224</ispartof><rights>1999 ACM</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>309,310,314,780,784,27924,27925</link.rule.ids></links><search><contributor>Irwin, Mary Jane</contributor><creatorcontrib>Zhu, Jianwen</creatorcontrib><creatorcontrib>Gajski, Daniel D.</creatorcontrib><title>Soft scheduling in high level synthesis</title><title>Proceedings - ACM IEEE Design Automation Conference</title><description>In this paper, we establish a theoretical framework for a new concept of scheduling called soft scheduling. In contrasts to the traditional schedulers referred as hard schedulers, soft schedulers make soft decisions at a time, or decisions that can be adjusted later. Soft scheduling has a potential to alleviate the phase coupling problem that has plagued traditional high level synthesis (HLS), HLS for deep submicron design and VLIW code generation. We then develop a specific soft scheduling formulation, called threaded schedule, under which a linear, optimal (in the sense of online optimality) algorithm is guaranteed.</description><subject>Hardware -- Integrated circuits -- Logic circuits</subject><issn>0738-100X</issn><isbn>9781581131093</isbn><isbn>1581131097</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1999</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNqNkEFLxDAQhQMquKw9eu9JL3adSZpMcpRFV2HBgwreQtMm22q31c1W8N_bpYJXHwPv8jE8PsbOERaIubwWYHROi7EM0hFLDGmUGlEgGHHMZkBCZwjwesqSGN9gDJGRxGfs8qkP-zSWta-Gtuk2adOldbOp09Z_-TaN392-9rGJZ-wkFG30yW_P2cvd7fPyPls_rh6WN-us4IIok1pJ7krShQHFc8MrpTzReC4IbnjJKy5DpQ7rgDtXegoYDIAEmesgxZxdTH8_dv3n4OPebptY-rYtOt8P0XJCVDnpP7Aot9b1_Xu0CPagw0467KRjBK_-BVq3a3wQP0ZoW1o</recordid><startdate>19990601</startdate><enddate>19990601</enddate><creator>Zhu, Jianwen</creator><creator>Gajski, Daniel D.</creator><general>ACM</general><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19990601</creationdate><title>Soft scheduling in high level synthesis</title><author>Zhu, Jianwen ; Gajski, Daniel D.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a2377-58652bc78a9062492d66e77e77bf3292c2d25fd6581102bbce7f1f90050548f53</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Hardware -- Integrated circuits -- Logic circuits</topic><toplevel>online_resources</toplevel><creatorcontrib>Zhu, Jianwen</creatorcontrib><creatorcontrib>Gajski, Daniel D.</creatorcontrib><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhu, Jianwen</au><au>Gajski, Daniel D.</au><au>Irwin, Mary Jane</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Soft scheduling in high level synthesis</atitle><btitle>Proceedings - ACM IEEE Design Automation Conference</btitle><date>1999-06-01</date><risdate>1999</risdate><spage>219</spage><epage>224</epage><pages>219-224</pages><issn>0738-100X</issn><isbn>9781581131093</isbn><isbn>1581131097</isbn><abstract>In this paper, we establish a theoretical framework for a new concept of scheduling called soft scheduling. In contrasts to the traditional schedulers referred as hard schedulers, soft schedulers make soft decisions at a time, or decisions that can be adjusted later. Soft scheduling has a potential to alleviate the phase coupling problem that has plagued traditional high level synthesis (HLS), HLS for deep submicron design and VLIW code generation. We then develop a specific soft scheduling formulation, called threaded schedule, under which a linear, optimal (in the sense of online optimality) algorithm is guaranteed.</abstract><cop>New York, NY, USA</cop><pub>ACM</pub><doi>10.1145/309847.309917</doi><tpages>6</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0738-100X |
| ispartof | Proceedings - ACM IEEE Design Automation Conference, 1999, p.219-224 |
| issn | 0738-100X |
| language | eng |
| recordid | cdi_proquest_miscellaneous_27116478 |
| source | IEEE Electronic Library (IEL) |
| subjects | Hardware -- Integrated circuits -- Logic circuits |
| title | Soft scheduling in high level synthesis |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T06%3A07%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_acm_b&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Soft%20scheduling%20in%20high%20level%20synthesis&rft.btitle=Proceedings%20-%20ACM%20IEEE%20Design%20Automation%20Conference&rft.au=Zhu,%20Jianwen&rft.date=1999-06-01&rft.spage=219&rft.epage=224&rft.pages=219-224&rft.issn=0738-100X&rft.isbn=9781581131093&rft.isbn_list=1581131097&rft_id=info:doi/10.1145/309847.309917&rft_dat=%3Cproquest_acm_b%3E27116478%3C/proquest_acm_b%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=27116478&rft_id=info:pmid/&rfr_iscdi=true |