Simultaneous budget and buffer size computation for throughput-constrained task graphs

Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on a multiprocessor system as a task graph. Tasks communicate data over buffers, where tasks wait on sufficient space in output buffe...

Full description

Saved in:
Bibliographic Details
Published in:2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010) pp. 1669 - 1672
Main Authors: Wiggers, Maarten H, Bekooij, Marco J G, Geilen, Marc C W, Basten, Twan
Format: Conference Proceeding
Language:English
Published: IEEE 01.03.2010
Subjects:
Costs
Linear programming
Multimedia systems
Multiprocessing systems
Optimization methods
Polynomials
Processor scheduling
Runtime
Streaming media
Throughput
ISBN:1424470544, 9781424470549
ISSN:1530-1591
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on a multiprocessor system as a task graph. Tasks communicate data over buffers, where tasks wait on sufficient space in output buffers before producing their data. For cost reasons, jobs share resources. Because jobs can share resources with other jobs that include tasks with date-dependent execution rates, we assume run-time scheduling on shared resources. Budget schedulers are applied, because they guarantee a minimum budget in a maximum replenishment interval. Both the buffer sizes as well as the budgets influence the temporal behaviour of a job. Interestingly, a trade-off exists: a larger buffer size can allow for a smaller budget while still meeting the throughput requirement. This work is the first to address the simultaneous computation of budget and buffer sizes.We solve this non-linear problem by formulating it as a second-order cone program. We present tight approximations to obtain a non-integral second-order cone program that has polynomial complexity. Our experiments confirm the non-linear trade-off between budget and buffer sizes.
AbstractList Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on a multiprocessor system as a task graph. Tasks communicate data over buffers, where tasks wait on sufficient space in output buffers before producing their data. For cost reasons, jobs share resources. Because jobs can share resources with other jobs that include tasks with date-dependent execution rates, we assume run-time scheduling on shared resources. Budget schedulers are applied, because they guarantee a minimum budget in a maximum replenishment interval. Both the buffer sizes as well as the budgets influence the temporal behaviour of a job. Interestingly, a trade-off exists: a larger buffer size can allow for a smaller budget while still meeting the throughput requirement. This work is the first to address the simultaneous computation of budget and buffer sizes.We solve this non-linear problem by formulating it as a second-order cone program. We present tight approximations to obtain a non-integral second-order cone program that has polynomial complexity. Our experiments confirm the non-linear trade-off between budget and buffer sizes.
Author Wiggers, Maarten H
Geilen, Marc C W
Basten, Twan
Bekooij, Marco J G
Author_xml – sequence: 1
  givenname: Maarten H
  surname: Wiggers
  fullname: Wiggers, Maarten H
  email: m.h.wiggers@tue.nl
  organization: Eindhoven Univ. of Technol., Eindhoven, Netherlands
– sequence: 2
  givenname: Marco J G
  surname: Bekooij
  fullname: Bekooij, Marco J G
  email: marco.bekooij@nxp.com
  organization: NXP Semicond., Eindhoven, Netherlands
– sequence: 3
  givenname: Marc C W
  surname: Geilen
  fullname: Geilen, Marc C W
  email: m.c.w.geilen@tue.nl
  organization: Eindhoven Univ. of Technol., Eindhoven, Netherlands
– sequence: 4
  givenname: Twan
  surname: Basten
  fullname: Basten, Twan
  email: a.a.basten@tue.nl
  organization: Eindhoven Univ. of Technol., Eindhoven, Netherlands
BookMark eNotUM1OAjEYrBETAXkA46UvsPi127LtkSD-JCQeJF5Ju_0WqtCStnvQp3cTmcv8HGaSmZBRiAEJuWcwZwz049Nyu55zGKwUsgHFr8hMN6rWioECtuDXZMIEF6IBKcSIjJmsoWJSs1syy_kLBkipOCzG5PPDn_pjMQFjn6nt3R4LNcENsusw0ex_kbbxdO6LKT4G2sVEyyHFfn8YsqqNIZdkfEBHi8nfdJ_M-ZDvyE1njhlnF56S7fN6u3qtNu8vb6vlpvIaSiUctmC4FYKzBgU61hgD1tphWnQtQysHzRGda7g2NZh6gcKyVmGnWqvrKXn4r_WIuDsnfzLpZ3d5pf4D8VtZKQ
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/DATE.2010.5457082
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 Engineering
Computer Science
EISBN 9783981080162
3981080165
EndPage 1672
ExternalDocumentID 5457082
Genre orig-research
GroupedDBID 123
29F
29O
6IE
6IF
6IH
6IK
6IL
6IN
AAJGR
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
FEDTE
IEGSK
IPLJI
KZ1
LMP
M43
OCL
RIE
RIL
RNS
ID FETCH-LOGICAL-i90t-4dec0a2b44217e4ed17aa0bbbffe4fc1eb5bbf2eedd729a30a36e4b1c8ef8cb93
IEDL.DBID RIE
ISBN 1424470544
9781424470549
ISSN 1530-1591
IngestDate Wed Aug 27 02:26:44 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-4dec0a2b44217e4ed17aa0bbbffe4fc1eb5bbf2eedd729a30a36e4b1c8ef8cb93
PageCount 4
ParticipantIDs ieee_primary_5457082
PublicationCentury 2000
PublicationDate 2010-March
PublicationDateYYYYMMDD 2010-03-01
PublicationDate_xml – month: 03
  year: 2010
  text: 2010-March
PublicationDecade 2010
PublicationTitle 2010 Design, Automation & Test in Europe Conference & Exhibition (DATE 2010)
PublicationTitleAbbrev DATE
PublicationYear 2010
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000558206
ssj0005329
ssj0001174897
Score 1.7722348
Snippet Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are...
SourceID ieee
SourceType Publisher
StartPage 1669
SubjectTerms Costs
Linear programming
Multimedia systems
Multiprocessing systems
Optimization methods
Polynomials
Processor scheduling
Runtime
Streaming media
Throughput
Title Simultaneous budget and buffer size computation for throughput-constrained task graphs
URI https://ieeexplore.ieee.org/document/5457082
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV27TsMwFLXaigGWQlvEWx4YCXUaJ05GBK0YUFWJqupW-XGDIqQUNQkDX8-1k7YgsbBEjoc4dmLd4_s4h5DbQEcjwxLlcdDc4xwvihvuaRYhGEEMLV1t1eJFTKfxcpnMWuRuVwsDAC75DO5t08XyzVpX1lU2RGsv0GS1SVuIqK7V2vlTWBhaKvK9f8W3vCpin-4ROMUy3ODMQxPub4u8BGIWvuV-au6TJvzps2T49DAf1xlgzei_ZFicFZp0__f-x2SwL-ejs52hOiEtyHuku9VzoM327pGjH-SEfbJ4zWy2ocxhXRVUVeYNSipzg02rqUKL7Auodg9xX5ci_KWN7A_2edoiTytAAYaWsninjhu7GJD5ZDx_fPYaFQYvS1jpcQOayZHiHA8vwMH4QkqmlMKheKp9UCG2RzgDgzhdBkwGEXDl6xjSWKskOCWdfJ3DGaFBoEdJKkPFbGwxtiE5I4XQeMJJrQzTOenbNVt91Dwbq2a5Lv7uviSHdSTf5oNdkU65qeCaHOjPMis2N-7n-Abr4rPK
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NT8JAEJ0gmqgXFDB-uwePVrbtltKjUQlGJCQSwo3sx2CISTG0ePDXO7sU0MSLl2a6h2522s287sy8B3Ad6mZgeKI8gVp4QtBFCSM8zZsERghDS9dbNezGvV5rNEr6JbhZ98Igois-w1truly-memFPSprULSPKWRtwXYkRMCX3VrrExUeRZaMfHPC4ltmlXhT8BE6zTLa4tyjIO6v2rxiQi1ixf5U3CdFAtTnSePhbvC4rAEr5v8lxOLiULvyvxUcQH3T0Mf661B1CCVMq1BZKTqwYoNXYf8HPWENhq9TW28oU5wtMqYW5g1zJlNDplVVYdn0C5l2D3HvlxEAZoXwD4152mJPK0GBhuUye2eOHTurw6D9OLjveIUOgzdNeO4Jg5rLQJHL_RgFGj-WkiulaCox0T6qiOyAVmAIqcuQy7CJQvm6hZOWVkl4BOV0luIxsDDUQTKRkeI2u9iySTkj41jTP87ECjGdQM36bPyxZNoYF-46_Xv4CnY7g5fuuPvUez6DvWVe31aHnUM5ny_wAnb0Zz7N5pfuQ_kGeDG3EQ
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=2010+Design%2C+Automation+%26+Test+in+Europe+Conference+%26+Exhibition+%28DATE+2010%29&rft.atitle=Simultaneous+budget+and+buffer+size+computation+for+throughput-constrained+task+graphs&rft.au=Wiggers%2C+Maarten+H&rft.au=Bekooij%2C+Marco+J+G&rft.au=Geilen%2C+Marc+C+W&rft.au=Basten%2C+Twan&rft.date=2010-03-01&rft.pub=IEEE&rft.isbn=9781424470549&rft.issn=1530-1591&rft.spage=1669&rft.epage=1672&rft_id=info:doi/10.1109%2FDATE.2010.5457082&rft.externalDocID=5457082
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1530-1591&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1530-1591&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1530-1591&client=summon