Propagating the clock through large networks and providing correct functioning of the system is a serious engineering problem. The clock appears at different moments for two different physical points/spl minus/clock skew problem. While the clock skew can be neglected for small systems, it results in major problems when building large concurrent networks. To overcome such problems the authors believe that the absolute solution is to eliminate the notion of clocking entirely throughout by adopting asynchronous design techniques. Packet switches are familiar components of concurrent architectures and a good example to illustrate asynchronous design. The paper describes the asynchronous implementation of three basic building blocks for asynchronous packet routers and also demonstrates asynchronous design techniques for VLSI design.<<ETX>>
[1]
William J. Dally,et al.
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
,
1987,
IEEE Transactions on Computers.
[2]
C. G. Huang,et al.
Compilation of process algebra expressions into delay-insensitive circuits
,
1993
.
[3]
Chris R. Jesshope,et al.
Adaptive, low latency, deadlock-free packet routing for networks of processors
,
1989
.
[4]
Charles L. Seitz,et al.
The cosmic cube
,
1985,
CACM.
[5]
Mark B. Josephs,et al.
An Algebra for Delay-Insensitive Circuits
,
1990,
CAV.
[6]
Mark B. Josephs,et al.
Delay-Insensitive Circuits: An Algebraic Approach to their Design
,
1990,
CONCUR.