Comparison of defragmentation techniques on parking reservations = perbandingan teknik defragmentasi pada penjadwalan slot reservasi parkir

Christianata, Kervin (2018) Comparison of defragmentation techniques on parking reservations = perbandingan teknik defragmentasi pada penjadwalan slot reservasi parkir. Bachelor thesis, Universitas Pelita Harapan.

[img] Text (Title)
Title.pdf
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (18MB)
[img] Text (Abstract)
Abstract.pdf
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (570kB)
[img] Text (ToC)
ToC.pdf
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (582kB)
[img] Text (Chapter 1)
Chapter1.pdf
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (468kB)
[img] Text (Chapter 2)
Chapter2.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (658kB)
[img] Text (Chapter 3)
Chapter3.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (706kB)
[img] Text (Chapter 4)
Chapter4.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (2MB)
[img] Text (Chapter 5)
Chapter5.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (452kB)
[img] Text (Bibliography)
Bibliography.pdf
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (2MB)
[img] Text (Appendices)
Appendices.pdf
Restricted to Repository staff only
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (889kB)

Abstract

Online parking reservation is one solution to overcome the problem of parking outages. The first fit technique is the most basic approach used to schedule reservations where in this technique, reservations are chronologically placed into the parking slots causing the parking arrangement to scatter and not optimal. This thesis evaluates other techniques that can be implemented to parking reservations in hope to increase efficiency. Defragmentation technique can be used in this scenario to rearrange existing reservations thus maximizing the amount of reservation and time slots filled. There are 3 existing defragmentation techniques that will be tested and analyzed, interval defragmentation, recursive first fit and disk defragmentation mimic. Modification is also made to interval defragmentation and recursive first fit in hope to achieve better parking arrangement. All of these techniques, or algorithms, also undergo white box testing to make sure that only valid inputs are going to be carried on. A bitmap graphic is also designed to display the new parking arrangement as a proof that the algorithms work as intended. An application is made where 1000 random data is generated and 8 defragmentation algorithm can be applied and analyzed. There are 3 factors that is considered in this comparison that is time slots filled, reservations processed and performance. Normalized value for each factor is calculated and summed to get the ‘sum value’. The Disk Defragmentation Mimic algorithm is the best when the ‘sum value’ is compared./ Reservasi parkir online adalah salah satu solusi untuk mengatasi masalah kekurangan parkir. Teknik first fit adalah penjadwalan yang digunakan dimana reservasi akan dimuat secara kronologis ke slot parkir yang tersedia pertama sesuai urutan. Namun teknik ini menyebabkan susunan parkir yang menyebar dan tidak optimal. Penelitian ini mengevaluasi teknik lain yang dapat di implementasikan ke reservasi parkir untuk menambah efisiensi lapangan parkir. Teknik defragmentasi dapat digunakan pada skenario ini untuk mengatur kembali susunan reservasi yang ada sehingga memaksimalkan jumlah reservasi dan slot waktu terisi. Teknik defragmentasi yang telah ada, interval defragmentation, recursive first fit dan disk defragmentation mimic diuji dan dianalisa hasilnya. Modifikasi juga dilakukan pada interval defragmentation dan recursive first fit dengan harapan untuk mencapai susunan yang lebih optimal. Semua algoritma ini juga diuji dengan white box testing untuk memastikan input yang valid dan sesuai dengan batasan yang diteruskan. Grafik bitmap juga dirancang untuk menampilkan susunan reservasi parkir yang baru sebagai proof algoritma berjalan dengan benar. Aplikasi telah berhasil dibuat dimana 1000 data acak dihasilkan dan 8 algoritma defragmentasi dapat dijalankan dan dibandingkan hasilnya. Ada 3 faktor yang diperhitungkan dalam perbandingan ini yaitu slot waktu yang terisi, jumlah reservasi yang diterima dan performa algoritma. Nilai normalisasi untuk setiap faktor dihitung dan dijumlahkan menghasilkan nilai sum. Algoritma Disk Defragmentation Mimic adalah algoritma yang terbaik karena mempunyai nilai sum tertinggi disbanding algoritma lainnya.

Item Type: Thesis (Bachelor)
Creators:
CreatorsNIMEmail
Christianata, KervinUNSPECIFIEDUNSPECIFIED
Contributors:
ContributionContributorsNIDN/NIDKEmail
Thesis advisorYugopuspito, PujiantoUNSPECIFIEDUNSPECIFIED
Thesis advisorPanduwinata, FransUNSPECIFIEDUNSPECIFIED
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: University Subject > Current > Faculty/School - UPH Karawaci > School of Information Science and Technology > Informatics
Current > Faculty/School - UPH Karawaci > School of Information Science and Technology > Informatics
Depositing User: Mr Samuel Noya
Date Deposited: 02 Oct 2019 03:49
Last Modified: 02 Oct 2019 03:49
URI: http://repository.uph.edu/id/eprint/4726

Actions (login required)

View Item View Item