Article Per Year (5 Year)
p-Index From 2020 - 2025
2.522
P-Index
This Author published in this journals
All Journal Sinkron : Jurnal dan Penelitian Teknik Informatika Journal of Computer Networks, Architecture and High Performance Computing Jurnal Sains Teknologi dalam Pemberdayaan Masyarakat Jurnal Ilmiah IT CIDA : Diseminasi Teknologi Informasi Journal of Informatics and Information Security
Putra, Tri Dharma
Unknown Affiliation
Computer Science & IT Control & Systems Engineering Education Engineering Industrial & Manufacturing Engineering Other

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

Found 15 Documents
Search

 1   2 
Pemberdayaan Sumber Daya Desa Sukawijaya melalui Teknologi Informasi Purnomo, Rakhmat; Putra, Tri Dharma
Jurnal Sains Teknologi dalam Pemberdayaan Masyarakat Vol. 1 No. 1 (2020): Juli 2020
Publisher : Fakultas Teknik Universitas Bhayangkara Jakarta Raya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31599/jstpm.v1i1.60

Abstract

Community Service Program in Real Work Lectures or PKM-KKN aims to train student soft skills. A companion lecturer is determined to guide and direct 30 students. The PKM-KKN program is carried out in Desa Sukawijaya, Kecamatan Tembelang, Kabupaten Bekasi, West Java. Our main program is technopreneur socialization and internet marketing. The implementation method is by sharing knowledge and experience through socialization activities to youth youths and students of the Aliyah Al-Hidayah Madrasah School in Desa Sukawijaya. The results of PKM-KKN activity are youth youths and students of the Aliyah Al-Hidayah Madrasah school in Desa Sukawijaya are expected to behave wisely in the use of information technology devices, especially smartphones and the internet to optimize the potential of personal competence, personal effort and the potential of Sukawijaya Village community.
Case Study: Improved Round Robin Algorithm Putra, Tri Dharma; Purnomo, Rakhmat
Sinkron : jurnal dan penelitian teknik informatika Vol. 6 No. 3 (2022): Article Research Volume 6 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.
Simulation of Priority Round Robin Scheduling Algorithm Putra, Tri Dharma; Purnomo, Rakhmat
Sinkron : jurnal dan penelitian teknik informatika Vol. 6 No. 4 (2022): Article Research: Volume 6 Number 4, October 2022
Publisher : Politeknik Ganesha Medan

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

Abstract

In this journal, simulation of priority round robin scheduling algorithm is presented. To imitate the processes of operating system operation, simulation can be used. By simulation, model is used, namely models that represent the characteristics or behaviour of systems. Process scheduling is one important operation in operating system. OS-SIM can be used to model and simulate the operations of process scheduling. Some scheduling algorithms are available in modern operating systems, like First come First Serve (FCFS), Shortest Job First (SJF), Round Robin (RR), Priority Scheduling or combination of these algorithms. One important scheduling algorithm for real-time or embedded system is priority round robin scheduling algorithm. Priority round robin scheduling algorithm is a preemptive algorithm. Each process is given time quantum. Each process has a priority. Here time quantum 3 is given. The higher the time quantum, the more the context switching. By the use of OS-SIM, simulation can be understood easily and thoroughly. The statistics, will be calculated automatically by the system by the simulator, like the number of context switching, average waiting time, average turn around time, and average responds time. With one example, by using quantum=3. The average turn around time is 18.25 ms. The Average Waiting Time is 12 ms. The Average Responds time is 2.75 ms. The total burst time is 25 ms.
Average Max Round Robin Algorithm: A Case Study Putra, Tri Dharma; Purnomo, Rakhmat
Sinkron : jurnal dan penelitian teknik informatika Vol. 7 No. 4 (2023): Article Research Volume 7 Issue 4, October 2023
Publisher : Politeknik Ganesha Medan

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

Abstract

Round Robin Algorithm is one wellknown algorithm in real time system. Several variants of round robin algorithms are in the fields. Average max round robin algorithm is a breakthrough to optimize context switching or also called quantum. Context switching is one big problem in round robin algorithm. To optimize high context switching is the key solution. This will make this algorithm efficient. There should be a way to optimize this context switching. Then the average max round robin algorithm is one solution to this problem. The average max algorithm is defined by finding the average of burst time then add the maximum burst time to the average burst time. Then calculate again the average of the two. The calculation will be iterated in the next round robin cycle. Here, in this journal, three case studies are discussed. Each with different burst times to understand this average max round robin algorithm more clearly. In the first case study we get turn around time 34 ms, and average waiting time 20.6 ms. In the second case study, we get average turn around time 21.8 ms, and the average waiting time 13 ms. And in the last case study, the third one, we get turn around time 12.2 ms, and the average waiting time 6.6 ms. There is no calculation for the second iteration for all case studies. Since the left burst time is only in one process. Optimizing the context switching, minimizing average turnaround time, and average waiting time is the key solution to round robin algorithm.
Theoretical Analysis of Standard Selection Sort Algorithm Purnomo, Rakhmat; Putra, Tri Dharma
Sinkron : jurnal dan penelitian teknik informatika Vol. 7 No. 2 (2023): Research Article, Volume 7 Issue 2 April, 2023
Publisher : Politeknik Ganesha Medan

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

