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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2007 44th ACM/IEEE Design Automation Conference S. 410 - 415
Hauptverfasser: Collins, Rebecca L., Carloni, Luca P.
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: New York, NY, USA ACM 04.06.2007
IEEE
Schriftenreihe:ACM Conferences
Schlagworte:
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
latency-insensitive design
performance analysis
ISBN:1595936270, 9781595936271
ISSN:0738-100X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
Bibliographie:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:1595936270
9781595936271
ISSN:0738-100X
DOI:10.1145/1278480.1278586