Výsledky vyhľadávania - optimal speedup parallel string matching algorithm

Parallel Suffix–Prefix-Matching Algorithm and Applications Autor Kedem, Zvi M., Landau, Gad M., Palem, Krishna V.

“…Our main result in this paper is a parallel algorithm for suffix-prefix- ($s - p$-) matching that has optimal speedup on a concurrent-read/concurrent-write parallel random-access machine…”
Získať plný text

A Parallel BMH String Matching Algorithm Based on OpenMP Autor Qi, Xiao, Liu, Bin, Li, Yuancheng, Du, Yanning, Li, Yuxiang, Niu, Dangdang

“… This paper proposed a parallel BMH string matching algorithm based on OpenMP. The parallelism of the BMH algorithm is first identified by theoretical analysis…”
Získať plný text

Parallel processing of E-Atheer algorithm using pthread paradigm Autor AbdulRazzaq, Atheer Akram, Fadhel, Mohammed A., Alzubaidi, Laith, Al-Shamma, Omran

“… In this study, we implemented the parallel exact string matching algorithm termed as E-Atheer with multi-core processing…”
Získať plný text

PARALLEL PROCESSING OUTCOMES OF E-ABDULRAZZAQ ALGORITHM USING MULTI-CORE TECHNIQUE Autor Akram AbdulRazzaq, Atheer, Abdul Rashid, Nur’Aini

“… is the parallelization for exact string matching algorithms. In this study, the E-Abdulrazzaq string matching algorithm is chosen to be executed with the multi-core environment utilizing the OpenMP paradigm which can be utilized to decrease the execution time…”
Získať plný text

Towards optimal packed string matching Autor Ben-Kiki, Oren, Bille, Philip, Breslauer, Dany, Ga̧sieniec, Leszek, Grossi, Roberto, Weimann, Oren

“…–Perrin constant-space O(n)-time string-matching algorithm to run in optimal O(n/α) time and even in real-time, achieving a factor α…”
Získať plný text

Bit-parallel sequence-to-graph alignment Autor Rautiainen, Mikko, Mäkinen, Veli, Marschall, Tobias

“… Results We generalize two linear sequence-to-sequence algorithms to graphs: the Shift-And algorithm for exact matching and Myers…”
Získať plný text

The Approximate String Matching on the Hierarchical Memory Machine, with Performance Evaluation Autor Man, Duhu, Nakano, Koji, Ito, Yasuaki

“… The main contribution of this paper is to show an optimal parallel algorithm for the approximate string matching on the HMM and to implement it on a CUDA-enabled GPU…”
Získať plný text

Simple Optimal Parallel Multiple Pattern Matching Autor Muthukrishnan, S

“…In this paper, we present a simple algorithm for solving the multipattern matching problem, with optimal speedup…”
Získať plný text

Unified VLSI systolic array design for LZ data compression Autor HWANG, Shih-Arn, WU, Cheng-Wen

“… Also, multiple chips (linear arrays) can be connected in parallel to implement the parallel array structure and provide a proportional speedup…”
Získať plný text

Deterministic Sampling–A New Technique for Fast Pattern Matching Autor Vishkin, Uzi

“… Consider the string matching problem. Given the pattern, a sample of its positions is carefully selected whose size is at most…”
Získať plný text

Cost-optimal parallel algorithms for finitely inductive sequences Autor Das, S.K., Fisher, P.S., Zhang, H.

“…), parallel random access machine (PRAM) model. Each of the algorithms achieves cost-optimal speedup under certain conditions as detailed.< >…”
Získať plný text

Parallel Approximate Multi-Pattern Matching on Heterogeneous Cluster Systems Autor Cheng Zhong, Zeng Fan, Defu Su

“… Secondly, based on divisible load principle, a linear programming model for the optimal text distribution strategy is created and a parallel approximate multi-pattern matching algorithm allowing one…”
Získať plný text