By Topic

Performance estimation and slack matching for pipelined asynchronous architectures with choice

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Gill, G. ; Dept. of Comput. Sci., Univ. of North Carolina, Chapel Hill, NC ; Gupta, V. ; Singh, M.

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 ldquoslack matchingrdquo. 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).

Published in:

Computer-Aided Design, 2008. ICCAD 2008. IEEE/ACM International Conference on

Date of Conference:

10-13 Nov. 2008