Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : JOURNAL OF APPLIED INFORMATICS AND COMPUTING

Comparative Analysis of OpenMP and MPI Parallel Computing Implementations in Team Sort Algorithm Nugroho, Eko Dwi; Ashari, Ilham Firman; Nashrullah, Muhammad; Algifari, Muhammad Habib; Verdiana, Miranti
Journal of Applied Informatics and Computing Vol. 7 No. 2 (2023): December 2023
Publisher : Politeknik Negeri Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30871/jaic.v7i2.6409

Abstract

Tim Sort is a sorting algorithm that combines Merge Sort and Binary Insertion Sort sorting algorithms. Parallel computing is a computational processing technique in parallel or is divided into several parts and carried out simultaneously. The application of parallel computing to algorithms is called parallelization. The purpose of parallelization is to reduce computational processing time, but not all parallelization can reduce computational processing time. Our research aims to analyse the effect of implementing parallel computing on the processing time of the Tim Sort algorithm. The Team Sort algorithm will be parallelized by dividing the flow or data into several parts, then each sorting and recombining them. The libraries we use are OpenMP and MPI, and tests are carried out using up to 16 core processors and data up to 4194304 numbers. The goal to be achieved by comparing the application of OpenMP and MPI to the Team Sort algorithm is to find out and choose which library is better for the case study, so that when there is a similar case, it can be used as a reference for using the library in solving the problem. The results of research for testing using 16 processor cores and the data used prove that the parallelization of the Sort Team algorithm using OpenMP is better with a speed increase of up to 8.48 times, compared to using MPI with a speed increase of 8.4 times. In addition, the increase in speed and efficiency increases as the amount of data increases. However, the increase in efficiency that is obtained by increasing the processor cores decreases.
Development of YOLO-Based Mobile Application for Detection of Defect Types in Robusta Coffee Beans Nugroho, Eko Dwi; Verdiana, Miranti; Algifari, Muhammad Habib; Afriansyah, Aidil; Firmansyah, Hafiz Budi; Rizkita, Alya Khairunnisa; Winarta, Richard Arya; Gunawan, David
Journal of Applied Informatics and Computing Vol. 9 No. 1 (2025): February 2025
Publisher : Politeknik Negeri Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30871/jaic.v9i1.8886

Abstract

Improving the quality of Robusta coffee beans is a crucial challenge in the coffee industry to ensure that consumers receive high-quality products. However, the identification of defects in coffee beans is still largely performed manually, making the process error-prone and time-consuming. This study aims to develop a YOLO-based mobile application to detect defects in Robusta coffee beans quickly and accurately. The method employed in this study is YOLO, a deep learning-based object detection algorithm known for its real-time object detection capabilities. The application was tested using a dataset of Robusta coffee beans containing various defects, such as broken, black, and wrinkled beans. The test results indicate that the application achieves high detection accuracy, with the black bean class achieving 95.3% accuracy, while the moldy or bleached bean class records the lowest accuracy at 62.2%. This application is expected to assist farmers and coffee industry stakeholders in improving the quality of Robusta coffee beans and enhancing the efficiency of the sorting process.