Optimal Regulation of Traffic Flows in Networks-on-Chip
2010 (English)In: Proceedings of the Design Automation and Test Europe Conference (DATE), IEEE Computer Society, 2010, 1621-1624 p.Conference paper (Refereed)
We have proposed (σ, ρ)-based flow regulation to reduce delay and backlog bounds in SoC architectures, where σ bounds the traffic burstiness and ρ the traffic rate. The regulation is conducted per-flow for its peak rate and traffic burstiness. In this paper, we optimize these regulation parameters in networks on chips where many flows may have conflicting regulation requirements. We formulate an optimization problem for minimizing total buffers under performance constraints. We solve the problem with the interior point method. Our case study results exhibit 48% reduction of total buffers and 16% reduction of total latency for the proposed problem. The optimization solution has low run-time complexity, enabling quick exploration of large design space.
Place, publisher, year, edition, pages
IEEE Computer Society, 2010. 1621-1624 p.
, Design, Automation, and Test in Europe Conference and Exhibition. Proceedings, ISSN 1530-1591
Flow regulation, In-network, Interior point methods, Large designs, Optimization problems, Optimization solution, Performance constraints, Runtimes, SoC architecture, Traffic burstiness, Traffic flow, Traffic rate
Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:kth:diva-63677ScopusID: 2-s2.0-77953098329ISBN: 978-398108016-2OAI: oai:DiVA.org:kth-63677DiVA: diva2:482594
DATE '10, Conference on Design, Automation and Test in Europe. Dresden, Germany. 8-12 March 2010
QC 201204252012-01-242012-01-242015-03-10Bibliographically approved