Performance Analysis Of Soc Architectures Based On Network Calculi: Mathematical Modeling, Analysis And Case Studies
This thesis describes a method for static performance analysis for obtaining upper bounds on delay and buffering requirements in a SoC architecture. The method is based on network calculus theory known as LR servers. This network calculus is extended and applied to make it support SoC performance analysis. Performance requirements of subsystems are elegantly captured as traffic flows and associate...
Paperback: 164 pages
Publisher: LAP LAMBERT Academic Publishing (September 16, 2010)
Product Dimensions: 5.9 x 0.4 x 8.7 inches
Format: PDF ePub TXT book
- 3843351104 epub
- 978-3843351102 epub
- Jelte Peter Vink pdf
- Jelte Peter Vink books
- epub ebooks
Download The story o the christian church jesse lyman hurlbut pdf at acinteruprov.wordpress.com The amiliars alace o reams Read How many books will be in the saehol series ebook anebigraph.wordpress.com Read Ining me ebook aquanestnakuros.wordpress.com Read Martin luther king books ebook justthrowhikiful.wordpress.com Read Balefire omnibus ebook alltiogekires.wordpress.com Read Slitting rotecting yoursel while ivorcing a borerline or narcissist ebook bmweqpukuplan.wordpress.com Download The sirit o laws pdf at allfulbudammer.wordpress.com
latency constraints. The SoC infrastructure is modeled as a set of LR servers to validate that the worst-case delays in handling the traffic flows meet the latency constraints. The power of the performance analysis method is demonstrated by analyzing several schedule and interconnect variants for a multi-channel DVB-T set-top box case study. The influence of the frequency of the memory system and the pipeline degree of the traffic streams is shown. Furthermore, the influence of the packet size on the buffering requirements is analyzed. Key architecture choices, such as schedule or interconnect variant, can be varied easily to support exploration of architecture options.