Hardware method parallel prefix and suffix search on an array of fixed-ength substrings

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.

Hardware-Oriented Method for Reconfiguring a Group Of Mobile Objects

“…Таким образом, созданный метод динамической реконфигурации позволяет управлять группировкой с переменным составом, он также может применяться для обработки строковых данных при поиске целевых шаблонов, заданных через вектор параметров при множественных вариантах определения шаблона [22]. Метод использует дополнительную информацию о потенциальной связности вершин в сети, что позволяет упреждающе исключать аппараты до их фактического выхода из строя и обеспечивает перестройку маршрутов и связность сети, в целом.…”