"Bandwidth"

Popularity-Based Online Scaling for RAID Systems Under General Settings

The ever-increasing demand of storage capacity and system performance leads to the scaling requirement in redundant arrays of independent disks (RAID)-structured storage systems. Existing approaches mainly focus on minimizing data migration in …

Leveraging Array Mapped Tries in KSM for Lightweight Memory Deduplication

In cloud computing, how to use limited hardware resources to meet the increasing demands has become a major issue. KSM (Kernel Same-page Merging) is a content-based page sharing mechanism used in Linux that merges equal memory pages, thereby …

D3: Deterministic Data Distribution for Efficient Data Reconstruction in Erasure-Coded Distributed Storage Systems

Due to individual unreliable commodity components, failures are common in large-scale distributed storage systems. Erasure codes are widely deployed in practical storage systems to provide fault tolerance with low storage overhead. However, the …

A Hierarchical RAID Architecture Towards Fast Recovery and High Reliability

Disk failures are very common in modern storage systems due to the large number of inexpensive disks. As a result, it takes a long time to recover a failed disk due to its large capacity and limited I/O. To speed up the recovery process and maintain …

ISM- An Intra-Stripe Data Migration Approach for RAID-5 Scaling

Scaling is often carried out in modern RAID systems to meet the ever increasing demand of storage capacity and I/O performance. However, the scaling process of RAID-5 system is not trivial, due to its specific data/parity layout. Previous approaches …

PDS: An I/O-Efficient Scaling Scheme for Parity Declustered Data Layout

Parity declustering is widely deployed in erasure coded storage systems so as to provide fast recovery and high data availability. However, to perform scaling on such RAIDs, it is necessary to preserve the parity declustered data layout so as to …

Balanced Parity Update Algorithm with Queueing Length Awareness for RAID Arrays

In parity-based RAID arrays, to update a data chunk, the corresponding parity chunk(s) must be updated accordingly so as to keep data consistency and availability. To achieve this, either read-modify-write (RMW) or read-construct-write (RCW) could be …

OI-RAID: A Two-Layer RAID Architecture towards Fast Recovery and High Reliability

A lot of inexpensive disks in modern storage systems induce frequent disk failures. It takes a long time to recover a failed disk due to its large capacity and limited I/O. This paper proposes a hierarchical architecture of erasure code, OI-RAID. …

Dynamic routing for network throughput maximization in software-defined networks

Software-Defined Networking (SDN) has emerged as the paradigm of the next-generation networking through separating the data control plane from the data plane. The forwarding routing table at each of its switch nodes is usually implemented by …

POS: A Popularity-based Online Scaling scheme for RAID-structured storage systems

The ever-increasing demand of storage capability leads to scaling requirement in RAID-structured storage systems. Previous approaches to RAID scaling mainly focus on minimizing data migration, without considering the user-level application accesses. …