Published 2006
| Published
Book Section - Chapter
Open
Slack Matching Quasi Delay-Insensitive Circuits
- Creators
- Prakash, Piyush
- Martin, Alain J.
Chicago
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
Files
(375.4 kB)
Name | Size | Download all |
---|---|---|
md5:4cdd92f0de30d1bc7fd9044884dc59d4
|
375.4 kB | Preview Download |
Additional details
- Eprint ID
- 22516
- Resolver ID
- CaltechAUTHORS:20110225-095524705
- Defense Advanced Research Projects Agency (DARPA)
- Created
-
2011-02-25Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field
- Series Name
- Proceedings-International Symposium on Advanced Research in Asynchronous Circuits and Systems
- Other Numbering System Name
- INSPEC Accession Number
- Other Numbering System Identifier
- 9017060