12th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'06) Slack Matching Quasi Delay-Insensitive Circuits Grenoble, France March 13-March 15 ISBN: 0-7695-2498-2
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ASYNC.2006.27
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.
Citation:
Piyush Prakash, Alain J. Martin, "Slack Matching Quasi Delay-Insensitive Circuits," async, pp.195-204, 12th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'06), 2006 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||