Slack matching quasi delay-insensitive circuits

Author

Prakash, Piyush ; Martin, Alain J.

Author_Institution

Dept. of Comput. Sci., California Inst. of Technol., Pasadena, CA

fYear

2006

fDate

13-15 March 2006

Lastpage

204

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

Keywords

asynchronous circuits; buffer circuits; circuit optimisation; integer programming; linear programming; logic design; buffer circuits; mixed integer linear programming; quasidelay-insensitive circuits; slack elastic asynchronous system; slack matching; Circuits; Clocks; Communication channels; Computer science; Delay effects; Message passing; Mixed integer linear programming; Pipelines; Synchronization; Throughput;

fLanguage

English

Publisher

ieee

Conference_Titel

Asynchronous Circuits and Systems, 2006. 12th IEEE International Symposium on

Conference_Location

Grenoble

ISSN

1522-8681

Print_ISBN

0-7695-2498-2

Type

conf

DOI

10.1109/ASYNC.2006.27

Filename

1595703

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3279038