Meeting Job-Level Dependencies by Task Merging
Industrial applications are often time critical and subject to end-to-end latency constraints. Job-level dependencies can be leveraged to specify a partial ordering on tasks' jobs already at early design phases, agnostic of the hardware platform or scheduling algorithm, and guarantee that end-t...
Uloženo v:
| Vydáno v: | Proceedings of the ASP-DAC ... Asia and South Pacific Design Automation Conference s. 792 - 798 |
|---|---|
| Hlavní autor: | |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
22.01.2024
|
| Témata: | |
| ISSN: | 2153-697X |
| 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 | Industrial applications are often time critical and subject to end-to-end latency constraints. Job-level dependencies can be leveraged to specify a partial ordering on tasks' jobs already at early design phases, agnostic of the hardware platform or scheduling algorithm, and guarantee that end-to-end latency constraints of task chains are met as long as the job-level dependencies are respected. However, their realization at runtime can introduce overheads and complicates the scheduling and timing analysis. This work presents an approach that merges multi-periodic tasks that are connected by job-level dependencies to a single task. A Constraint Programming formulation is presented that optimally merges such task clusters while all job-level dependencies are respected. Such an approach removes the need to consider job-level dependencies at runtime without being bound to a specific scheduling algorithm. Evaluations highlight the applicability of the approach by system-level experiments and showcase the scalability of the approach using synthetic task clusters. |
|---|---|
| AbstractList | Industrial applications are often time critical and subject to end-to-end latency constraints. Job-level dependencies can be leveraged to specify a partial ordering on tasks' jobs already at early design phases, agnostic of the hardware platform or scheduling algorithm, and guarantee that end-to-end latency constraints of task chains are met as long as the job-level dependencies are respected. However, their realization at runtime can introduce overheads and complicates the scheduling and timing analysis. This work presents an approach that merges multi-periodic tasks that are connected by job-level dependencies to a single task. A Constraint Programming formulation is presented that optimally merges such task clusters while all job-level dependencies are respected. Such an approach removes the need to consider job-level dependencies at runtime without being bound to a specific scheduling algorithm. Evaluations highlight the applicability of the approach by system-level experiments and showcase the scalability of the approach using synthetic task clusters. |
| Author | Becker, Matthias |
| Author_xml | – sequence: 1 givenname: Matthias surname: Becker fullname: Becker, Matthias email: mabecker@kth.se organization: KTH Royal Institute of Technology,Sweden |
| BookMark | eNo1j81Kw0AURkdRsNa8gYvgfuKd3JnMzDKk9Y8UBSu4K3MzNyVY05IUoW9vwbr6OHA48F2Li37bsxB3CjKlwN-X729yVlbGWQdZDrnOFGiLHtSZSLz1Dg2gR6PNuZjkyqAsvP28Esk4dgTGIBTamInIFsz7rl-nL1uSNf_wJp3xjvvIfdPxmNIhXYbxK13wsD5qN-KyDZuRk9NOxcfDfFk9yfr18bkqaxnQub3UkSL5XFG0VkNjVGBFEEJEDA1AyxCI45Gci63JI-m2sKSBNVnlWeFU3P51O2Ze7YbuOwyH1f9F_AXGQ0gH |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/ASP-DAC58780.2024.10473901 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL 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 | Engineering Computer Science |
| EISBN | 9798350393545 |
| EISSN | 2153-697X |
| EndPage | 798 |
| ExternalDocumentID | 10473901 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IF 6IL 6IN AAWTH ABLEC ACGFS ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK M43 OCL RIE RIL |
| ID | FETCH-LOGICAL-a388t-4dbdb921bd7740c51ae1b0aad33ac00fe0abedd3388df52db4f67b40e4b719e13 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001196002900127&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:09:02 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a388t-4dbdb921bd7740c51ae1b0aad33ac00fe0abedd3388df52db4f67b40e4b719e13 |
| OpenAccessLink | https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-346299 |
| PageCount | 7 |
| ParticipantIDs | ieee_primary_10473901 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-Jan.-22 |
| PublicationDateYYYYMMDD | 2024-01-22 |
| PublicationDate_xml | – month: 01 year: 2024 text: 2024-Jan.-22 day: 22 |
| PublicationDecade | 2020 |
| PublicationTitle | Proceedings of the ASP-DAC ... Asia and South Pacific Design Automation Conference |
| PublicationTitleAbbrev | ASP-DAC |
| PublicationYear | 2024 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssib055306455 ssj0000502710 |
| Score | 1.8579588 |
| Snippet | Industrial applications are often time critical and subject to end-to-end latency constraints. Job-level dependencies can be leveraged to specify a partial... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 792 |
| SubjectTerms | Constraint handling Design automation Job shop scheduling Merging Runtime Scalability Scheduling algorithms |
| Title | Meeting Job-Level Dependencies by Task Merging |
| URI | https://ieeexplore.ieee.org/document/10473901 |
| WOSCitedRecordID | wos001196002900127&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/eLvHCXMwlV1LS8NAEB5s8aCXaq1YX-zB67a7m012cyytRaQtBSv0VnazExChlT4E_727aeLj4MFbEkgIMzuZzOx83wdwp1CYOOWCigQFldYpapXhNDIodM4jn_IKT4_UZKLn83RagtULLAwiFsNn2AmHxV6-W2W70CrrBlqBUKPXoKZUsgdrVYsnyN8ksgRZ7om9fcXFK6JRztJu72lKB71-rJVmvjIUslM98Je0SpFZho1_vtMJtL4xemT6lX1O4QCXTWhUIg2kjNkmHP9gHDyDzhgLjDN5XFk6CgNDZFDK4PobNsR-kJnZvJIxroN6UQueh_ez_gMtJROoibTeUumss6ng3uZKsizmBrllxrgoMhljOTJj0fkzrV0eC2dlnigrGUqreIo8Oof6crXECyDeuVYwZW2SSR_owvhvg_-bZAp5qjOLbWgFayze9qwYi8oQl39cv4KjYPPQvhDiGurb9Q5v4DB7375s1reFLz8BKZScNA |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB60CuqlWiu-3YPXbXc3m-zmWFpL1bQUrNBb2U2mIEIrfQj-e3fTxMfBg7ckkBBmdjKZ2fm-D-BWoTBhzAUVEQoqbaaoVYbTwKDQUx64lJd7OlGDgR6P42EBVs-xMIiYD59hwx_me_nZPF37VlnT0wr4Gn0bdkIpBdvAtcrl4wVwIlnALDfU3q7m4iXVKGdxs_U0pJ1WO9RKM1cbCtkoH_lLXCXPLd3qP9_qEOrfKD0y_Mo_R7CFsxpUS5kGUkRtDQ5-cA4eQ6OPOcqZPMwtTfzIEOkUQrjuhiWxH2Rklq-kjwuvX1SH5-7dqN2jhWgCNYHWKyozm9lYcGd1JVkacoPcMmOyIDApY1NkxmLmzrTOpqHIrJxGykqG0ioeIw9OoDKbz_AUiHOvFUxZG6XShbow7uvg_ieZQh7r1OIZ1L01Jm8bXoxJaYjzP67fwF5v1E8myf3g8QL2vf19M0OIS6isFmu8gt30ffWyXFznfv0EfWqfew |
| 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+of+the+ASP-DAC+...+Asia+and+South+Pacific+Design+Automation+Conference&rft.atitle=Meeting+Job-Level+Dependencies+by+Task+Merging&rft.au=Becker%2C+Matthias&rft.date=2024-01-22&rft.pub=IEEE&rft.eissn=2153-697X&rft.spage=792&rft.epage=798&rft_id=info:doi/10.1109%2FASP-DAC58780.2024.10473901&rft.externalDocID=10473901 |