How to achieve worst-case performance

Proceedings - International Symposium on Asynchronous Circuits and Systems

Volumn , Issue , 2001, Pages 206-216

  Greenstreet, Mark R ^a   De Alwis, Brian ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FLOW GRAPHS; FLOW OF FLUIDS; PERCOLATION (SOLID STATE); POROUS MATERIALS; SOLVENTS;

AVERAGE CASE PERFORMANCE; CRITICAL PHENOMENON; DESIGN COMPUTATIONS; INFINITE GRAPH; PERCOLATION NETWORKS; PERFORMANCE; SELF-TIMED; SELF-TIMED CIRCUITS; WORST-CASE PERFORMANCE; WORST-CASE TIME;

CHAINS;

EID: 2942676576     PISSN: 26431394     EISSN: 26431483     Source Type: Conference Proceeding    
DOI: 10.1109/ASYNC.2001.914084     Document Type: Conference Paper

References (19)

1. W. chun Chou, P. A. Beere], et al. Average-case optimized technology mapping of one-hot domino circuits. In Proceedings of the Fourth International Symposium on Advanced Research in Asynchronous Circuits and Systems, pages 80-91, San Diego, California," Apr. 1998. IEEE.
2. R. Durrett. Oriented percolation in two dimensions. The Annals of Probability, 12:999-1040, 1984.
3. W. Feller. An Introduction to Probability Theory and Its Applications, volume 1. John-Wiley and Sons, 1950.
4. E. Gelenbe. Multiprocessor Performance. John Wiley and Sons, 1989.
5. M. R. Greenstreet and K. Steiglitz. Bubbles can make self-timed pipelines fast. Journal of VLSI and Signal Processing, 2(3):139-148, Nov. 1990.
6. G. R. Grimmett. Percolation. URL: http://www.statslab.cam.ac.uk/~grg/ papers/USopt.ps.
7. G. R. Grimmett. Percolation. Springer, second edition, 1999.
8. J. Hammersley and D. Welsh. Origins of percolation theory. Annals of the Israel Physical Society, 5:47-57, 1983.
9. K. W. James and K. Y. Yun. Average-case optimized transistor-level mapping of extended burst-mode circuits. In Proceedings of the Fourth International Symposium on Advanced Research in Asynchronous Circuits and Systems, pages 70-79, San Diego, California, Apr. 1998. IEEE.
10. H. Kesten. The critical probability of bond percolation on the square latice equals 1/2. Mathematical Physics, 74:41-59, 1980.
11. A. J. Martin, A. Lines, et al. The design of an asynchronous MIPS R3000 microprocessor. In Proceedings of the 17th Conference on Advanced Research in VLSI, pages 164-181, Sept. 1997.
12. S. M. Nowick, K. Y. Yun, et al. Speculative completion for the design of high-performance asynchronous dynamic adders. In Proceedings of the Third International Symposium on Advanced Research in Asynchronous Circuits and Systems, pages 210-223, Eindhoven, The Netherlands, Apr. 1997. IEEE.
13. P. B. Pang and M. R. Greenstreet. Self-timed meshes are faster than synchronous. In Proceedings of the Third International Symposium on Advanced Research in Asynchronous Circuits and Systems, pages 30-39. IEEE, Apr. 1997.
14. C. L. Seitz. System timing. In Introduction to VLSI Systems (Carver Mead and Lynn Conway), chapter 7. Addison Wesley, 1979. See the adder example in section on pages 251-252.
15. D. Stauffer. Minireview: New results for old percolation. Physica A, 242(1-2):1-7, Aug. 1997.
16. L. Thiele. On the analysis and optimization of self-timed processor arrays. INTEGRATION, 12(2):167-187, Dec. 1991.
17. A. Xie and P. A. Beerel. Symbolic techniques for performance analysis of timed systems based on average time separation of events. In Proc. International Symposium on Advanced Research in Asynchronous Circuits and Systems, pages 64-75. IEEE Computer Society Press, Apr. 1997.
18. A. Xie, S. Kim, and P. A. Beerel. Bounding average time separations of events in stochastic timed Petri nets with choice. In Proc. International Symposium on Advanced Research in Asynchronous Circuits and Systems, pages 94-107, Apr. 1999.
19. R. M. Ziff. Spanning probability in 2D percolation. Physical Review Letters, 69(18):2670-2673, Nov. 1992.