Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published 2006 | Published
Book Section - Chapter Open

Slack Matching Quasi Delay-Insensitive Circuits

Abstract

Slack matching is an optimization that determines the amount of buffering that must be added to each channel of a slack elastic asynchronous system in order to reduce its cycle time to a specified target. We present two methods of expressing the slack matching problem as a mixed integer linear programming problem. The first method is applicable to systems composed of either full-buffers or half-buffers but not both. The second method is applicable to systems composed of any combination of full-buffers and half-buffers.

Additional Information

© 2006 IEEE. Issue Date: 13-15 March 2006, Date of Current Version: 20 March 2006. The research described in this paper was supported by the Defense Advanced Research Projects Agency (DARPA) as part of the program in Power-Aware Computing and Communications (PAC/C) and monitored by the Air Force Office of Scientific Research.

Attached Files

Published - Prakash2006p9313Async_2009_15Th_Ieee_International_Symposium_On_Asynchronous_Circuits_And_Systems.pdf

Files

Prakash2006p9313Async_2009_15Th_Ieee_International_Symposium_On_Asynchronous_Circuits_And_Systems.pdf

Additional details

Created:
August 19, 2023
Modified:
January 13, 2024