Sciweavers

Share
ICCAD
2008
IEEE

Performance estimation and slack matching for pipelined asynchronous architectures with choice

10 years 10 months ago
Performance estimation and slack matching for pipelined asynchronous architectures with choice
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the problem of pipelining “slack matching.” The approach targets systems with hierarchical topologies, which typically result when high-level (block structured) language specifications are compiled into data-driven circuit implementations. A significant contribution is that our approach is the first to efficiently handle architectures with choice (i.e., the presence of conditional computation constructs such if-then-else and conditional loops). The key idea behind the fast speed of our analysis method is to exploit information about the hierarchy of a given block-structured system, thereby yielding a runtime that is linear in the number of pipeline stages. In contrast, existing approaches typically represent an entire system as a single Petri net or marked graph, and then apply Markov chain analysis or other ...
Gennette Gill, Vishal Gupta, Montek Singh
Added 16 Mar 2010
Updated 16 Mar 2010
Type Conference
Year 2008
Where ICCAD
Authors Gennette Gill, Vishal Gupta, Montek Singh
Comments (0)
books