Retrieval of information from lattice-structured content-address

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

395425, 395800, 3649746, 3649631, 3642304, 3642531, 364DIG1, 364DIG2, G06F 1730

Patent

active

054287731

ABSTRACT:
An information processing unit having a memory (16) storing a set of data elements in a data lattice structure. The memory is content-addressably searched by a pair of processors (12) and (14) controlling confronting traversals of the data lattice structure. A traversal controller (24) generates a search routine for the two processors (12) and (14) resulting in a natural two-way concurrency in their operation. A second memory (22) stores processing instructions and pointers used by the traversal controller (24) to generate the search routine. The processing instructions and pointers are extracted from the second memory under the control of processors (18) and (20). An interface processor (26) is connected to a communication link (28) connecting the information processing unit to utilization devices.

REFERENCES:
patent: 3938105 (1976-02-01), Lechner
patent: 4996666 (1991-02-01), Duluk
Huang et al., "An Evaluation of Concurrent Priority Queue Algorithms", Parallel and Distributed Processing, Jan., 1991, pp. 518-525.
Nelson et al., "Unidirectional and Bidirectional Search Algorithms", IEEE Software, vol. 9, No. 2, Mar., 1992, pp. 77-83.
Chung et al., "On the Complexity of Search Algorithms", IEEE Transactions on Computers, vol. 41, No. 9, Sep., 1992, pp. 1172-1176.
Simon Y. Berkovich "Organization of Associative Memory Operations with Lattice Structures", Proceedings of the 35th Midwest Symposium on Circuits and Systems, 9-12 Aug. 1992, pp. 887-890.
C. L. Liu, Elements of Discrete Mathematics, McGraw-Hill Book Company, (New, York, 1985), pp. 103-125, 385-407.
IBM Personal Computer Professional FORTRAN Version 1.30 Reference Manual, Ryan-McFarland Corporation, 1987, pp. 1-26 to 1-27.
Bart Kosko, "Bidirectional Associative Memories", IEEE Transactions on Systems, Man, and Cybernetics, vol. 18, No. 1, Jan.-Feb., 1988, pp. 49-60.
Dieter Muller, "Symmetric Connection Problems and Their Solution by Bidirectional Search", International Journal of computer Mathematics, vol. 37, No. 3-4, 1990, pp. 137-152.
Donald R. Mack, "The Magical Fibonacci Number", IEEE Potentials, vol. 9, No. 3, Oct., 1990, pp. 34-35.
The Art of Computer Programming, vol. 3-"Sorting and Searching", 1973, Addison-Wesley Publishing Company, Inc. pp. 48-58.
"Efficient Parallel Algorithms for Selection & Searching on Sorted Matrices" Sarnath et al. Proceedings-Sixth International Parallel Processing Symposium, Mar. 23-26, 1992 Beverly Hills, Calif., IEEE Computer Society pp. 108-111.
"An Emperical Comparison of Priority-Queue and Event-Set Implementations", Douglas W. Jones, Communications of the ACM, Apr. 1986, vol. 29, No. 4 pp. 300-311.
"Analysis of Algorithms and Data Structures", Banachowski, et al, Institute of Informatics, Addison-Wesley (Reading, Mass.) 1991 pp. 121-134, 293.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Retrieval of information from lattice-structured content-address does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Retrieval of information from lattice-structured content-address, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Retrieval of information from lattice-structured content-address will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-295134

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.