Abstract

Sorting algorithms plays an important role in the computer science field. Many applications use sorting algorithm. There are several sorting algorithms proposed by experts, namely bubble sort, exchange short, insertion short, heap sort, quick short, merge sort, standard selection sort. One well-known algorithm of sorting is selection sort. In this journal, discussion about standard selection sort is given with thorough analysis. Sorting is very important data structure concepts that has an important role in memory management, file management, in computer science in general, and in many real-life applications. Different sorting algorithms have differences in terms of time complexity, memory use, efficiency, and other factors. There are many sorting algorithms exist right now in the computer science field. Each algorithm has its benefits and limitations where a trade-off exists between execution time and the nature of the complexity of the algorithm itself. The method is theoretical analysis. Three theoretical analyses are given with deep explanation and analysis. Each with six index arrays, namely with six data on it. The numbers are sorted in ascending order. Pseudo code is also given, to understand this algorithm more thoroughly. It is concluded that this theoretical analysis explained the algorithm more clearly, by using process iteration by hand.
Comparative Study: Preemptive Shortest Job First and Round Robin Algorithms Purnomo, Rakhmat; Putra, Tri Dharma
Sinkron : jurnal dan penelitian teknik informatika Vol. 8 No. 2 (2024): Article Research Volume 8 Issue 2, April 2024
Publisher : Politeknik Ganesha Medan

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

Abstract

Abstract: Operating system is a software acting as an interface between computer hardware and user. Operating system is known as a resource manager. The main responsibility of operating system is to handle resources of computer system. Scheduling is a key concept in computer multitasking and multiprocessing operating system design by switching the CPU among process. Shortest job first (SJF) and round robin are two wellknown algorithms in CPU processing. For shortest job first, this algorithm can be preemptived. In preemptive shortest job first, when a new process coming in, the process can be interupted. Where with round robin algorithm there will be time slices, context switching, or also called quantum, between process. In this journal we wil discuss comparative study between preemptive shortest job first and round robin algorithms. Three comparative studies will be discussed to understand these two algorithms more deeply. For all comparative study, the average waiting time and average turnaround time is more for round robin algorithm. In the first comparative study, we get average waiting time 52% more. For average turnaround time, 30% more. In second comparative analysis, we get 52 % average waiting time more and we get 35 % average turnaround time more. For third comparative analysis, average waiting time we get 50% more and for average turnaround time, we get 28% more. Thus it is concluded in our comparative study for these kind of data the preemptive shortest job first is more efficient then the round robin algorithm. Keywords: comparative study, premptive shortest job first algorithm, round robin algorithm, turn around time, average waiting time, time slice
Simulation and Modelling of Pre-emptive Priority CPU Scheduling Algorithm Putra, Tri Dharma; Purnomo, Rakhmat
Sinkron : jurnal dan penelitian teknik informatika Vol. 8 No. 3 (2024): Research Artikel Volume 8 Issue 3, July 2024
Publisher : Politeknik Ganesha Medan

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

Abstract

A model is a representation of an idea, thing or object in a simplified form. Model contains information about a system that is created with the aim of studying the actual system. Simulation is an imitation of system using a computer model. In this journal simulation is done by using OS-SIM, an operating system simulator. Process scheduling in an important part in operating systems. Several scheduling algorithms exist in the field. Shortest job first, round robin, first come first serve, priority and all of their variants. In this journal discussion about pre-emptive priority scheduling algorithm is presented thoroughly. Pre-emptive priority scheduling algorithm is an algorithm based on priority. The higher the number of the priority, the higher the priority. Five processes are available and given. Each with burst time, priority and different arrival times. Simulation and modelling with OS-SIM are discussed to understand this algorithm more easily. Some statistics numbers in the system are calculated automatically by the OS-SIM. Some screen shot pictures of the simulator are given to describe the model. It is concluded that for these processes the average turnaround time is 42/5 = 8.4 ms and for average waiting time is 28/5=5.6 ms and the total burst time is 14 ms.
Perancangan Sistem Trouble Ticket Fiber Optic Menggunakan Algoritma Priority Scheduling Pada PT. Era Bangun Jaya Kumala, Muhammad Haris; Putra, Tri Dharma
Jurnal Ilmiah IT CIDA Vol 10 No 1: Juni 2024
Publisher : STMIK Amikom Surakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.55635/jic.v10i1.207

