Search Results - parallel application ((clustering algorithm) OR (matching algorithm))
Search alternatives:
- parallel application »
-
1
-
2
Parallel genetic algorithms for shortest path routing in high- performance computing / Mohd Erman Safawie Che Ibrahim
Published 2012“…This project focuses on step-up cluster computing and a parallel Genetic Algorithm. …”
Get full text
Get full text
Thesis -
3
-
4
Parallelization of noise reduction algorithm for seismic data on a beowulf cluster
Published 2010Get full text
Get full text
Citation Index Journal -
5
-
6
-
7
Solving traveling salesman problem on cluster compute nodes
Published 2009Get full text
Get full text
Article -
8
-
9
GPU-based odd and even hybrid string matching algorithm
Published 2016“…String matching is considered as one of the fundamental problems in computer science.Many computer applications provide the string matching utility for their users, and how fast one or more occurrences of a given pattern can be found in a text plays a prominent role in their user satisfaction.Although numerous algorithms and methods are available to solve the string matching problem, the remarkable increase in the amount of data which is produced and stored by modern computational devices demands researchers to find much more efficient ways for dealing with this issue.In this research, the Odd and Even (OE) hybrid string matching algorithm is redesigned to be executed on the Graphics Processing Unit (GPU), which can be utilized to reduce the burden of compute-intensive operations from the Central Processing Unit (CPU).In fact, capabilities of the GPU as a massively parallel processor are employed to enhance the performance of the existing hybrid string matching algorithms.Different types of data are used to evaluate the impact of parallelization and implementation of both algorithms on the GPU. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
10
Parallel matrix-multiplication algorithm on network of workstations
Published 2004“…We present the comparison in terms of speed between serial algorithm and the parallel algorithm when we run them on our cluster. …”
Get full text
Get full text
Get full text
Article -
11
Parallelizing Algorithm For Object Recognition Based On Edge Detection On Sunfire Cluster.
Published 2007Get full text
Get full text
Conference or Workshop Item -
12
Parallel algorithms for edge detection on cluster computer
Published 2011Get full text
Get full text
Get full text
Book Chapter -
13
-
14
-
15
On An Improved Parallel Construction Of Suffix Arrays For Low Bandwidth Pc-Cluster.
Published 2003Get full text
Get full text
Conference or Workshop Item -
16
Speeding up index construction with GPU for DNA data sequences
Published 2011“…The advancement of technology in scientific community has produced terabytes of biological data.This datum includes DNA sequences.String matching algorithm which is traditionally used to match DNA sequences now takes much longer time to execute because of the large size of DNA data and also the small number of alphabets.To overcome this problem, the indexing methods such as suffix arrays or suffix trees have been introduced.In this study we used suffix arrays as indexing algorithm because it is more applicable, not complex and used less space compared to suffix trees.The parallel method is then introduced to speed up the index construction process. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
17
-
18
Parallel Processing of RSAAlgorithm Using MPI Library
Published 2006Get full text
Get full text
Final Year Project -
19
-
20
Mathematical simulation for 3-dimensional temperature visualization on open source-based grid computing platform
Published 2009“…New Iterative Alternating Group Explicit (NAGE) is a powerful parallel numerical algorithm for multidimensional temperature prediction. …”
Get full text
Get full text
Get full text
Conference or Workshop Item
