Teknik Penjadwalan Prosesor FIFO, SJF Non Preempetive, Round Robin

Ikhsan Parinduri, Siti Nurhabibah Hutagalung

Abstract


Processor scheduling is divided into several methods including FIFO, Non Preempetive SJF, Round Robin. Implementation can know the performance of the processor which consists of process, waiting time, arrival time and completion stage. In this case the processor scheduling is made in NetBeans IDE.7.0.1 programming with input on the main menu and calculation process display menu with AWT (Average Waiting Time) value with units of ms, table display process: process, burst time and gaint chart : process, waiting time, start time and end time.

Full Text:

PDF

References


Ardi Wijaya, Gunawan, “Implementasi Algoritma Round Robin Pada Sistem Penjadwalan Mata Kuliah (Studi Kasus: Universitas Muhammadiyah Bengkulu)”,Jurnal Informatika UPGRIS Vol. 4, No. 1, (2018) P/E-ISSN: 2460-4801/2447-6645, Program Studi Informatika, Fakultas Teknik, Universitas Muhammadiyah Bengkulu.

Tan Handoko Daharma Saputro,” Pemodelan CPU Schedulling dengan Algoritma Round Robin Sebagai Media Pembelajaran Matakuliah Sistem Operasi”, Program Studi Teknik Informatika, S1, Fakultas Ilmu Komputer, Universitas Dian Nuswantoro.

Yogie Ariyanto P, Soetam Rizky Wicaksono, “Sistem Pendukung Keputusan Penjadwalan Pengemudi dengan Menggunakan Algoritma Round Robin (Studi Kasus: Zena Travel)”, Jurnal Sains dan Teknologi, P-ISSN : 2303-3142 E-ISSN : 2548-8570 Vol. 6, No. 1, April 2017, Jurusan Sistem Informasi, Fakultas Sains dan Teknologi Universitas Ma Chung, Malang.

Yosef Benny Kurniawan, “ Aplikasi Simulasi Algoritma Penjadawalan Sistem Operasi”, 2011, Program Studi Teknik Informatika, Jurusan Teknik Informatika, Fakultas Sains dan Teknologi, Universitas Sanata Dharma, Yogyakarta

D. Nofriansyah, Buku Algoritma Data Mining dan Pengujian, 2017.




DOI: http://dx.doi.org/10.30645/senaris.v1i0.93

Refbacks

  • There are currently no refbacks.


&nbsp