Abstract

Penelitian ini bertujuan untuk merancang dan mengimplementasikan sistem trouble ticket fiber optic menggunakan algoritma priority scheduling pada PT Era Bangun Jaya. Sistem ini dirancang untuk memudahkan penanganan permasalahan jaringan fiber optic dengan memberikan prioritas trouble ticket yang sesuai. Metode penelitian yang digunakan melibatkan analisis kebutuhan perusahaan, perancangan sistem, dan implementasi berbasis web. Sistem trouble ticket ini memberikan kemudahan bagi pengguna mengelola data trouble ticket, sementara petugas lapangan dapat dengan cepat memberikan respon dan menanggapi trouble ticket dengan cepat. Hasil implementasi menunjukkan keberhasilan dalam meningkatkan efisiensi penanganan tiket, memberikan prioritas pada masalah yang lebih kritis, dan memungkinkan pemantauan real time. Selain itu, sistem ini memberikan dasar untuk integrasi dengan dashboard Grafana guna visualisasi yang lebih baik terhadap kinerja sistem trouble ticket. Kesimpulan penelitian menunjukkan bahwa sistem trouble ticket fiber optic dengan algoritma priority scheduling memberikan kontribusi positif terhadap manajemen permasalahan jaringan fiber optic di PT Era Bangun Jaya. Penelitian ini juga memberikan saran untuk pengembangan lebih lanjut, seperti optimalisasi algoritma, integrasi dengan aplikasi mobile, dan pelatihan keterampilan petugas dukungan untuk meningkatkan efektivitas.
A Review on AMRR and Improved Round Robin Algorithms: Comparative Study Putra, Tri Dharma; Purnomo, Rakhmat
Sinkron : jurnal dan penelitian teknik informatika Vol. 8 No. 4 (2024): Article Research Volume 8 Issue 4, October 2024
Publisher : Politeknik Ganesha Medan

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

Abstract

Round Robin Algorithm is a dominant algorithm in real time system. Improved round robin and average max round robin, which is also called AMRR are two types with a breakthrough. Improved round robin is an algorithm where if the remaining burst time of the process is less than the quantum, then the running process will continue to be executed. Afterwards the next iteration will be executed as its turn. So, each iteration will have a vary of quantum. It is called a dynamic time quantum. Different with improved round robin, in AMRR, in every iteration, the quantum will be calculated. So, for every iteration, the quantum might be different, depending upon the quantum calculation of the rest burst time. The first stage of this algorithm is to calculate the average of the existing burst times. Then this average is added with the maximum existing burst time. This addition then will be divided, then we get the quantum. This calculation will be executed again after the iteration finish. Based on our analysis, with quantum 10 in these two algorithms. It is can be shown that the improved round robin is less efficient than AMRR, because its average turnaround time and average waiting time is lower. The average turnaround time is 17.25 ms for AMRR compared to 23.25 ms in improved round robin. And the average turnaround time is 9 ms for AMRR compared to 15 ms in improved round robin.
Median-Average Round Robin (MARR) Algorithm for Optimal CPU Task Scheduling Purnomo, Rakhmat; Putra, Tri Dharma
Sinkron : jurnal dan penelitian teknik informatika Vol. 9 No. 1 (2025): Research Article, January 2025
Publisher : Politeknik Ganesha Medan

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

Abstract

Abstract: In operating systems, multitasking or multiprocessing terms are used. If more than one task operating consecutively, but the users feel that they are running simultaneously, than it is called multitasking. Round robin algorithm is a noted algorithm in multitasking. Several modifications of classical round robin algorithm have been proposed by experts. The idea behind these modifications are to get lower turnaround time and lower waiting time. The main topic’s discussion is about median-average round robin (MARR) algorithm. In this algorithm, the processes are arranged in ascending order. Then we get the median of the burst time. Afterwards, calculation of the average burst time is done. The summation of average and median, divide by two is the time quantum. So, the time quantum will be dynamic, based on each iteration of round robin. First iteration can have different time quantum compared to the second and so on. Each iteration will have one time quantum. Three analysis’s are given. Each with five processes. In the first analysis, time quantum for 1st iteration is 11 and the 2nd iteration is 4. The average turnaround time is 29. The average waiting time is 19. For the second analysis, time quantum for 1st iteration is 10 and the 2nd iteration is 8. The average turnaround time is 24.2. The average waiting time is 13.6. For the third analysis, time quantum for 1st iteration is 10 and the 2nd iteration is 9. The average turnaround time is 23.2. The average waiting time is 12.8.
Co-Authors Hindarto, Djarot Kumala, Muhammad Haris Nugroho, Danan Rifandi Purnomo, Rakhmat Ramdhani, Asep Wahyuddin, Mohammad Iwan