Article Per Year (5 Year)
p-Index From 2019 - 2024
0.659
P-Index
This Author published in this journals
All Journal Sinkron : Jurnal dan Penelitian Teknik Informatika Jurnal Ilmiah Teknologi Informasi Asia Jurnal Jaring SainTek
Rakhmat Purnomo
Unknown Affiliation
Chemical Engineering, Chemistry & Bioengineering Computer Science & IT Energy Engineering Industrial & Manufacturing Engineering

Published : 3 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 3 Documents
Search

 1 
Analisis Luas Lahan Kelapa Sawit Menggunakan Metode FuzzyAHP Terhadap Resiko Pelaku Usaha Paduloh; Rakhmat Purnomo; Murwan Widyantoro
Jurnal Jaring SainTek Vol. 1 No. 1 (2019): April 2019
Publisher : Fakultas Teknik, Universitas Bhayangkara Jakarta Raya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31599/jaring-saintek.v1i1.182

Abstract

The aim of this study was to identify the risk of oil palm land ownership and the relationship between oil palm land area and farmers' income, the level of welfare of farmers and workers in oil palm plantations. This research can be a reference for businesses who will invest in oil palm plantations. The research was conducted by giving questionnaires to experts, the experts in question were oil palm industry players and were able to make decisions. The results of the questionnaire are processed using Fuzzy AHP to determine the degree of importance of each expert. The results obtained are the biggest risk at the actor level is the farmer, at the level of the highest risk criteria is the increase in the amount of supply while at the alternative level is the risk of quality.
Analisis Algoritma Round Robin pada Penjadwalan CPU Tri Dharma Putra; Rakhmat Purnomo
Jurnal Ilmiah Teknologi Informasi Asia Vol 15 No 2 (2021): Volume 15 Nomor 2 (8)
Publisher : LP2M INSTITUT TEKNOLOGI DAN BISNIS ASIA MALANG

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.32815/jitika.v15i2.481

Abstract

ABSTRACT. Scheduling is a key concept in computer multitasking and multiprocessing operating system design and in real-time operating system design by switching the CPU among process. Round Robin Algorithm is a wellknown algorithm in CPU scheduling. Round Robin Algorithm provides a time quantum between context switching. Choosing the time quantum in Round Robin Algorithm is very crucial, large quantum time will result in lower context switching, while small quantum time wil result in higher context switching. For waiting time, the idea for waiting time is to get smaller waiting time which is more efficient. Turn around time also should be minimum, which is more efficient. Two case studies are discussed to understand this algorithm more deeply. We did analysis with data set process 1 till process 5 (P1-P5), with burst time dataset: 20ms, 34ms, 25ms, 62ms, 67ms. In case study 1, we use quantum 25m, and in case study 2, we use quantum 15ms. Context switching in case study 2 is 17 where on case study 1, only 10 context switchings. Total burst-time in case study 1 and case study 2 are 208 ms. Average waiting time in case study 1 is 82 ms, where in case study 2 is 105.8 ms. Average Turn Around Time in case study 1 is 123.6ms, where in case study 2 is 146.6 ms. Keywords: Round Robin Algorithm, quantum time, context switching, average waiting time, average turn around time
Case Study: Improved Round Robin Algorithm Tri Dharma Putra; Rakhmat Purnomo
Sinkron : jurnal dan penelitian teknik informatika Vol. 7 No. 3 (2022): Article Research Volume 7 Number 3, July 2022
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v7i3.11530

Abstract

In this journal, discussion is given to analyse the improved round robin algorithm more thoroughly. Round robin algorithm plays a significant role to be used in embedded systems. Round robin algorithm usually applied in real-time systems. Here, three case studies are given, and also the analysis of each case study. Comparisons are given about the average turn around time and average waiting time, also number of context switching between the three case studies. Improved round robin algorithm, is a modification from the generic round robin algorithm. In improved round robin algorithm if the remaining burst time is less than the time slice that is allocated, then the currently running process is continue to be executed. Then finish the currently running process from ready queue and execute the next ready queue. Three case studies are given with three different time quantum, which are 3, 4, and 5 ms. The result of this case study analysis is that, the efficiency of the quantum 5 ms is the most effective one. There is an increase of 50% context switching from quantum 3 to quantum 5. And for average turn around time we get 13.13% reduction in efficiency. While in average waiting time we get reduction 12.08% efficiency.
Co-Authors Paduloh Paduloh Tri Dharma Putra Tri Dharma Putra Widyantoro, Murwan