Search: 
 
Commands
  Search pubs database

Quick search by ...
Theme
  alternative
concurrent
core
resilient
heterogeneous
infrastructure
microarch
power
reliable
roadmap
self_test
soft
verification

Design Driver
  driver
ambient
gateway
Year
  2008
2007
2006
2005
2004
2003
2002
2001
2000
1999
1998


Group
  2006faculty
bee2
bk_partitioning
bk_placement
bk_routing
bookshelf
embedded
fabricsthrust
faculty
fresco
gsrc
gsrcadmin
gsrc_faculty
gtx
infrax
marcov
mescal
metropolis
nexsis
polis
ptolemy
semantics
sig_modeling
sig_power
sig_uarch
sig_verification
testthrust
theme_leaders
 Topology-Based Performance Analysis and Optimization of Latency-Insensitive Systems
Rebecca Collins, Luca Carloni

Citation
Rebecca Collins, Luca Carloni. "Topology-Based Performance Analysis and Optimization of Latency-Insensitive Systems". Technical report, Columbia University, CUCS-003-08, January, 2008.

Abstract
Latency-insensitive protocols allow system-on-chip engineers to decouple the design of the computing cores from the design of the inter-core communication channels while following the synchronous design paradigm. In a latency-insensitive system (LIS) each core is encapsulated within a shell, a synthesized interface module that dynamically controls its operation. At each clock period, if new data has not arrived on an input channel or a stalling request has arrived on an output channel, the shell stalls the core and buffers other incoming valid data for future processing. The combination of finite buffers and backpressure from stalling can cause throughput degradation. Previous works addressed this problem by increasing buffer space to reduce the backpressure requests or inserting extra buffering to balance the channel latency around a LIS. We explore the theoretical complexity of these approaches and propose a heuristic algorithm for efficient queue sizing. We also practically characterize several LIS topologies and how the topology of a LIS can impact not only how much throughput degradation will occur, but also the difficulty of finding optimal queue sizing solutions.

Electronic downloads
Confidential. This publication has been marked by the author for GSRC-only distribution, so electronic downloads are not available without logging in.

Citation formats  

  • HTML
    Rebecca Collins, Luca Carloni. <a
    href="http://www.gigascale.org/pubs/1287.html"><i>Topology-Based
    Performance Analysis and Optimization of Latency-Insensitive
    Systems</i></a>, Technical report,  Columbia
    University, CUCS-003-08, January, 2008.
  • Plain text
    Rebecca Collins, Luca Carloni. "Topology-Based Performance
    Analysis and Optimization of Latency-Insensitive Systems".
    Technical report,  Columbia University, CUCS-003-08,
    January, 2008.
  • BibTeX
    @techreport{CollinsCarloni08_TopologyBasedPerformanceAnalysisOptimizationOfLatencyInsensitive,
        author = {Rebecca Collins and Luca Carloni},
        title = {Topology-Based Performance Analysis and
                  Optimization of Latency-Insensitive Systems},
        institution = {Columbia University},
        number = {CUCS-003-08},
        month = {January},
        year = {2008},
        abstract = {Latency-insensitive protocols allow system-on-chip
                  engineers to decouple the design of the computing
                  cores from the design of the inter-core
                  communication channels while following the
                  synchronous design paradigm. In a
                  latency-insensitive system (LIS) each core is
                  encapsulated within a shell, a synthesized
                  interface module that dynamically controls its
                  operation. At each clock period, if new data has
                  not arrived on an input channel or a stalling
                  request has arrived on an output channel, the
                  shell stalls the core and buffers other incoming
                  valid data for future processing. The combination
                  of finite buffers and backpressure from stalling
                  can cause throughput degradation. Previous works
                  addressed this problem by increasing buffer space
                  to reduce the backpressure requests or inserting
                  extra buffering to balance the channel latency
                  around a LIS. We explore the theoretical
                  complexity of these approaches and propose a
                  heuristic algorithm for efficient queue sizing. We
                  also practically characterize several LIS
                  topologies and how the topology of a LIS can
                  impact not only how much throughput degradation
                  will occur, but also the difficulty of finding
                  optimal queue sizing solutions.},
        URL = {http://www.gigascale.org/pubs/1287.html}
    }
    

Posted by Rebecca Collins on 22 Apr 2008..

Notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.

 
You are not logged in
©1998-2008 GSRC