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...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the ASP-DAC ... Asia and South Pacific Design Automation Conference pp. 792 - 798
Main Author: Becker, Matthias
Format: Conference Proceeding
Language:English
Published: IEEE 22.01.2024
Subjects:
Constraint handling
Design automation
Job shop scheduling
Merging
Runtime
Scalability
Scheduling algorithms
ISSN:2153-697X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
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 Xplore
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore
  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.8580635
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/eLvHCXMwlV1LSwMxEB5s8aCXaq34JgevabPZ7CZ7LK1FpC0Fq_RWks0siNBKH4L_3iTd9XHw4C0JJISZhMkk-b4P4DYNlCK5ooxpTYXMDTUJMlq4BDcp0MXwgOJ_HsrxWM1m2aQEqwcsDCKGz2fY9sXwlm-X-dZflXU8rYDP0WtQkzLdgbWqxePlb1JRgix3xN4u44oqotGIZZ3u44T2u71EScVcZshFuxrwl7RKiCyDxj_ndAStb4wemXxFn2PYw0UTGpVIAyn3bBMOfzAOnkB7hAHjTB6Whg79hyHSL2VwXYc1MR9kqtevZIQrr17UgqfB3bR3T0vJBKpjpTZUWGNNxiNj3bGO5UmkMTLOCzaOdc5YgUwbtK6mlC0Sbo0oUmkEQ2FklGEUn0J9sVzgGRAT2zxDrixiIbTNlGaapdzyOBYmLcQ5tLw15m87Vox5ZYiLP9ov4cDb3F9fcH4F9c1qi9ewn79vXtarm-DLT2hynMo
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB60CuqlWiu-zcFr2mw2u5s9llap2paCVXoryWYWRGilD8F_b5Lu-jh48JYEEsJMwmSSfN8HcB17SpFMUsaUoiLJNNURMprbBDfK0cZwj-J_7iWDgRyP02EBVvdYGET0n8-w4Yr-Ld_MspW7Kms6WgGXo2_CViQEZ2u4Vrl8nABOLAqY5Zra2-ZcQUk1GrC02Xoc0k6rHclEMpsbctEoh_wlruJjy231n7Pah_o3So8Mv-LPAWzgtAbVUqaBFLu2Bns_OAcPodFHj3Im9zNNe-7LEOkUQri2w4LoDzJSi1fSx7nTL6rD0-3NqN2lhWgCVaGUSyqMNjrlgTb2YMeyKFAYaOsHE4YqYyxHpjQaW5PS5BE3WuRxogVDoZMgxSA8gsp0NsVjIDo0WYpcGsRcKJNKxRSLueFhKHScixOoO2tM3ta8GJPSEKd_tF_BTnfU7016d4OHM9h19neXGZyfQ2U5X-EFbGfvy5fF_NL79RPDVKAR
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