Page 319

Contents | 319 of 320

Download PDF | | Reference URL | Gallery View | Parent Record

Publication Type	technical report
School or College	College of Engineering
Department	Computing, School of
Creator	Gu, Jun
Title	Parallel Algorithms and Architectures for Very Fast AI Search
Date	1989-08
Description	A wide range of problems in natural and artificial intelligence, computer vision, computer graphics, database engineering, operations research, symbolic logic, robot manipulation and hardware design automation are special cases of Consistent Labeling Problems (CLP). CLP has long been viewed as an efficient computational model based on a unit constraint relation containing 2N-tuples of units and labels which specifies which N-tuples of labels are compatible with which N-tuples of units. Due to high computation cost and design complexity, most currently best-known algorithms and computer architectures have usually proven infeasible for solving the consistent labeling problems. Efficiency in CLP computation during the last decade has only been improved a few times. This research presents several parallel algorithms and computer architectures for solving CLP within a parallel processing framework. For problems of practical interest, 4 to 10 orders of magnitude of efficiency improvement can be easily reached. Several simple wafer scale computer architectures are given which implement these parallel algorithms at a surprisingly low cost.
Type	Text
Subject	parallel algorithms; CLP; consistent labeling problems; computer programming; computer science
Language	eng
Bibliographic Citation	Gu, J. (1989). Parallel algorithms and architectures for very fast AI search.
Series	University of Utah Computer Science Technical Report
Relation is Part of	ARPANET
Format Medium	application/pdf
Format Extent	116,876,932 bytes
File Name	Gu-Parallel_Algorithms.pdf
Conversion Specifications	Original scanned with Kirtas 2400 and saved as 400 ppi uncompressed TIFF. PDF generated by Adobe Acrobat Pro X for CONTENTdm display
ARK	ark:/87278/s69s3s9x
Setname	ir_computersa
ID	99969
Reference URL	https://collections.lib.utah.edu/ark:/87278/s69s3s9x

Page Metadata

Title	Page 319
Setname	ir_computersa
ID	99967
OCR Text	Show 301 [184] I. E. Sutherland and C. A. Mead. Microelectronics and Computer Science. Scientific American, 237(3):210-228, Sept. 1977. [185] C. D. Thompson. A Complexity Theory for VLSI. PhD thesis, CarnegieMellon University, Dept. of Computer Science, Aug. 1980. [186] C. D. Thompson. Fourier Transforms in VLSI. IEEE Trans. on Computers, C-32(11):1047-1057, Nov. 1983. . . [187] C. · D. Thompson. The VLSI Complexity of .Sorting. IEEE Trans. on Computers, C-32(12):1171-1184, Dec. 1983. [188] TriQuint Gallium Arsenide Multi-Project Chip Design Course. TriQuint Semiconductor, Inc., Mar. 1987. [189] L. W. Tucker and G. G. Robertson. Architecture and Applications of the Connection Machine. IEEE Computer, 21(8):26-38, Aug. 1988. [190] K. J. Turner. Computer Perception of Curved Objects Using a Television Camera. PhD thesis, Univ. Edinburgh, 1974. [191] J. E. Tyler. Parallel Computer Architectures and Problem Solving Strategies for The Consistent Labeling Problem. Master's thesis, Dept. of Elec. Engg., Virginia Polytech. Inst. State Univ., Blacksburg, Virginia, Oct. 1983. [192] L. Uhr. Multi-Computer Architectures for Artificial Intelligence. John Wiley & Sons, New York, 1987. [193] J. D. Ullman. Computational Aspects of VLSI. Computer Science Press, Rockville, 1984. [194] J. R. Ullman. An Algorithm for Subgraph Isomorphism. J. ACM, 23(1):31- 42, Jan. 1976. [195] J. R. Ullman. A Binary N-Gram Technique for Automatic Correction of Substitution, Deletion, Insertion and Reversal Errors ·in Words. The Computer Journal, 20(2):141-147, Feb. 1977. [196] J. Vuillemin. A Combinatorial Limit to the Computing Power of VLSI Circuits. IEEE Trans. on Computers, C-32(3):294-300, Mar. 1983. [197] B. Wah and G. J. Li. Computers for Artificial Intelligence Applications. IEEE Computer Society Press, Washington D. C., 1986. [198] B. W. Wah. Technology-Driven Architectures and Application-Driven Architectures. National Science Foundation, MIPS Division Program Description, 1988. [199] B. W. Wah, M. B. Lowrie, and G.-J. Li. Computers for Symbolic Processing. IEEE Proceedings, 77( 4):509-540, Apr. 1989. [200] P. Wallich. Toward Simpler, Faster Computers. IEEE Spectrum, 22(9):38-45, Aug. 1985. [201] D. Waltz. Generating Semantic Descriptions from Drawings of Scenes with Shadows. Technical Report AI271, MIT, Nov. 1972.
Reference URL	https://collections.lib.utah.edu/ark:/87278/s69s3s9x/99967