Proceedings of the 7th ACM SIGOPS Asia-Pacific Workshop on Systems 2016
DOI: 10.1145/2967360.2967622
|View full text |Cite
|
Sign up to set email alerts
|

File Defragmentation Scheme for a Log-Structured File System

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
6
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
3

Relationship

3
5

Authors

Journals

citations
Cited by 13 publications
(6 citation statements)
references
References 6 publications
0
6
0
Order By: Relevance
“…The previous work of AALFS [29] re-orders valid blocks based exclusively on the inode number. However, it cannot eliminate fragmentation in the case when the valid blocks randomly exist in terms of file offset.…”
Section: Related Work and Discussionmentioning
confidence: 99%
“…The previous work of AALFS [29] re-orders valid blocks based exclusively on the inode number. However, it cannot eliminate fragmentation in the case when the valid blocks randomly exist in terms of file offset.…”
Section: Related Work and Discussionmentioning
confidence: 99%
“…First, defragmentation is the most common method. Park et al proposed a file defragmentation scheme on log-structured file systems [50], addressing the severe fragmentation caused by log-structured methods to enhance sequential read performance on SSD. The scheme determines the fragmentation degree of every segments, and migrates the data in the highly fragmented segment to a new segment.…”
Section: Related Work a File Contiguitymentioning
confidence: 99%
“…There are a lot of valuable studies on how to improve the overall performance of computer systems [1][2][3][4][5][6][7][8][9][10][11][12]. For example, since the overall performance depends on the latency of input/output operations, many researchers in academia and industry have focused on hardware improvements (e.g., non-volatile memory, CXL, and NVMe SSD devices).…”
Section: Introductionmentioning
confidence: 99%