Lone Star Stack: Architecture of a Disk-Based Archival System

Grawinkel, Matthias; Best, Gregor; Splietker, Malte; Brinkmann, André

doi:10.1109/nas.2014.35

Search citation statements

Order By: Relevance

Paper Sections

Select...

Parity Schemes1

A Two-dimensional Raid Schemes1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2016

2017

Publication Types

Select...

Other1

Article1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lonestar scheme: A generalisation of the full scheme is the scheme that was developed for the Lonestar archival system [2], [3]. Here the horizontal parity groups do not have to fill one row exactly, but can be shorter.…”

Section: Parity Schemesmentioning

confidence: 99%

See 1 more Smart Citation

Computing the Probability for Data Loss in Two-Dimensional Parity RAIDs

Nagel

Suess

2017

2017 13th European Dependable Computing Conference (EDCC)

View full text Add to dashboard Cite

Section: Parity Schemesmentioning

confidence: 99%

“…The Lonestar scheme was first described by Grawinkel et al [3] who use it as the basis for a disk-based archival system. They also use the model by Hafner and Rao to determine the data loss probability, and their analysis is also inaccurate for more than five disk failures.…”

Section: A Two-dimensional Raid Schemesmentioning

confidence: 99%

Computing the Probability for Data Loss in Two-Dimensional Parity RAIDs

Nagel

Suess

2017

2017 13th European Dependable Computing Conference (EDCC)

View full text Add to dashboard Cite

LoneStar RAID

2016

View full text Add to dashboard Cite

The need for huge storage archives rises with the ever growing creation of data. With today’s big data and data analytics applications, some of these huge archives become active in the sense that all stored data can be accessed at any time. Running and evolving these archives is a constant tradeoff between performance, capacity, and price. We present the LoneStar RAID, a disk-based storage architecture, which focuses on high reliability, low energy consumption, and cheap reads. It is designed for MAID systems with up to hundreds of disk drives per server and is optimized for “write once, read sometimes” workloads. We use dedicated data and parity disks, and export the data disks as individually accessible buckets. By intertwining disk groups into a two-dimensional RAID and improving single-disk reliability with intradisk redundancy, the system achieves an elastic fault tolerance that can at least recover all 3-disk failures. Furthermore, we integrate a cache to offload parity updates and a journal to track the RAID’s state. The LoneStar RAID scheme provides a mean time to data loss (MTTDL) that competes with today’s erasure codes and is optimized to require only a minimal set of running disk drives.

show abstract

Lone Star Stack: Architecture of a Disk-Based Archival System

Cited by 2 publications

References 18 publications

Computing the Probability for Data Loss in Two-Dimensional Parity RAIDs

Computing the Probability for Data Loss in Two-Dimensional Parity RAIDs

LoneStar RAID

Contact Info

Product

Resources

About