Kinerja Paralel Program Binary Sort dan Odd-Even Transposition Sort Pada Jaringan Trnasputer  

Oleh:

Kartawidjaja, Maria Angela

Jenis: Article from Journal - ilmiah nasional - tidak terakreditasi DIKTI - atma jaya
Dalam koleksi: Metris: Jurnal Mesin, Elektro, Industri dan Sains vol. 7 no. 2 (Jun. 2006), page 96-103.
Topik: binary; performance; sort; speedup; transputer
Fulltext: Kinerja Paralel Program Binary Sort dan Odd-Even Transposition Sort Pada Jaringan Trnasputer.pdf (6.39MB)

Ketersediaan

Perpustakaan Pusat (Semanggi) Nomor Panggil: MM42.3 Non-tandon: 1 (dapat dipinjam: 0) Tandon: tidak ada

Lihat Detail Induk

Isi artikel

Sorting data is a time consuming process performed by computers, especialy if it concerns with an enormous set of data. Therefore it is reasonable to consider parallel computation in sorting data. In this article the performance of two parallel sortig algorithm, binary sort and odd-even transposition sort, is analyzed on a transputer network. It is observed that binary sort provides a better performance than odd-even transposiiton sort in terms of speedup on transputer network with ring configuration.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali