The case for active block layer extensions

Guerra, Jorge; Useche, Luis; Bhadkamkar, Medha; Koller, Ricardo; Rangaswami, Raju

doi:10.1145/1453775.1453778

Cited by 11 publications

(8 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The request is transferred to the block layer via submit_bio(). The block I/O layer serves as a bridge between the file system layer and device driver and provides OS-level block request/response management and block I/O scheduling [6]. The device driver transfers a read/write command according to the requested storage (e.g., HDD, SSD).…”

Section: B Processing I/o In the Block Layermentioning

confidence: 99%

An Efficient Block Address Transformation Scheme in Block Layer for Flash-Based SSDs

Han

Son

2022

IEEE Access

View full text Add to dashboard Cite

Flash-based solid state drives (SSDs) are widely adopted in both industry and the academia since SSDs offer higher performance, lower latency, and lower power consumption compared with traditional hard disk drives (HDDs). Unfortunately, the performance of SSDs can be affected by I/O access patterns. For example, random I/O operation degrades the SSD performance compared with sequential I/O operation since the random I/O operation reduces the spatial locality and increases garbage collection (GC) overhead. To handle this issue, in this article, we propose an efficient block address transformation scheme in the block layer to improve both performance and portability. To do this, we first transform random access patterns to sequential access patterns by sequentializing the block addresses in the block layer. Second, we devise a mapping table for managing transformed block addresses. Third, we support correct read operations and transaction processing for updating the mapping table to avoid sacrificing the consistency. Finally, we provide a cleaning scheme to reclaim invalid data generated by the transformed sequential access. This scheme increases spatial locality, reduces GC overhead, and operates well on any file systems or devices. Experimental results show the proposed scheme improves performance by up to 2x, 1.86x, 2.15x, and 42.8% compared with existing scheme in the case of diverse file systems such as EXT4, XFS, BTRFS, and F2FS, respectively.

show abstract

Section: B Processing I/o In the Block Layermentioning

confidence: 99%

An Efficient Block Address Transformation Scheme in Block Layer for Flash-Based SSDs

Han

Son

2022

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Table 1: Properties of extensible storage system architectures. The * indicates that some systems (e.g., ABLE [17]) are exceptions, while "✗✗✗" indicates significantly higher level of said property than a single "✗".…”

Section: Indep Scalementioning

confidence: 99%

“…The drawbacks of this approach are the significant development time, effort, required expertise, and an inability to scale the resources used for the new feature independently. Recognizing these limitations, researchers have created extensible harnessing for storage systems that allows new features to be interposed within the storage stack without modifying the existing storage system [1,4,15,17,38,50]. The interposed feature layer, however, is in the storage I/O path handling every client I/O request, and therefore must meet stringent performance requirements.…”

Section: Indep Scalementioning

confidence: 99%

Infusing pub-sub storage with transactions

Rodriguez

Bent

Shaffer

et al. 2022

Proceedings of the 14th ACM Workshop on Hot Topics in Storage and File Systems

Self Cite

View full text Add to dashboard Cite

The need to support new features in existing storage systems is an ongoing concern for storage developers. So is the desire to develop next generation storage systems that can adopt newly developed feature improvements with relative ease. Extending storage systems is challenging because of the inherent complexity of their codebases and the need to ensure that the storage state does not become corrupt or inconsistent when enabling new features. In this work, we examine a new storage architecture, FDMI, that uses the well-established publish-subscribe model for extending the feature set of a host storage system using plugins. A central mechanism in FDMI is transactional coupling. With transactional coupling, the subscribed plugin can either create new transactions that execute asynchronously following the successful completion of the precipitating event or can participate in the pending transaction and control whether the precipitating event itself will or will not be committed. We further create a classification of transactional mechanisms as well as possible desired plugin functionality and explore the matrix of these two classifications to create a new model for faster, safer distributed storage development.

show abstract

“…Block-level data de-duplication technology divides a data stream into blocks, reviews each data block, and decides if it met the same data before the block (usually by implementing a hash algorithm for each data block to establish a digital signature or unique identifier) [25]. The block's identifier is also stored in the index if it is special and was written to disk.…”

Section: Block -Level De-duplicationmentioning

confidence: 99%

‏An Enhanced Approach to Improve the Security and Performance for Deduplication

Almrezeq¹

2021

TURCOMAT

View full text Add to dashboard Cite

Cloud service providers providing users with efficient and effective storage and transmission of data. To reduce storage costs and save bandwidth, cloud service providers are attracted to use data de-duplication feature. Cloud users are interested in using the cloud safely and privately to protect the data they share on the cloud. Therefore, they encrypt the data before uploading it to the cloud. Since the intent of encryption conflicts with the de-duplication function, the data de-duplication feature becomes a hard problem. Existing de-duplication methods are ineffective in terms of both security and efficiency. They are either vulnerable to brute force attacks that enable the attacker to retrieve files, or they are computationally expensive. That is what drives us to suggest a method for removing duplicate data that is both performance and security effective. We'll start with a description of the implementations and functionality of de-duplication strategies, then move on to the literature that proposes various approaches to de-duplication and the security and efficiency problems that existing approaches face. Via the use of the AES-CBC algorithm and hashing functions, we have proposed an enhancement to improves the performance and protection of data de-duplication for users. Without the involvement of a third party, users' keys are created in a consistent and safe manner. We prove the efficacy of the recommended solution by putting it into practice and comparison with the existing techniques.

show abstract

The case for active block layer extensions

Abstract: Abstract

Cited by 11 publications

References 31 publications

An Efficient Block Address Transformation Scheme in Block Layer for Flash-Based SSDs

An Efficient Block Address Transformation Scheme in Block Layer for Flash-Based SSDs

Infusing pub-sub storage with transactions

‏An Enhanced Approach to Improve the Security and Performance for Deduplication

Contact Info

Product

Resources

About