Computation completion detection is one of the implementations of asynchronous communication systems. Following are the features corresponding to this:

• Some sort of redundant data encoding is done so that the computation completion can be detected and this forms the request to the receiver stage. This is an additional area overhead.

• Completion detection can also be a part of the receiver stage.

• This implementation tolerates data skew

HDLPlanet                                                                                                            Move to Top

Delay padding is another implementation of asynchronous communication systems. Following are the features corresponding to this:

• This is somewhat similar to synchronous communication system except that the delay here can be different (corresponding to the delay of the logic involved) across different stages of a multi-stage pipeline.

• Additional overhead because whenever the logic between the register  stages changes, the delay should be calculated and re-padded.

• Time redundancy is involved (timing margins are required).

Last Updated on 26th Feb 2002