Simulasi Algortima Penjadualan Lengan Disk  

Oleh:

Suwarno, Djoko Untoro

Jenis: Article from Journal - ilmiah nasional - tidak terakreditasi DIKTI
Dalam koleksi: SIGMA: Jurnal Sains dan teknologi vol. 3 no. 1 (Jan. 2000), page 55-68.
Topik: elevator algorithm; SSF algorithm; FCFS algorithm; scheduling algorithm

Ketersediaan

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

Lihat Detail Induk

Isi artikel

A comparative study between three disc arm scheduling algorithms, i.e. First Come First Served (FCFS) algorithm, Shortest Seek First (SSF) algorithm and Elevator algorithm is described. The simulation on scheduling algorithms was implemented in Pascal language and used an external disc drive connected via a parallel port to serve requesting tracks. FCFS algorithm is easy to implement but worse in total length of disc arm traveling. SSF and Elevator algorithms are harder to implement compared to the FCFS algorithm. In SSF, the disc drive head tends to move around the middle tracks, resulting in poor response time. Elevator algorithm shows minimum response time and minimum total length of disc arm traveling. In Elevator algorithm all tracks are served equally.

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali