No abstract

In article approach to search in a sample for production systems is described. Search in a sample is applied to processing of symbolical information. For this purpose operands are presented in the form of a matrix in which processing of vectors is conducted by a conveyor way. Elements of two vectors are logically multiplied among themselves with shift by the beginning of bit of the previous vector of rather current vector. Such operation has received the name "shift" conjunction. She allows to find a sample as a part of the search text.

No abstract

The work consists in the development of hardware-oriented methods for restoring the structure of the target word. The reconstruction storation is performed by constructing its prefix and suffix from a set of private words, understood as patterns. The reconstruction of the unknown word is performed by formation its prefix and suffix from a set of private words, understood as standards. The goal is to reduce the recovery time of the structure of the target word by parallel processing of pairs of words stored in the matrix of the original partial words. Solution method. The method consists of 4 stages. They include the stage of parallel processing of fragments of pairs of words for their intersection and selection of mismatched characters. These characters are candidates for the current prefix and suffix characters. A distinctive feature of the proposed method is the hardware support of the main operations in the form of a homogeneous computational PIM structure and the use of a string data structure rather than tuples. For a tuple, the minimum work item is a single character, so the processing of an m-tuple is sequential element-by-element. For a word, the minimum work item is a string of characters that can be processed in parallel without losing the generality of properties. The meaning of the PIM structure is the integration of register memory blocks and functional units for comparing character strings, which allows parallel processing of an array of elements without wasting time on intermediate transfers. Results and discussions. Algorithms are modeled based on the known method and the developed method, using variable parameters: the number of private words, the length of the private word, the cardinality of the alphabet. Modeling showed that the developed method has a time advantage from 1,25 to 9,97. Conclusion. The developed hardware-oriented method for restoring the target word based on the analysis of a set of private words that have a structural relationship with each other has shown its temporal efficiency with increasing values of the varied parameters. This property testifies to the prospects of using the method in search-analytical problems of a real level of complexity.

Article contains the description of parallel search in associative memory. Initial operands (words) гeceive a dual impression. The source text is presented in the form of a line or in the form of a matrix. The sample is presented by a two-dimensional form. It consists in splitting a sample into even and odd character sets. Addition of the second coordinate for a sample allows to execute the alternating development of symbols and provides the anticipatory analysis of symbols of a sample of rather next symbols.This feature of the form of a sample allows to process each character set parallely. Processing of character sets is carried out on bit cutoffs in the associative memory at the same time. For the hardware support of steps of retrieval operation the original structure of the associative memory is offered. The structure contains new communications between storage cells, two retrieval registers for storage of character sets and original a circuitry element for foliation of characters on sets.