Mardi, Muhammad Rafki (2024) Implementation Of Write Efficient Cache (WEC) Algorithm On SSD Based Cache To Improve SSD Write Efficiency. Other thesis, Institut Teknologi Sepuluh Nopember.
Text
05111940000054-Undergraduate_Thesis.pdf - Accepted Version Restricted to Repository staff only until 1 October 2026. Download (8MB) | Request a copy |
Abstract
Dalam menjalankan proses pada suatu aplikasi, dibutuhkan mekanisme yang cepat untuk memperoleh suatu data. Adapun jumlah data tersebut bergantung dengan proses yang sedang dijalankan. Perkembangan teknologi serta bertambahnya kebutuhan layanan membuat besar data yang diproses menjadi sangat besar dan harus memiliki ketersediaan yang tinggi. Terhadap hal tersebut, diperkenalkan mekanisme cache. Keberadaan cache sebagai mekanisme penyimpanan data sementara menjanjikan bahwa data – data yang berada di dalamnya merupakan data yang sering dan pasti akan digunakan kembali. Dalam suatu cache, sebuah algoritma replacement policy diimplementasikan untuk memilih dan menyimpan suatu data dari storage level ke cache level, hal ini juga mencakup pemilihan data yang akan digantikan ketika data baru masuk ke cache.
Untuk menunjang jumlah data yang besar, solid-satate drive (SSD) menjadi pilihan terbaik sebagai cache dengan dasar performa read dan write yang sangat cepat. Namun dibalik hal tersebut, kemampuan SSD dalam melaksanakan hal tersebut dibatasi oleh kemampuan write dari SSD. Karnanya dibutuhkan implementasi replacement policy yang minim operasi write. Beberapa mekanisme sudah diperkenalkan seperti Least Recently Used (LRU), Low Inter-Reference Recency Set (LIRS), dan Least Frequently Used (LFU). Namun masing – masing algoritma masih memiliki tingkat write-efficiency yang rendah. Untuk mencapai hal tersebut, diperkenalkan algoritma Write Efficient Cache (WEC).
Pada Tugas Akhir ini dilakukan implementasi algoritma Write Efficient Cache (WEC) sebagai algoritma cache replacement policy. Pengujian dilakukan dengan membandingkan hasil metrik hit-ratio, write-efficiency dan write-relative algoritma WEC dengan LRU, LFU dan LIRS. Hasil yang didapat menunjukan penurunan write-relative secara signifikan dengan tetap mempertahankan hit-rate yang cukup dengan write-efficiency yang tinggi.
============================================================
When running the process on an application, it needs a fast mechanism to obtain data. The amount of data depends on the process that is being executed. Technological developments and increased service requirements resulted in a large amount of data that needs to be processed and highly available. To overcome this, a cache mechanism was introduced. The existence of a cache as a temporary data storage mechanism promises that the data contained is often used and will be reused. Within a cache, a policy replacement algorithm is implemented to select and store data from storage level to cache level.
To support large amounts of data, a solid-sate drive (SSD) is the best choice as a cache with very fast basic read and write performance. But behind this, the SSD's ability to do so is limited by the SSD's writing ability. That is why the need to implement a proper cache replacement policy with minimal write operations is necessary. Several mechanisms have been introduced such as Least Recently Used (LRU), Low Inter-Reference Recency Set (LIRS), and Least Frequently Used (LFU). However, each of the mentioned algorithms still has a low write-efficiency. To achieve this, the Write Efficiency Cache (WEC) algorithm is introduced.
This Final Project implements the Write Efficiency Cache (WEC) algorithm to improve write-efficiency. The test is conducted by comparing the results of the hit-rate, write-efficiency and write-relative metrics for LIRS, LRU and LIRS algorithm. The results obtained show a significant increase in write-efficiency while still maintaining a decent hit-rate with high write-efficiency
Item Type: | Thesis (Other) |
---|---|
Uncontrolled Keywords: | cache, hit-rate, write-efficiency, SSD cache, hit-rate, write-efficiency, SSD |
Subjects: | T Technology > T Technology (General) > T57.83 Dynamic programming |
Divisions: | Faculty of Intelligent Electrical and Informatics Technology (ELECTICS) > Informatics Engineering > 55201-(S1) Undergraduate Thesis |
Depositing User: | Muhammad Rafki Mardi |
Date Deposited: | 02 Aug 2024 07:17 |
Last Modified: | 02 Aug 2024 07:17 |
URI: | http://repository.its.ac.id/id/eprint/110301 |
Actions (login required)
View Item |