Melola Discovery

← Melola Discovery

Journal SINTA 2

ALGORITMA PARALEL ODD EVEN TRANSPOSITION PADA MODEL JARINGAN NON-LINIER

Jurnal Ilmu Komputer dan Informasi (JIKI) · Vol. 3 No. 2 (2012) · pp. 73–81

DOI
10.21609/jiki.v3i2.144
ISSN
2502-9274, 2088-7051
Published
2012-05-29
Publisher
Faculty of Computer Science - Universitas Indonesia
Language
eng

Abstract

Odd-even-transposition adalah suatu algoritma paralel yang merupakan pengembangan dari algoritma sekuensial “bubble sort”. Algoritma odd-even-transposition ini didesain khusus untuk model jaringan array linier (homogen). Untuk n elemen data, kompleksitas waktu dari algoritma bubble sort adalah O(n2), sedangkan pada odd-even-transposition yang bekerja di atas n prosesor adalah (n). Ada peningkatan kecepatan waktu pada kinerja algoritma paralel ini sebesar n kali dibanding algoritma sekuensialnya. Hypercube dimensi k adalah model jaringan non-linier (non-homogen) terdiri dari n = 2k prosesor, di mana setiap prosesor berderajat k. Model jaringan Fibonacci cube dan extended Lucas cube masing-masing merupakan model subjaringan hypercube dengan jumlah prosesor < 2k prosesor dan maksimum derajat prosesornya adalah k. Pada paper ini, diperlihatkan bagaimana algoritma odd-even-transposition dapat dijalankan juga pada model jaringan komputer cluster non-linier hypercube, Fibonacci cube, dan extended Lucas cube dengan kompleksitas waktu O(n). Odd-even-transposition is a parallel algorithm which is the development of sequential algorithm “bubble sort”. Odd-even transposition algorithm is specially designed for linear array network model (homogeneous). For n data elements, the time complexity of bubble sort algorithm is O(n2), while the odd-even-transposition that works with n processor is (n). There in an increase in the speed of time on the performance of this parallel algorithms for n times than its sequential algorithm. K-dimensional hypercube is a non-linear network model (non-homogeneous) consists of n = 2k processors, where each processor has k degree. Network model of Fibonacci cube and extended Lucas cube are the hypercube sub-network model with the number of processors

Keywords

Collaboration network of the authors

25 authors · 61 co-authorship links

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Gunadarma University
  • Universitas Raharja
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Siti MaesarohAffiliation unknown1
Siti Nurindah SariAffiliation unknown1
Muhammad Rehan AnwarAffiliation unknown1
Sugeng WidadaAffiliation unknown1
Ninda LutfianiUniversitas Raharja1
Dwi JulianingsihAffiliation unknown1
FernandoAffiliation unknown1
B. P. Kusumo BintoroAffiliation unknown1
Luthfia Hastiani MuharramAffiliation unknown1
Wulan PertiwiAffiliation unknown1
Nelis HernahadiniAffiliation unknown1
Ima MukaromahAffiliation unknown1
Achmad ChafidzAffiliation unknown1
Suharno RusdiAffiliation unknown1
Imam NurrahmanAffiliation unknown1
Agam Duma Kalista WibowoAffiliation unknown1
Adi KusmayadiAffiliation unknown1
Danang Tri HartantoAffiliation unknown1
Suryo WiyonoAffiliation unknown1
Tri Asmira DamayantiAffiliation unknown1
Abu BakarAffiliation unknown1
Siti Mauliana HairiniAffiliation unknown1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://jiki.cs.ui.ac.id/index.php/jiki/oai, first harvested 26 Oct 2026, last seen 8 Nov 2026.
Original metadata (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-US">ALGORITMA  PARALEL ODD EVEN TRANSPOSITION PADA  MODEL JARINGAN NON-LINIER</dc:title>
	<dc:creator>., Ernastuti</dc:creator>
	<dc:creator>Salim, Ravi A.</dc:creator>
	<dc:creator>., Haryanto</dc:creator>
	<dc:subject xml:lang="en-US">bubble sort</dc:subject>
	<dc:subject xml:lang="en-US">extended lucas cube</dc:subject>
	<dc:subject xml:lang="en-US">fibonacci cube</dc:subject>
	<dc:subject xml:lang="en-US">jaringan cluster non-linier hypercube</dc:subject>
	<dc:subject xml:lang="en-US">odd even transposition</dc:subject>
	<dc:description xml:lang="en-US">Odd-even-transposition adalah suatu algoritma paralel yang merupakan pengembangan dari algoritma sekuensial “bubble sort”. Algoritma odd-even-transposition ini didesain khusus untuk model jaringan array linier (homogen).  Untuk n elemen data, kompleksitas waktu dari algoritma bubble sort adalah O(n2), sedangkan  pada odd-even-transposition yang bekerja di atas n prosesor adalah (n). Ada peningkatan kecepatan waktu pada kinerja algoritma paralel ini sebesar n kali dibanding algoritma sekuensialnya. Hypercube dimensi k adalah model jaringan non-linier (non-homogen) terdiri dari  n = 2k prosesor, di mana setiap prosesor berderajat k. Model jaringan Fibonacci cube dan extended Lucas cube masing-masing merupakan model subjaringan hypercube dengan jumlah prosesor &lt; 2k prosesor dan maksimum derajat prosesornya adalah k. Pada paper ini, diperlihatkan bagaimana algoritma odd-even-transposition dapat dijalankan juga pada model jaringan komputer cluster non-linier hypercube, Fibonacci cube,  dan extended Lucas cube dengan kompleksitas waktu O(n).


Odd-even-transposition is a parallel algorithm which is the development of sequential algorithm “bubble sort”. Odd-even transposition algorithm is specially designed for linear array network model (homogeneous). For n data elements, the time complexity of bubble sort algorithm is O(n2), while the odd-even-transposition that works with n processor is (n). There in an increase in the speed of time on the performance of this parallel algorithms for n times than its sequential algorithm. K-dimensional hypercube is a non-linear network model (non-homogeneous) consists of n = 2k processors, where each processor has k degree . Network model of Fibonacci cube and extended Lucas cube are the  hypercube sub-network model with the number of processors </dc:description>
	<dc:publisher xml:lang="en-US">Faculty of Computer Science  - Universitas Indonesia</dc:publisher>
	<dc:date>2012-05-29</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://jiki.cs.ui.ac.id/index.php/jiki/article/view/144</dc:identifier>
	<dc:identifier>10.21609/jiki.v3i2.144</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Ilmu Komputer dan Informasi; Vol. 3 No. 2 (2010): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information); 73-81</dc:source>
	<dc:source>2502-9274</dc:source>
	<dc:source>2088-7051</dc:source>
	<dc:source>10.21609/jiki.v3i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://jiki.cs.ui.ac.id/index.php/jiki/article/view/144/262</dc:relation>
</oai_dc:dc>