Garuda - Garba Rujukan Digital

Membaca Bakat dengan Aplikasi Talents Mapping untuk Tenaga Pendidik dan Kependidikan SMK Catur Global Kota Bekasi Kustanto, Prio; Fadjriya, Andry; Purnomo, Rakhmat
Jurnal Abdimas UBJ (Pengabdian Kepada Masyarakat) Vol. 4 No. 1 (2021): Januari 2021
Publisher : Lembaga Penelitian Pengabdian kepada Masyarakat dan Publikasi Universitas Bhayangkara Jakarta Raya

Measurement/reading of the talents of each personal educator(teacher) and education personnel need to be done. Among the applications that can be used to take such measurements is to use the Talents Mapping application. Measurement with Talents Mapping aims to analyze the suitability of talent with the field of work, and provide recommendations of the results of reading the talent on the leadership/management. Before the measurement is done, it is necessary to explain talents mapping. This is necessary to provide initial insights and knowledge about Talents Mapping, and the measurement methods to be performed. After the measurement results are obtained, discussions can be made on the results of these measurements. The results of measuring/reading the talents of each personal educator and education personnel with the Talents Mapping Application is expected to help determine the suitability of talent with the field of work pursued by educators and education personnel, as well as provide recommendations of the results of reading the talent to the management/school leadership Keywords: Talents Mapping, Talent, Educators, Educational personnel, Strength Topology Abstrak Pengukuran/pembacaan bakat tiap personal tenaga pendidik(guru) dan tenaga kependidikan perlu dilakukan. Diantara aplikasi yang bisa digunakan untuk melakukan pengukuran tersebut adalah dengan menggunakan aplikasi Talents Mapping. Pengukuran dengan Talents Mapping bertujuan untuk menganalisa kesesuaian bakat dengan bidang kerja, dan memberikan rekomendasi hasil pembacaan bakat tersebut pada pihak pimpinan/manajemen. Sebelum dilakukan pengukuran, perlu dilakukan penjelasan tentang Talents Mapping. Hal tersebut diperlukan untuk memberikan wawasan dan pengetahuan awal tentang Talents Mapping, dan metode pengukuran yang akan dilakukan. Setelah hasil pengukuran didapatkan maka bisa dilakukan diskusi terhadap hasil pengukuran tersebut. Hasil dari pengukuran/pembacaan bakat tiap personal tenaga pendidik dan tenaga kependidikan dengan Aplikasi Talents Mapping diharapkan dapat membantu mengetahui kesesuaian bakat dengan bidang kerja yang digeluti oleh tenaga pendidik dan kependidikan, serta memberikan rekomendasi hasil pembacaan bakat tersebut pada pihak manajemen/pimpinan sekolah. Kata kunci: Talents Mapping, Bakat, Tenaga Pendidik, Tenaga Kependidikan, Strength Topology

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

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.

Pengendali Robot Tempat Sampah Menggunakan Smartphone Berbasis Boarduino Fadjria, Andri; Purnomo, Rakhmat; Rahman, Nur
Jurnal Jaring SainTek Vol. 1 No. 2 (2019): Oktober 2019
Publisher : Fakultas Teknik, Universitas Bhayangkara Jakarta Raya

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

The cafeteria of Bhayangkara University, Greater Jakarta, has a problem that is a lot ofgarbage left by visitors to the canteen. Waste consists of plastic, paper, food scraps placedat the canteen table by visitors to the canteen. The location of the trash can is far from thevisitors, and the number of trash bins totaling 4 pieces, unable to accommodate the garbagefrom visitors to the canteen can get problems in environmental pollution for the future. Sohe made a study that produced a garbage bin robot with an industrial system 4.0, which isto assist the task of human work. With the aim of reducing the trash left by visitors to thecanteen and the convenience of visitors to put garbage on the robot. Using the protoypingmethod in the system of making garbage bins with the stages of collecting design processneeds, building prototypes, evaluating & repairing, producing a robot with a smartphonecontroller based on boarduino applications so that robots can work according to the needsexpected by researchers.

Analisis Luas Lahan Kelapa Sawit Menggunakan Metode FuzzyAHP Terhadap Resiko Pelaku Usaha Paduloh; Purnomo, Rakhmat; Widyantoro, Murwan
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

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.

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

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

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

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

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: 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

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.

Title

Found 14 Documents
Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title Search

Found 14 Documents Search

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Abstract

Title

Found 14 Documents
Search