Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	IEEE Std i149.1-1990. IEEE standard test access port and boundary-scan architecture~ 1990.
	2	Guy E. Blelloch, Vector models for data-parallel computing, MIT Press, Cambridge, MA, 1990
	3	W. J. Dally. Wire-efficient VLSI multiprocessor communication networks, in Paul Losleben, editor, Proceedings of the 1987 Stanford Conference on Advanced Research in VLSI, pages 391-415, Cambridge, MAt 1987. The MIT Press.
	4	W. J. Dally , C. L. Seitz, Deadlock-free message routing in multiprocessor interconnection networks, IEEE Transactions on Computers, v.36 n.5, p.547-553, May 1987  [doi>10.1109/TC.1987.1676939]
	5	F. Darema-Rogers, D. A. George, V. A. Norton, and G. F. Pfister. A single-program-multiple-data computational model for EPEX/FORTRAN. Research Report RC 11552, Computer Sciences Department, IBM T. J. Watson Research Center, Yorktown Heights, NY, November 1986.
	6	Shreekant Thakkar , Michael Dubois , Anthony T. Laundrie , Gurindar Sohi, Scalable Shared-Memory Multiprocessor Architectures, Computer, v.23 n.6, p.71-83, June 1990  [doi>10.1109/2.55502 ]
	7	A. Gottlieb, R. Grishman, C. P. Kruskal, K. P. McAuliffe, L. Rudolph, and M. Snir. The NYU ultracomputer -- designing a MIMD~ shared-memory parallel machine. IEEE Transactions on Computers, C- 32(2):175-159, February 1983.
	8	R. I. Greenberg and C. E. Leiserson. Randomized routing on fat-trees. Advances in Computing Research, 5:345-374, 1989.
	9	Rajiv Gupta, The fuzzy barrier: a mechanism for high speed synchronization of processors, Proceedings of the third international conference on Architectural support for programming languages and operating systems, p.54-63, April 03-06, 1989, Boston, Massachusetts, United States
	10	David A. Patterson , John L. Hennessy, Computer architecture: a quantitative approach, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1990
	11	W. Daniel Hillis , Guy L. Steele, Jr., Data parallel algorithms, Communications of the ACM, v.29 n.12, p.1170-1183, Dec. 1986  [doi>10.1145/7902.7903]
	12	H. F. Jordan. A multi-microprocessor system for finite element structural analysis. In A. K. Noor and Jr. McComb, H. G., editors, Trends in Computerized Structural Analysis and Synthesis, pages 21-29. Pergamon Press Ltd, 1978. Published as a special issue of Computers ~J Structures, Volume 10, Numbers 1-2.
	13	P. Kermani and L. Kleinrock. Virtual cut-through: A new computer communication switching technique. Computer Networks~ 3:267-286, 1979.
	14	F. T. Leighton, B. Maggs~ and S. Rao. Universal packet routing algorithms. In 29th Annual IEEE Symposium on Foundations of Computer Science, pages 256-271, 1988.
	15	Charles E. Leiserson, Fat-trees: universal networks for hardware-efficient supercomputing, IEEE Transactions on Computers, v.34 n.10, p.892-901, Oct. 1985
	16	C. E. Leiserson and B. M. Maggs. Communicationefficient parallel algorithms for distributed randomaccess machines. Algorithmica, 3:53-77, 1988.
	17	Margaret A. St. Pierre , Shaw-Wen Yang , Dan Cassiday, Functional VLSI Design Verification Methodology for the CM-5 Massively Parallel Supercomputer, Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors, p.430-435, October 11-14, 1992
	18	Charles L. Seitz, The cosmic cube, Communications of the ACM, v.28 n.1, p.22-33, Jan. 1985  [doi>10.1145/2465.2467]
	19	C. L. Seitz, W. C. Athas, W. J. Dally~ R. Faucette, A. J. Martin, S. Mattisson, C. S. Steele, and W.-K. Su. Message-Passing Concurrent Computers: Their Architecture and Programming. Addison-Wesley, Reading, MA, 1986.
	20	P. Tang and P.-C. Yew. Processor self-scheduling for multiple-nested parallel loops. In K. Hwang, S. M. Jacobs, and E. E. Swartzlander, editors, Proceedings of the 1986 International Conference on Parallel Processing, pages 528-535, August 1986.
	21	Texas Instruments. SN54A CT8997, SN74A CT8997 Scan Path Linker With 4-bit identification Bus, April 1990. Product Preview.
	22	Thinking Machines Corporation, applicant. W. Daniel Hillis, inventor. European Patent Application Serial Number 89 902 461.6~ priority date of February 2, 1988, entitled Method and Apparatus For Aligning The Operation Of A Plurality 0/Processors. Also International Application Number WO 89/07299 (Published under the Patent Cooperation Treaty), Publication Date 10 August 1989.
	23	Thinking Machines Corporation, 245 First Street, Cambridge, MA 02154-1264. The Connection Machine CM- 5 Technical Summary, October 1991.
	24	Robert C. Zak, Jr. , Jeffrey V. Hill, An IEEE 1149.1 Compliant Testability Architecture with Internal Scan, Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors, p.436-442, October 11-14, 1992

• Data structures for quadtree approximation and compression Communications of the ACM   28, 9
  Hanan Samet
  
  
• A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
  Kim S. Lee ,  Huizhu Lu ,  D. D. Fisher
  
  
• The GemStone object database management system Communications of the ACM   34, 10
  Paul Butterworth ,  Allen Otis ,  Jacob Stein
  
  
• An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE conference on Design automation
  Gwo-Dong Chen ,  Daniel D. Gajski
  
  
• Putting innovation to work: adoption strategies for multimedia communication systems Communications of the ACM   34, 12
  Ellen Francik ,  Susan Ehrlich Rudman ,  Donna Cooper ,  Stephen Levine