Article Per Year (5 Year)
p-Index From 2020 - 2025
0.408
P-Index
This Author published in this journals
All Journal Jurnal ULTIMA Computing Electron: Jurnal Ilmiah Teknik Elektro
putri, fidel lusiana
Unknown Affiliation
Computer Science & IT Control & Systems Engineering Electrical & Electronics Engineering Energy Engineering

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

Found 2 Documents
Search

 1 
A Real-Time Space Availability Detection in Smart Parking Systems Using Infrared Sensor and Microcontroller Atmega 328p Putri, Fidel Lusiana
ULTIMA Computing Vol 17 No 1 (2025): Ultima Computing: Jurnal Sistem Komputer
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31937/sk.v17i1.3802

Abstract

In the growing digital era, vehicles have become a staple for daily mobility. This poses a significant parking problem, especially in urban areas with limited parking spaces. The search for parking spaces often leads to congestion, air pollution, fuel waste, and frustration for drivers. This research aims to develop an Internet of Things (IoT) based smart parking system using infrared sensors and an ATmega328p microcontroller to detect the availability of parking slots in real time. This system provides information to the driver through an LCD screen installed at the entrance of the parking area. The methods used in this research are direct testing and tool prototyping. The results show that this smart parking system can detect the availability of parking slots with high accuracy and provide real-time information to drivers, thereby reducing congestion and improving parking management efficiency.
Tinjauan Komprehensif: Simulasi Sistem Disk Scheduling dengan Berbagai Algoritma Menggunakan OS Sim Putri, Fidel Lusiana; Djuniadi; Rochim, Febry Putra
ELECTRON Jurnal Ilmiah Teknik Elektro Vol 6 No 1: Jurnal Electron, Mei 2025
Publisher : Jurusan Teknik Elektro Fakultas Teknik Universitas Bangka Belitung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33019/electron.v6i1.302

Abstract

Disk scheduling is one of the important components in operating system resource management to optimize data access on storage devices. Operating systems use various algorithms to manage input/output (I/O) requests more efficiently, including Shortest Seek Time First (SSTF), LOOK, and Circular LOOK (C-LOOK). This research aims to evaluate and compare the performance of these algorithms in managing disk requests through simulations using OS-SIM. The applied methodology includes simulating a queue of random I/O requests on disks with specific configurations. The data analyzed includes Total Head Movement (THM) and Average Seek Time (AST) for each algorithm. The simulation is performed with a predefined initial position of the disk head, and each algorithm is tested based on how each of them manages the disk access sequence. The results show that the SSTF algorithm is the most efficient with the lowest THM and AST values of 208 tracks and 29.71 ms AST, compared to the LOOK and C-LOOK algorithms. The LOOK algorithm provides a balance between efficiency and fairness, as it is able to minimize head movement without ignoring distant requests. Meanwhile, C-LOOK is more effective in reducing the possibility of starvation on requests at the end of the disk, but at the cost of increasing the number of head movements. This research provides a clearer picture of the advantages and disadvantages of each algorithm, which can be used as a reference in the selection of disk scheduling algorithms in systems that require high efficiency and reliability in I/O management.
Co-Authors Djuniadi Djuniadi Rochim, Febry Putra