Institutional Repository | Satya Wacana Christian University: Analisis Perbandingan Algoritma Penjadwalan CPU A New Improved Round Robin dan A Dynamic Time Quantum Shortest Job Round Robin
Analisis Perbandingan Algoritma Penjadwalan CPU
A New Improved Round Robin dan A Dynamic Time Quantum
Shortest Job Round Robin
Paulus V. Daud Boseren 1, Magdalena A. Ineke Pakereng 2
Fakultas Teknologi Informasi
Universitas Kristen Satya Wacana
Jl. Diponegoro 52-60, Salatiga 50711, Indonesia
E-mail: 672010239@student.uksw.edu1, ineke.pakereng@staff.uksw.edu2
Abstract
CPU scheduling and algorithm is important part of an operating system, even the overall
work of system also influence by hardware but position of scheduling algorithm have very big role in
support the work of a system. The writing of this research is purposed to compare two CPU
scheduling algorithm that base on round robin CPU scheduling algorithm, that is A New Improved
Round Robin CPU Scheduling Algorithm (NIRR) and A Dynamic Time Quantum Shortest Job Round
Robin (SJRR) by based on average waiting time (AWT), average turnaround time (ATAT), average
response time (ART) number of context switches (NCS), throughput, fairness, and CPU utilization
criteria. Result of the research indicates that A New Improved Round Robin (NIRR), more excellent
on average waiting time (AWT), average turnaround time (ATAT), and average response time (ART).
Keywords: CPU Scheduling, Round Robin, Improved CPU Scheduling Algorithm, Dynamic Time
Quantum Algorithm, Shortest Job First Algorithm
Abstrak
Penjadwalan CPU dan algoritmanya merupakan bagian terpenting dari sebuah sistem operasi,
sekalipun kinerja keseluruhan sistem juga dipengaruhi oleh perangkat keras sistem namum posisi
algoritma penjadwalan sangat berperan besar dalam menunjang kinerja sebuah sistem. Penulisan
penilitian ini dimaksudkan untuk membandingkan dua algoritma penjadwalan CPU yang berdasarkan
pada algoritma penjadwalan CPU round robin, yaitu A New Improved Round Robin CPU Scheduling
Algorithm (NIRR) dan A Dynamic Time Quantum Shortest Job Round Robin (SJRR) dengan
berdasarkan pada kriteria average waiting time (AWT), average turnaround time (ATAT), average
response time (ART) number of context switches (NCS), throughput, fairness, dan CPU utilization.
Hasil penelitian menunjukan bahwa algoritma A New Improved Round Robin (NIRR) lebih unggul
pada average waiting time (AWT), average turnaround time (ATAT), dan average response time
(ART).
Kata Kunci: CPU Scheduling, Round Robin, Improved CPU Scheduling Algorithm, Dynamic Time
Quantum Algorithm, Shortest Job First Algorithm
1
2
Mahasiswa Program Studi Teknik Informatika, Fakultas Teknologi Informasi, Universitas Kristen Satya Wacana Salatiga
Staf Pengajar Fakultas Teknologi Informasi Universitas Kristen Satya Wacana Salatiga
A New Improved Round Robin dan A Dynamic Time Quantum
Shortest Job Round Robin
Paulus V. Daud Boseren 1, Magdalena A. Ineke Pakereng 2
Fakultas Teknologi Informasi
Universitas Kristen Satya Wacana
Jl. Diponegoro 52-60, Salatiga 50711, Indonesia
E-mail: 672010239@student.uksw.edu1, ineke.pakereng@staff.uksw.edu2
Abstract
CPU scheduling and algorithm is important part of an operating system, even the overall
work of system also influence by hardware but position of scheduling algorithm have very big role in
support the work of a system. The writing of this research is purposed to compare two CPU
scheduling algorithm that base on round robin CPU scheduling algorithm, that is A New Improved
Round Robin CPU Scheduling Algorithm (NIRR) and A Dynamic Time Quantum Shortest Job Round
Robin (SJRR) by based on average waiting time (AWT), average turnaround time (ATAT), average
response time (ART) number of context switches (NCS), throughput, fairness, and CPU utilization
criteria. Result of the research indicates that A New Improved Round Robin (NIRR), more excellent
on average waiting time (AWT), average turnaround time (ATAT), and average response time (ART).
Keywords: CPU Scheduling, Round Robin, Improved CPU Scheduling Algorithm, Dynamic Time
Quantum Algorithm, Shortest Job First Algorithm
Abstrak
Penjadwalan CPU dan algoritmanya merupakan bagian terpenting dari sebuah sistem operasi,
sekalipun kinerja keseluruhan sistem juga dipengaruhi oleh perangkat keras sistem namum posisi
algoritma penjadwalan sangat berperan besar dalam menunjang kinerja sebuah sistem. Penulisan
penilitian ini dimaksudkan untuk membandingkan dua algoritma penjadwalan CPU yang berdasarkan
pada algoritma penjadwalan CPU round robin, yaitu A New Improved Round Robin CPU Scheduling
Algorithm (NIRR) dan A Dynamic Time Quantum Shortest Job Round Robin (SJRR) dengan
berdasarkan pada kriteria average waiting time (AWT), average turnaround time (ATAT), average
response time (ART) number of context switches (NCS), throughput, fairness, dan CPU utilization.
Hasil penelitian menunjukan bahwa algoritma A New Improved Round Robin (NIRR) lebih unggul
pada average waiting time (AWT), average turnaround time (ATAT), dan average response time
(ART).
Kata Kunci: CPU Scheduling, Round Robin, Improved CPU Scheduling Algorithm, Dynamic Time
Quantum Algorithm, Shortest Job First Algorithm
1
2
Mahasiswa Program Studi Teknik Informatika, Fakultas Teknologi Informasi, Universitas Kristen Satya Wacana Salatiga
Staf Pengajar Fakultas Teknologi Informasi Universitas Kristen Satya Wacana Salatiga