Topology-based optimization of maximal sustainable throughput in a latency-insensitive system

We consider the problem of optimizing the performance of a latency-insensitive system (LIS) where the addition of backpressure has caused throughput degradation. Previous works have addressed the problem of LIS performance in different ways. In particular, the insertion of relay stations and the siz...

Full description

Saved in:
Bibliographic Details
Published in2007 44th ACM/IEEE Design Automation Conference pp. 410 - 415
Main Authors Collins, Rebecca L., Carloni, Luca P.
Format Conference Proceeding
LanguageEnglish
Published New York, NY, USA ACM 04.06.2007
IEEE
SeriesACM Conferences
Subjects
Online AccessGet full text
ISBN1595936270
9781595936271
ISSN0738-100X
DOI10.1145/1278480.1278586

Cover

Abstract We consider the problem of optimizing the performance of a latency-insensitive system (LIS) where the addition of backpressure has caused throughput degradation. Previous works have addressed the problem of LIS performance in different ways. In particular, the insertion of relay stations and the sizing of the input queues in the shells are the two main optimization techniques that have been proposed. We provide a unifying framework for this problem by outlining which approaches work for different system topologies, and highlighting counterexamples where some solutions do not work. We also observe that in the most difficult class of topologies, instances with the greatest throughput degradation are typically very amenable to simplifications. The contributions of this paper include a characterization of topologies that maintain optimal throughput with fixed-size queues and a heuristic for sizing queues that produces solutions close to optimal in a fraction of the time.
AbstractList We consider the problem of optimizing the performance of a latency-insensitive system (LIS) where the addition of backpressure has caused throughput degradation. Previous works have addressed the problem of LIS performance in different ways. In particular, the insertion of relay stations and the sizing of the input queues in the shells are the two main optimization techniques that have been proposed. We provide a unifying framework for this problem by outlining which approaches work for different system topologies, and highlighting counterexamples where some solutions do not work. We also observe that in the most difficult class of topologies, instances with the greatest throughput degradation are typically very amenable to simplifications. The contributions of this paper include a characterization of topologies that maintain optimal throughput with fixed- size queues and a heuristic for sizing queues that produces solutions close to optimal in a fraction of the time.
Author Collins, Rebecca L.
Carloni, Luca P.
Author_xml – sequence: 1
  givenname: Rebecca L.
  surname: Collins
  fullname: Collins, Rebecca L.
  organization: Columbia University
– sequence: 2
  givenname: Luca P.
  surname: Carloni
  fullname: Carloni, Luca P.
  organization: Columbia University
BookMark eNqNkD9PwzAUxC0BErR0ZmDxhFhSbMeJnRFV_JMqsXRgQZadPBdDYofYQZRPT1D7AZhOp7t70vvN0LEPHhC6oGRJKS9uKBOSy8lMWsjyCM1oURVVXjJBjtEZEbnMKCEvp2gR4zshhNJcMi7O0Osm9KEN211mdIQGhz65zv3o5ILHweJOf7tOtziOMWnntWkBp7chjNu3fkzYeaxxqxP4epc5H8FHl9wX4LiLCbpzdGJ1G2Fx0Dna3N9tVo_Z-vnhaXW7zjRleZnJyghumTZWCsPrgufamqYgpbWkqVhDbC05EAtABJhaaGlqVjS8aWzFa53P0dX-bD-EzxFiUp2LNbSt9hDGqHJaFoyW5VS83BcdAKh-mF4bdoqzkjIqpnS5T3XdKRPCR1SUqD_A6gBYHQArMziw0-D6n4P8Fwy1fjg
ContentType Conference Proceeding
Copyright 2007 ACM
Copyright_xml – notice: 2007 ACM
DBID 6IE
6IH
CBEJK
RIE
RIO
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1145/1278480.1278586
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList

Computer and Information Systems Abstracts
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EndPage 415
ExternalDocumentID 4261217
Genre orig-research
Conference Paper
GroupedDBID 6IE
6IF
6IG
6IH
6IK
6IL
6IM
6IN
AAJGR
AARBI
ACM
ADPZR
ALMA_UNASSIGNED_HOLDINGS
APO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
GUFHI
IERZE
OCL
RIE
RIL
RIO
123
29O
AAWTH
ACGFS
ADZIZ
CHZPO
IEGSK
IJVOP
IPLJI
M43
RNS
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-a1236-89b74f2abf87b4c543afbd506ff0d92d0fc84e0fee07ebc7a8bc25d4ddf94ca3
IEDL.DBID RIE
ISBN 1595936270
9781595936271
ISSN 0738-100X
IngestDate Fri Sep 05 12:49:10 EDT 2025
Wed Aug 27 01:44:46 EDT 2025
Wed Jan 31 06:35:57 EST 2024
Wed Jan 31 06:35:56 EST 2024
IsPeerReviewed false
IsScholarly true
Keywords latency-insensitive design
performance analysis
Language English
License Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org
LinkModel DirectLink
MeetingName DAC07: The 44th Annual Design Automation Conference 2007
MergedId FETCHMERGED-LOGICAL-a1236-89b74f2abf87b4c543afbd506ff0d92d0fc84e0fee07ebc7a8bc25d4ddf94ca3
Notes SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
PQID 31652166
PQPubID 23500
PageCount 6
ParticipantIDs ieee_primary_4261217
acm_books_10_1145_1278480_1278586_brief
acm_books_10_1145_1278480_1278586
proquest_miscellaneous_31652166
PublicationCentury 2000
PublicationDate 20070604
2007-June
PublicationDateYYYYMMDD 2007-06-04
2007-06-01
PublicationDate_xml – month: 06
  year: 2007
  text: 20070604
  day: 04
PublicationDecade 2000
PublicationPlace New York, NY, USA
PublicationPlace_xml – name: New York, NY, USA
PublicationSeriesTitle ACM Conferences
PublicationTitle 2007 44th ACM/IEEE Design Automation Conference
PublicationTitleAbbrev DAC
PublicationYear 2007
Publisher ACM
IEEE
Publisher_xml – name: ACM
– name: IEEE
SSID ssj0001138247
ssj0004161
Score 1.632654
Snippet We consider the problem of optimizing the performance of a latency-insensitive system (LIS) where the addition of backpressure has caused throughput...
SourceID proquest
ieee
acm
SourceType Aggregation Database
Publisher
StartPage 410
SubjectTerms Buffer storage
Clocks
Computer science
Concurrent computing
Degradation
Hardware -- Electronic design automation -- High-level and register-transfer level synthesis
Latency-Insensitive Design
Performance Analysis. General Terms Algorithms
Pipeline processing
Relays
Theory of computation -- Models of computation
Throughput
Topology
Wire
Title Topology-based optimization of maximal sustainable throughput in a latency-insensitive system
URI https://ieeexplore.ieee.org/document/4261217
https://www.proquest.com/docview/31652166
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjZ3baxQxFMYP3T7pS7WtuFVrhIIvzXYuySR5bWmppVuFrrAvEnI5gUV3tnR3wfrXm8ylKyro2wxMhhm-3HO-3wE4wrjqMDkqGowwlKGw1MigaFEorwrnyrLJGTm-qS4_s6spn27B8aMXBhGb4DMcpcvmLN8v3DptlZ2whnclBjAQsmq9Wpv9lATTY2LjicwbVmqswQlfmk2TqYsnCm9ViJ711N_nHfMnZ_wkTydxMlEXhOTJYT0wbt6lXvmjv24GoYsdGPef38aefB2tV3bkfvxGdvzf_3sG-xu7H_n0OJA9hy2sd2Gnz_dAuua_C09_gRfuwZdJm1_hgZ7GkdCTj7HzmXeuTrIIZGy-z-bmG7ndWLTIpM0KFN9LZjUx5NqkKfsD_ZB2uJdNGBNpGer7MLk4n5xd0i5ZAzUJ4EKlsoKFwtgghWWOs9IE63lWhZBF1X0WnGSYBcRMoHXCSOsK7pn3QTFnyhewXS9qfAnE2YJZJcsKRUIHOaOsEcErYXkIXvohvIuS6LQIWerWV811J5vuZBvC-38-o-39DMMQ9pIQ-q6Fe-hOgyG87aXWscGlUxRT42K91GVexSlPVR38veAreNKHFGb5a9he3a_xTZy3rOxhU2F_Av1C46Y
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjZ3JaxsxFMYfWQ5tL2mWEjdtokKhl8qZRRpJ14QEJ7HTQqfgSxFawbQel9iGJn99pVnikgaS2wzMDIhP87S97_cAPrqw6lCpE9grpjBxTGPFvcBZJqzIjMnzumbk6LoYfCeXYzpeg8_3XhjnXJ185vrxsj7LtzOzjFtlx6TmXbF12KSEENq4tVY7KhGnR9jKFZnWtNTQhyPANBlHWxeNHN4iYx3tqbtPW-pPSuhxGs_ieOQuME6jx3pdmWlbfOW_iF0PQ-dbMOoa0GSf_OwvF7pv7h6wHZ_bwtewtzL8oa_3Q9k2rLlqB7a6ig-oDQA78OoffOEu_CibCgu3-CSMhRZ9CeFn2vo60cyjkfozmapf6NvKpIXKpi5Q-C6aVEihoYqT9lt8Efe453UiE2oo6ntQnp-VpwPclmvAKiJcMBeaEZ8p7TnTxFCSK68tTQrvk6C7TbzhxCXeuYQ5bZji2mTUEmu9IEblb2CjmlVuH5DRGdGC54VjER5klNCKeSuYpt5bbnvwIUgi4zJkLhtnNZWtbLKVrQefnnxG6puJ8z3YjULI3w3eQ7Ya9OCok1qGXy6eo6jKzZZzmadFmPQUxdvHXzyCF4NyNJTDi-urA3jZJRgm6TvYWNws3fswi1now7rz_gUWNebz
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=2007+44th+ACM%2FIEEE+Design+Automation+Conference&rft.atitle=Topology-Based+Optimization+of+Maximal+Sustainable+Throughput+in+a+Latency-Insensitive+System&rft.au=Collins%2C+R.L.&rft.au=Carloni%2C+L.P.&rft.date=2007-06-01&rft.pub=IEEE&rft.isbn=9781595936271&rft.issn=0738-100X&rft.spage=410&rft.epage=415&rft_id=info:doi/10.1145%2F1278480.1278586&rft.externalDocID=4261217
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0738-100X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0738-100X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0738-100X&client=summon