GDL

A Framework for Distributed Pattern Matching Based on Multithreading

2012
Journal from gdlhub / 2017-08-14 11:52:31
Oleh : Najib Kofahi, Ahmed Abusalama , IAJIT
Dibuat : 2012-06-22, dengan 1 file

Keyword : Pattern matching, online search algorithms, multithreading, concurrency, java space technology, distributed processing.
Subjek : A Framework for Distributed Pattern Matching Based on Multithreading
Url : http://www.ccis2k.org/iajit/PDF/vol.9,no.1/1199.pdf
Sumber pengambilan dokumen : Internet

Despite of the dramatic evolution in high performance computing we still need to devise new efficient algorithms to


speed up the search process. In this paper, we present a framework for a data%distributed and multithreaded string matching


approach in a homogeneous distributed environment. The main idea of this approach is to have multiple agents that


concurrently search the text, each one from different position. By searching the text from different positions the required


pattern can be found more quickly than by searching the text from one position). Concurrent search can be achieved by two


techniques; the first is by using multithreading on a single processor, in this technique each thread is responsible for searching


one part of the text. The concurrency of the multithreading technique is based on the time sharing principle, so it provides us


of an illusion of concurrency not pure concurrency. The second technique is by having multiprocessor machine or distributed


processors to search the text; in this technique all of the processors search the text in a pure concurrent way. Our approach


combines the two concurrent search techniques to form a hybrid one that takes advantage from the two techniques. The


proposed approach manipulates both exact string matching and approximate string matching with k%mismatches.


Experimental results demonstrate that this approach is an efficient solution to the problem in a homogeneous clustered system.

Deskripsi Alternatif :

Despite of the dramatic evolution in high performance computing we still need to devise new efficient algorithms to


speed up the search process. In this paper, we present a framework for a data%distributed and multithreaded string matching


approach in a homogeneous distributed environment. The main idea of this approach is to have multiple agents that


concurrently search the text, each one from different position. By searching the text from different positions the required


pattern can be found more quickly than by searching the text from one position). Concurrent search can be achieved by two


techniques; the first is by using multithreading on a single processor, in this technique each thread is responsible for searching


one part of the text. The concurrency of the multithreading technique is based on the time sharing principle, so it provides us


of an illusion of concurrency not pure concurrency. The second technique is by having multiprocessor machine or distributed


processors to search the text; in this technique all of the processors search the text in a pure concurrent way. Our approach


combines the two concurrent search techniques to form a hybrid one that takes advantage from the two techniques. The


proposed approach manipulates both exact string matching and approximate string matching with k%mismatches.


Experimental results demonstrate that this approach is an efficient solution to the problem in a homogeneous clustered system.

Beri Komentar ?#(0) | Bookmark

Properti	Nilai Properti
ID Publisher	gdlhub
Organisasi	IAJIT
Nama Kontak	Herti Yani, S.Kom
Alamat	Jln. Jenderal Sudirman
Kota	Jambi
Daerah	Jambi
Negara	Indonesia
Telepon	0741-35095
Fax	0741-35093
E-mail Administrator	elibrarystikom@gmail.com
E-mail CKO	elibrarystikom@gmail.com