Melola Discovery

← Melola Discovery

Jurnal SINTA 2

KINERJA ALGORITMA PARALEL UNTUK PENCARIAN KATA DENGAN METODE BOYER-MOORE MENGGUNAKAN PVM

JUTI: Jurnal Ilmiah Teknologi Informasi · Vol. 7 No. 3 (2009) · hlm. 121–126

DOI
10.12962/j24068535.v7i3.a78
ISSN
2406-8535, 1412-6389
Terbit
2009-01-01
Penerbit
Institut Teknologi Sepuluh Nopember
Bahasa
eng

Abstrak

Search process is one of important activity in data processing. Searching can take more time if conducted in the huge search space. Therefore, it is needed an efficient search technique. One technique that can be used is parallel computing. This article discusses the search process in parallel using the Boyer-Moore algorithm. Parallel scope is emulated with PVM (Parallel Virtual Machine) software. From the research results, it can be concluded that the performance of parallel computing will increase the word searching compared to the computing performance for its word sequencial search consisting of one letter, and will drop to the word search consisting of two letters or more.

Jaringan kolaborasi para penulis

2 penulis · 1 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://juti.if.its.ac.id/index.php/juti/oai, pertama di-harvest 26 Okt 2026, terakhir terlihat 15 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en">KINERJA ALGORITMA PARALEL UNTUK PENCARIAN KATA DENGAN METODE BOYER-MOORE MENGGUNAKAN PVM</dc:title>
	<dc:creator xml:lang="en">Kartawidjaja, Maria Angela</dc:creator>
	<dc:creator xml:lang="en">Vandika, Stania</dc:creator>
	<dc:description xml:lang="en">Search process is one of important activity in data processing. Searching can take more time if conducted in the huge search space. Therefore, it is needed an efficient search technique. One technique that can be used is parallel computing. This article discusses the search process in parallel using the Boyer-Moore algorithm. Parallel scope is emulated with PVM (Parallel Virtual Machine) software. From the research results, it can be concluded that the performance of parallel computing will increase the word searching compared to the computing performance for its word sequencial search consisting of one letter, and will drop to the word search consisting of two letters or more.</dc:description>
	<dc:publisher xml:lang="en">Institut Teknologi Sepuluh Nopember</dc:publisher>
	<dc:date>2009-01-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en">Peer-reviewed Article</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://juti.if.its.ac.id/index.php/juti/article/view/78</dc:identifier>
	<dc:identifier>10.12962/j24068535.v7i3.a78</dc:identifier>
	<dc:source xml:lang="en">JUTI: Jurnal Ilmiah Teknologi Informasi; Vol 7, No 3, Januari 2009; 121-126</dc:source>
	<dc:source>2406-8535</dc:source>
	<dc:source>1412-6389</dc:source>
	<dc:source>10.12962/j24068535.v7i3</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://juti.if.its.ac.id/index.php/juti/article/view/78/74</dc:relation>
</oai_dc:dc>