Page 316

Contents | 316 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 316
Setname	ir_computersa
ID	99964
OCR Text	Show 298 [130] M. F. Morris and P. F. Roth. Computer Performance Evaluation- Tools and Techniques For Effective Analysis. Van Nostrand Reinhold Company, New York, 1982. [131] MOSIS. DRA2 Chip Fabrication Report. Technical Report, Information Science Institute, Univ. of Southern California, Dec. 1986. (132] M. Nagao and T. Matsuyama, editors. A Structural Analysis of Complex Aerial Photographs. Plenum Press, New York, 1980. [133] V. P. Nelson and B. D. Carroll, editors. Fault-Tolerant Computing. IEEE Computer Society Press, Washington D. C., 1986. [134] A. Newell and H. A. Simon. Human Problem Solving. Prentice-Hall, Englewood Cliffs, New Jersey, 1972. [135] A. Newell and H. A. Simon. Human Problem Solving. Prentice-Hall, Englewood Cliffs, New Jersey, 1972. [136] D. Nicol. Expected Performance of m-Solution Backtracking. Technical Report Report No. 8655, NASA ICASE Report, Aug. 1986. [137] A. Nijenhuis and H. S. Wilf. Combinatorial Algorithms. Academic Press, New York, 1975. [138] N. J. Nilsson. Principles of Artificial Intelligence. Tioga Publishing Company, Palo Alto, California, 1980. [139] B. Nudel. Consistent-Labeling Problems and their Algorithms: .ExpectedComplexities and Theory-Based Heuristics. Artificial Intelligence, 21:135- 178, 1983. [140] K. Oflazer. Partitioning in Parallel Processing of Production Systems. In IEEE International Conference on Parallel Processing, pages 92-100, University Park, Pennsylvania, Aug. 1984 . . [141] D. A. Patterson. Reduced Instruction Set Computers. Comm. of the ACM, 28(1 ):8-21, Jan. 1985. [142] D. A. Patterson and C. H. Sequin. A VLSI RISC. IEEE Computer, 15(9):8- 21, Sept. 1982. [143] J. Pearl. Heuristics - Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading, 1984. [144] T. S. Perry and G. Zorpette. Supercomputer Experts Predict Expensive Growth. IEEE Spectrum, 26(2):26-33, Feb. 1989. [145] G. Polya. How to Solve It. Doubleday Anchor, New York, 1945. (146] J. L. Potter, editor. The Massively Parallel Processor. Volume 1 of Scientific Computation, MIT Press, Cambridge, 1985. · (147] D. K. Pradhan, editor. Fault-Tolerant Computing: Theory and Practice. Prentice-Hall, Englewood Cliffs, 1986.
Reference URL	https://collections.lib.utah.edu/ark:/87278/s69s3s9x/99964