Slack Matching

Citation

Prakash, Piyush (2005) Slack Matching. Master's thesis, California Institute of Technology. doi:10.7907/g43p-hv51. https://resolver.caltech.edu/CaltechETD:etd-05272005-134017

Abstract

In this thesis we present a method for slack matching asynchronous circuits, described as a collection of handshaking expansions. We present an execution model for a restricted class of HSE. We define the number of messages that a process contains. The static slack, dynamic slack and dynamic threshold are defined. We state sufficient conditions under which the dynamic slack of a pipeline of half-buffers is the sum of that of the processes comprising the pipeline. The slack matching problem is formulated as that of ensuring that all pipelines and rings in a system can simultaneously contain a number of messages that is no less than the dynamic threshold but no greater than the dynamic slack. We describe an algorithm to formulate the slack matching problem as a mixed integer linear program.

Thesis Files