Asynchronous and Clocked Control Structures for VSLI Based Interconnection Networks

IEEE Transactions on Computers

Volumn C-32, Issue 3, 1983, Pages 284-293

  Wann, Donald F ^a   Franklin, Mark A ^a  

^a WASHINGTON UNIVERSITY   (United States)

Author keywords

Asynchronous; clock skew; clocked; crossbar; interconnection; multiprocessors; networks; self timed; switches; switching modules

Indexed keywords

COMPUTER SYSTEMS, DIGITAL;

EID: 0020719554     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1983.1676220     Document Type: Article

References (32)

1. S. Anantharaman, “Delays in PLA's: Analysis, reduction and computer aided optimization,” M.S. thesis, Dep. Elec. Eng., Washington Univ., St. Louis, MO, 1982.
2. V. E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic. New York: Academic, 1965.
3. W. A. Clark, “Macromodular computer systems,” in Proc. AFIPS 1967 SJCC, vol. 30, pp. 335-336.
4. J. B. Dennis and D. P. Minsunas, “A preliminary architecture for a basic data-flow processor,” in Proc. 2nd Annu. Symp. Comput. Arch., Jan. 1975, pp. 126-132.
5. Digital Equipment Corp., Microcomputers and Memories. Maynard, MA: DEC Press, 1981.
6. T. P. Fang, “On the design of hazard free circuits,” Comput. Syst. Lab., Washington Univ., St. Louis, MO, Tech. Memo. 285, Nov. 1981.
7. M. A. Franklin, S. A. Kahn, and M. J. Stucki, “Design issues in the development of a modular multiprocessor communications network,” in Proc. 6th Annu. Symp. Comp. Arch., Apr. 1979, pp. 182-187.
8. M. A. Franklin and D. F. Wann, “Pin limitations and VLSI interconnection networks,” in Proc. 1981 Int. Conf. Parallel Process., 1981, pp. 253-258.
9. M. A. Franklin, “VLSI performance comparison of banyan and crossbar switching networks,” IEEE Trans. Comput., vol. C-30, pp. 283-291, Apr. 1981.
10. M.A. Franklin, D. F. Wann, and W. J. Thomas, “Pin limitations and partitioning of VLSI interconnection networks,” IEEE Trans. Comput. vol. C-31, pp. 1109-1116, Nov. 1982.
11. L. R. Goke and G. J. Lipovski, “Banyan networks for partitioning multiprocessor systems,” in Proc. 1st Annu. Symp. Comput. Arch., 1973, pp. 21-28.
12. D. Hoey and C. E. Leiserson, “A layout for the shuffle-exchange network,” in Proc. 1980 Int. Conf. Parallel Process., Aug. 1980, pp. 329-336.
13. D. H. Lawrie, “Access and alignment of data in an array processor,” IEEE Trans. Comput., vol. C-24, pp. 1145-1155, Dec. 1975.
14. J. Lyman, “Chip carriers, pin-grid arrays change the PC board landscape,” Electronics, pp. 66-75, Dec. 29, 1981.
15. M. Malek and W. W. Myre, “Figures of merit for interconnection networks,” in Proc. Workshop on Interconnection Networks Parallel Distribut. Process., Apr. 1980, pp. 74-83.
16. C. Mead and L. Conway, Introduction to VLSI Systems. Reading, MA: Addison-Wesley, 1980.
17. K. Padmanabhan, “Multiprocessor interconnection networks in a VLSI environment,” M.S. thesis, Dep. Elec. Eng., Washington Univ., St. Louis, MO, 1981.
18. J. H. Patel, “Performance of processor-memory interconnection networks for multiprocessors,” IEEE Trans. Comput., vol. C-30, pp. 771-780, Oct. 1981.
19. M. C. Pease, “The indirect binary n-cube microprocessor array,” IEEE Trans. Comput., vol. C-26, pp. 458-473, May 1977.
20. B. Quatember, “Modular crossbar switch for large-scale multiprocessor systems–Structure and implementation,” in Proc. AFIPS 1981 Nat. Comput. Conf., vol. 50, pp. 125-135.
21. C. L. Seitz, “Self-timed VLSI systems,” in Proc. Caltech Conf. VLSI, Jan. 1979, pp. 345-355.
22. C. L. Seitz, “System timing,” in Introduction to VLSI Systems, C. Mead and L. Conway, Eds. Reading, MA: Addison-Wesley, 1980, pp. 218-262.
23. M. C. Sejnowski et al., “An overview of the Texas reconfigurable array computer,” in Proc. AFIPS 1980 Nat. Comput. Conf., vol. 49, pp. 631-641.
24. H. J. Siegel, R. J. McMillen, and P. T. Mueller, Jr., “A survey of interconnection methods for reconfigurable parallel processing systems,” in Proc. AFIPS 1979 Nat. Comput Conf., vol. 48, pp. 529-548.
25. H. Sullivan, T. R. Bashkow and K. Klappholz, “A large scale, homogeneous, fully distributed parallel machine: I,” in Proc. 4th Annu. Symp. Comput. Arch., Mar. 1977, pp. 105-117.
26. I. E. Sutherland et al., “The TRIMOSBUS,” in Proc. Caltech Conf. VLSI, Jan. 1979, pp. 395-427.
27. R. J. Swan, S. H. Fuller, and D. P. Siewiorek, “Cm*–A modular multi-microprocessor,” in Proc. AFIPS 1977 Nat. Comput. Conf., pp. 637-644.
28. C. D. Thompson, “Area-time complexity for VLSI,” in Proc. 11th Annu. Ass. Comput. Mach. Symp. Theory Comput., Apr. 1979, pp. 81-88.
29. M. A. Franklin and D. F. Wann, “Asynchronous and clocked control structures for VLSI based interconnection networks,” in Proc. 9th Annu. Symp. Comput. Arch., Apr. 1982, pp. 50-59.
30. S. Y. Kung and R. J. Gal-Ezer, “Synchronous vs. asynchronous computation in VLSI array processors,” Proc. SPIE, vol. 341, May 1982.
31. P. Penfield, Jr. and J. Rubinstein, “Signal delay in RC tree networks,” in Proc. 18th Design Auto. Conf., June 1981, pp. 613-617.
32. L. Nagel, “SPIECE2: A computer program to simulate semiconductor circuits,” Elec. Res. Lab., Univ. of California, Berkeley, Tech. Rep. UCB ERL-M250, May 1975.