Page 311

Contents | 311 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 311
Setname	ir_computersa
ID	99959
OCR Text	Show 293 [48] R. M. Fujimoto. SIMON: A Simulator of Multicomputer Networks. Technical Report ERL Report, Dept. of EECS, UC Berkeley, 1983. [49] R. M. Fujimoto. The Simon Simulation and Development System. In Proceedings of 1985 Summer Computer Simulation Conference, pages 123- 128, July 1985. [50] D. D. Gajski, V. M. Milutinovic, H. J. Siegel, and B. P. Furht, editors. Computer ·Architecture. IEEE Computer Society Press, Washington D. C., 1986. [51] M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, San Francisco, 1979: [52] J. Gaschnig. Performance Measurements and Analysis of Certain Search Algorithms. PhD thesis, Carnegie-Mellon University, Dept. of Computer Science, May 1979. [53] M. Gaspar. Discussion of the PPL Design Methodology and MOSIS Fabrication Technology. Dec. 1986. Private Communication. [54] S. Geman and D. Geman. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images. IEEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-6(5):721-734, Nov. 1984. [55] A. Ginzberg. Algebraic Theory of Automata. Academic Press, New York, 1968. [56] A. Goldberg, P. W. Purdom, and C. A. Brown. Average Time Analysis of Simplified Davis-Putnam Procedures. Information Processing Letters, 15(2):72- 75, 6 Sept. 1982. [57] S. W. Golomb and L. D. Baumert. Backtrack Programming. J. ACM, 12( 4):516-524, Oct. 1965. [58] W. J. Greene and A. E. Gamal. Configuration of VLSI Arrays in the Presence of Defects. J. ACM, 31(4):694-717, Oct. 1984. [59] R. W. Grossman. Some Data Base Applications of Constraint Expressions. Technical Report LCS-158, MIT, 1976. [60] J . Gu. Intelligent and Stuctured Techniques for MOS and GaAs VLSI Circuit Design. 1987 to Present. E.E. Ph.D Research in Progress. Dept. of Electrical Engineering, Univ. of Utah. [61] J. Gu. Parallel Consistent Labeling Computer Architectures. Mar. 1988. C.S. Ph.D Thesis Proposal. Dept. of Computer Science, Univ. of Utah. [62] J. Gu, W. Wang, and T. C. Henderson. A Parallel Architecture for Discrete Relaxation Algorithm. IEEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-9(6):816-831, Nov. 1987. [63] J. Gu and K. F. Smith. Design and Implementation of 1.0 11 GaAs PPL System for Ultra Fast VLSI Architectures. Technical Report, Dept. of Computer Science, Univ. of Utah, July 1987.
Reference URL	https://collections.lib.utah.edu/ark:/87278/s69s3s9x/99959