loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Third International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC '97)
Self-Timed Meshes Are Faster Than Synchronous
Eindhoven, THE NETHERLANDS
April 07-April 10
ISBN: 0-8186-7922-0
P.B.K. Pang, Dept. of Comput. Sci., British Columbia Univ., Canada
M.R. Greenstreet, Dept. of Comput. Sci., British Columbia Univ., Canada
This paper shows that self-timed meshes can achieve linear speed-up. The per-processor performance of a mesh is the average number of operations per processor per unit time. For synchronous processors, it has been shown that the per-processor performance of a mesh goes to zero as the size of the mesh goes to infinity. This paper shows that for self-timed meshes, the per-processor performance can be bounded below by a positive constant. Thus, self-timed meshes are asymptotically faster than synchronous ones. Furthermore, simulation and analytic results are used to show that analysis based solely on average case times can be optimistic and leads to poor design decisions.
Index Terms:
logic CAD, self-timed meshes, linear speed-up, per-processor performance, simulation
Citation:
P.B.K. Pang, M.R. Greenstreet, "Self-Timed Meshes Are Faster Than Synchronous," async, pp.30, Third International Symposium on Advanced Research in Asynchronous Circuits and Systems (ASYNC '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.