Performance Optimization of Latency Insensitive Systems Through Buffer Queue Sizing of Communication Channels

This paper proposes for latency insensitive systems a performanceoptimization technique called channel buffer queue sizing, whichis performed after relay station insertion in the physical designstage. It can be shown that proper queue sizing can reduce or evencompletely avoid the performance loss du...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International Conference on Computer Aided Design: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design; 09-13 Nov. 2003 s. 227
Hlavní autoři: Lu, Ruibing, Koh, Cheng-Kok
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: Washington, DC, USA IEEE Computer Society 09.11.2003
Edice:ACM Conferences
Témata:
General and reference > Cross-computing tools and techniques > Performance
Hardware > Communication hardware, interfaces and storage
Mathematics of computing > Probability and statistics > Statistical paradigms > Queueing theory
Networks
Security and privacy > Cryptography > Mathematical foundations of cryptography
Theory of computation > Computational complexity and cryptography > Communication complexity
ISBN:9781581137620, 1581137621
ISSN:1092-3152
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!
Popis
Shrnutí:This paper proposes for latency insensitive systems a performanceoptimization technique called channel buffer queue sizing, whichis performed after relay station insertion in the physical designstage. It can be shown that proper queue sizing can reduce or evencompletely avoid the performance loss due to imbalanced relaystations insertion in reconvergent paths. Moreover, the problemof queue sizing and placement of the additional buffers for maximumperformance is formulated and studied to properly allocateavailable chip areas in the layout to communication channels. Analgorithm based on mixed integer linear programming is proposed.Experimental results show that queue sizing is effective in improvingthe performance of latency insensitive systems even under tightarea constraints. Moreover, the proposed algorithm is sufficientlyefficient in obtaining the optimal solution for systems of practicalsizes.
Bibliografie:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:9781581137620
1581137621
ISSN:1092-3152
DOI:10.5555/996070.1009895