Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

An energy and power-aware approach to high-level synthesis of asynchronous systems

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

2 Author(s)
Hansen, J. ; Univ. of North Carolina at Chapel Hill, Chapel Hill, NC, USA ; Singh, M.

In this paper we explore the problem of scheduling and allocation for asynchronous systems under latency, area, energy, and power constraints, and present exact methods for minimizing an implementation for either latency, area, or energy. This approach utilizes the the branch-and-bound strategy developed in [1], but targets a much more robust solution space by incorporating many-to-many mappings of operations to function units and energy and power considerations into the search space. Unlike many recent solutions that adapt synchronous methods to the asynchronous realm, our approach specifically targets the asynchronous domain. As a result, our solver's complexity and performance are independent of the discretization of time. We illustrate the effectiveness of this approach by running 36 different test cases on small and large input specifications; results are produced in 60 seconds or less for each example.

Published in:

Computer-Aided Design (ICCAD), 2010 IEEE/ACM International Conference on

Date of Conference:

7-11 Nov. 2010