Data Protection: One Size Does Not Fit All

By Paul Carpentier

April 10, 2013

In the course of IT history, many schemes have been devised and deployed to protect data against storage system failure, especially disk drive hardware. These protection mechanisms have nearly always been variants on two themes: duplication of files or objects (backup, archiving, synchronization, remote replication come to mind); or parity-based schemes at disk level (RAID) or at object level (erasure coding, often also referred to as Reed-Solomon coding). Regardless of implementation details, the latter always consists of the computation and storage of “parity” information over a number of data entities (whether disks, blocks or objects). Many different parity schemes exist, offering a wide range of protection trade-offs between capacity overhead and protection level – hence their interest.

Erasure coding:

As of late, erasure coding has received a lot of attention in the object storage field as a ‘one-size-fits-all’ approach to content protection. This is a stretch. Erasure coding is a solid approach to storage footprint reduction for an interesting but bounded field of use cases, involving BOTH large streams AND large clusters, but at the cost of sacrificing the numerous use cases that involve small streams, small clusters, or a combination of the two.

Most readers will be familiar with the concept of RAID content protection on hard disk drives. For example, the contents of a set of five drives is used to compute the contents of what is called a parity drive adding one more drive to the RAID set for a total of six drives. Of the total set of six, if any single drive fails, the content that is lost can be rebuilt from the five remaining drives. Aside such a 5+1 scheme, many others are possible, where even multiple drives can fail simultaneously and yet the full content can be rebuilt: there is a continuum in the trade-off between footprint and robustness.

More recently, the same class of algorithms that is used for RAID has been applied to the world of object storage: they are commonly called Erasure Codes. The concept is similar: imagine an object to be stored in a cluster. Now, rather than storing and replicating it wholly we will cut the incoming stream into (say) six segments in a 5:1 scheme each with parity information. Similar to the RAID mechanism above, any missing segment out of the six can be rebuilt from the five remaining ones, hence the 1. This provides a mechanism to survive a failed disk drive without making a full replica: the footprint overhead is just 20 percent here rather than 100 percent with comparable data durability.

Beyond this “5+1” scheme, many more Erasure Coding (EC) schemes are possible. They can survive as many disk failures as their number of parity segments: a 10+6 scheme can survive six simultaneous segment failures without data loss, for instance. Here the overhead will be 60 percent ((10+6)/10).

Erasure coding comes with trade-offs

The underlying objective is clear: provide protection against failure at lower footprint cost. However, as usual, there is no such thing as a ‘free lunch.’ There are trade-offs to be considered when compared to replication. The key is to have the freedom to choose the best protection for each particular use case.

When chopping up objects to store the resulting segments across a number of nodes, the “physical” object count of the underlying storage system is multiplied (e.g., for a 10:6 scheme, it’s multiplied by 16). Not all competing object storage systems handle high object count well. It is also clear that the granularity (i.e., minimum file size) of the underlying file system or object storage system will play a role in suggesting how small an object can be to be economically stored using erasure coding. It doesn’t really make sense from an efficiency perspective to store, say, a 50K object using a 10:6 erasure coding scheme if there is a file system at the core of a storage system. This is because file systems still segment files into blocks with minimum block sizes. A common threshold for this block size for a Linux file system is 32K so the resulting storage needed for a 50K file using a 10:6 erasure coding scheme would be would be 512K (32K * 16 segments) or a 10X increase in footprint. As we will see replication is a much better approach for small files.

Replication:

The simplest form of protective data redundancy is replication, with one or more additional copies of an “original” object being created and maintained to be available if that original somehow gets damaged or lost. In spite of the recent hype around erasure coding, we will see that there still are substantial use case areas where replication clearly is the superior option. For the sake of the example, imagine a cluster of a 100 CPUs with one disk drive each, and 50 million objects with 2 replicas each, 100 million objects grand total. When we speak of replicas in this context, we mean an instance – any instance – of an object; there is no notion of “original” or “copy.” Two replicas equal a grand total of two instances of a given object, somewhere in the cluster, on two randomly different nodes. When an object loss is detected a recovery cycle begins. Data loss only occurs if both replicas are lost which is why it is important to store replicas on different nodes and if possible different locations. It is also important to have efficient and rapid recovery cycles; you want to ensure that your objects are quickly replicated in case of an overlapping recovery cycle which may lead to data loss. If there are three replicas per object, three overlapping recovery cycles (a very low probability event) will be required to cause any data loss.

Replication and Erasure combined is the answer

As so often in IT, there is no single perfect solution to a wide array of use cases. In object storage applications, cluster sizes run the gamut between just a few nodes built into a medical imaging modality to thousands of nodes spanning multiple datacenters, with object sizes ranging between just a few kilobytes for an email message and hundreds of gigabytes for seismic activity data sets. If we want to fulfill the economic and manageability promises of the single unified storage, we need technology that is fully capable of seamlessly adapting between those use cases.

To deal with the velocity and variability of unstructured information, organizations are increasingly turning to cloud storage infrastructures to manage their data in a cost-effective, just-in-time manner, while others may need the robustness of big data repositories to handle the volume that today’s boundless storage requires. A combination of both replication and erasure coding, combined into a singular object storage solution, will provide the best option to access and analyze data regardless of object size, object count or storage amount while ensuring data integrity aligned with business value. Traditional file systems simply cannot provide the ease of management and accessibility required for cloud storage, nor will they provide the massive scalability and footprint efficiency required for big data repositories. The future of both cloud storage and big data remain firmly entrenched in an object storage solution that incorporates both replication and erasure coding into its architecture to overcome the limitations of either one technology.

To see an in depth paper on “Replication and Erasure Coding Explained,” visit http://www.caringo.com/.

About the Author

Known as the father of the Content Addressing concept, Paul Carpentier invented the patent pending scalable and upgradeable security that is at the heart of Caringo. He was the architect of SequeLink – the first client/server middleware product to connect heterogeneous front ends running over multiple networks to multiple databases on the server side. Paul founded Wave Research and conceived FileWave, the first fully automated, model-driven software distribution and management system. At FilePool, he invented the technology that created the Content Addressed Storage industry. FilePool, was sold to EMC who turned CAS into a multi-billion dollar marketplace. Caringo CAStor, based on two of Mr. Carpentier’s six patents promises to revolutionize the data storage business in much the same manner that CAS created a whole new marketplace.

Subscribe to HPCwire's Weekly Update!

Be the most informed person in the room! Stay ahead of the tech trends with industy updates delivered to you every week!

STEM-Trekker Badisa Mosesane Attends CERN Summer Student Program

June 27, 2017

Badisa Mosesane, an undergraduate scholar who studies computer science at the University of Botswana in Gaborone, recently joined other students from developing nations around the world in Geneva, Switzerland to particip Read more…

By Elizabeth Leake, STEM-Trek

The EU Human Brain Project Reboots but Supercomputing Still Needed

June 26, 2017

The often contentious, EU-funded Human Brain Project whose initial aim was fixed firmly on full-brain simulation is now in the midst of a reboot targeting a more modest goal – development of informatics tools and data/ Read more…

By John Russell

DOE Launches Chicago Quantum Exchange

June 26, 2017

While many of us were preoccupied with ISC 2017 last week, the launch of the Chicago Quantum Exchange went largely unnoticed. So what is such a thing? It is a Department of Energy sponsored collaboration between the Univ Read more…

By John Russell

UMass Dartmouth Reports on HPC Day 2017 Activities

June 26, 2017

UMass Dartmouth's Center for Scientific Computing & Visualization Research (CSCVR) organized and hosted the third annual "HPC Day 2017" on May 25th. This annual event showcases on-going scientific research in Massach Read more…

By Gaurav Khanna

HPE Extreme Performance Solutions

Creating a Roadmap for HPC Innovation at ISC 2017

In an era where technological advancements are driving innovation to every sector, and powering major economic and scientific breakthroughs, high performance computing (HPC) is crucial to tackle the challenges of today and tomorrow. Read more…

How ‘Knights Mill’ Gets Its Deep Learning Flops

June 22, 2017

Intel, the subject of much speculation regarding the delayed, rewritten or potentially canceled “Aurora” contract (the Argonne Lab part of the CORAL “pre-exascale” award), parsed out additional information ab Read more…

By Tiffany Trader

Tsinghua Crowned Eight-Time Student Cluster Champions at ISC

June 22, 2017

Always a hard-fought competition, the Student Cluster Competition awards were announced Wednesday, June 21, at the ISC High Performance Conference 2017. Amid whoops and hollers from the crowd, Thomas Sterling presented t Read more…

By Kim McMahon

GPUs, Power9, Figure Prominently in IBM’s Bet on Weather Forecasting

June 22, 2017

IBM jumped into the weather forecasting business roughly a year and a half ago by purchasing The Weather Company. This week at ISC 2017, Big Blue rolled out plans to push deeper into climate science and develop more gran Read more…

By John Russell

Intersect 360 at ISC: HPC Industry at $44B by 2021

June 22, 2017

The care, feeding and sustained growth of the HPC industry increasingly is in the hands of the commercial market sector – in particular, it’s the hyperscale companies and their embrace of AI and deep learning – tha Read more…

By Doug Black

DOE Launches Chicago Quantum Exchange

June 26, 2017

While many of us were preoccupied with ISC 2017 last week, the launch of the Chicago Quantum Exchange went largely unnoticed. So what is such a thing? It is a D Read more…

By John Russell

How ‘Knights Mill’ Gets Its Deep Learning Flops

June 22, 2017

Intel, the subject of much speculation regarding the delayed, rewritten or potentially canceled “Aurora” contract (the Argonne Lab part of the CORAL “ Read more…

By Tiffany Trader

Tsinghua Crowned Eight-Time Student Cluster Champions at ISC

June 22, 2017

Always a hard-fought competition, the Student Cluster Competition awards were announced Wednesday, June 21, at the ISC High Performance Conference 2017. Amid wh Read more…

By Kim McMahon

GPUs, Power9, Figure Prominently in IBM’s Bet on Weather Forecasting

June 22, 2017

IBM jumped into the weather forecasting business roughly a year and a half ago by purchasing The Weather Company. This week at ISC 2017, Big Blue rolled out pla Read more…

By John Russell

Intersect 360 at ISC: HPC Industry at $44B by 2021

June 22, 2017

The care, feeding and sustained growth of the HPC industry increasingly is in the hands of the commercial market sector – in particular, it’s the hyperscale Read more…

By Doug Black

At ISC – Goh on Go: Humans Can’t Scale, the Data-Centric Learning Machine Can

June 22, 2017

I've seen the future this week at ISC, it’s on display in prototype or Powerpoint form, and it’s going to dumbfound you. The future is an AI neural network Read more…

By Doug Black

Cray Brings AI and HPC Together on Flagship Supers

June 20, 2017

Cray took one more step toward the convergence of big data and high performance computing (HPC) today when it announced that it’s adding a full suite of big d Read more…

By Alex Woodie

AMD Charges Back into the Datacenter and HPC Workflows with EPYC Processor

June 20, 2017

AMD is charging back into the enterprise datacenter and select HPC workflows with its new EPYC 7000 processor line, code-named Naples, announced today at a “g Read more…

By John Russell

Quantum Bits: D-Wave and VW; Google Quantum Lab; IBM Expands Access

March 21, 2017

For a technology that’s usually characterized as far off and in a distant galaxy, quantum computing has been steadily picking up steam. Just how close real-wo Read more…

By John Russell

Trump Budget Targets NIH, DOE, and EPA; No Mention of NSF

March 16, 2017

President Trump’s proposed U.S. fiscal 2018 budget issued today sharply cuts science spending while bolstering military spending as he promised during the cam Read more…

By John Russell

HPC Compiler Company PathScale Seeks Life Raft

March 23, 2017

HPCwire has learned that HPC compiler company PathScale has fallen on difficult times and is asking the community for help or actively seeking a buyer for its a Read more…

By Tiffany Trader

Google Pulls Back the Covers on Its First Machine Learning Chip

April 6, 2017

This week Google released a report detailing the design and performance characteristics of the Tensor Processing Unit (TPU), its custom ASIC for the inference Read more…

By Tiffany Trader

CPU-based Visualization Positions for Exascale Supercomputing

March 16, 2017

In this contributed perspective piece, Intel’s Jim Jeffers makes the case that CPU-based visualization is now widely adopted and as such is no longer a contrarian view, but is rather an exascale requirement. Read more…

By Jim Jeffers, Principal Engineer and Engineering Leader, Intel

Nvidia Responds to Google TPU Benchmarking

April 10, 2017

Nvidia highlights strengths of its newest GPU silicon in response to Google's report on the performance and energy advantages of its custom tensor processor. Read more…

By Tiffany Trader

Nvidia’s Mammoth Volta GPU Aims High for AI, HPC

May 10, 2017

At Nvidia's GPU Technology Conference (GTC17) in San Jose, Calif., this morning, CEO Jensen Huang announced the company's much-anticipated Volta architecture a Read more…

By Tiffany Trader

Facebook Open Sources Caffe2; Nvidia, Intel Rush to Optimize

April 18, 2017

From its F8 developer conference in San Jose, Calif., today, Facebook announced Caffe2, a new open-source, cross-platform framework for deep learning. Caffe2 is the successor to Caffe, the deep learning framework developed by Berkeley AI Research and community contributors. Read more…

By Tiffany Trader

Leading Solution Providers

MIT Mathematician Spins Up 220,000-Core Google Compute Cluster

April 21, 2017

On Thursday, Google announced that MIT math professor and computational number theorist Andrew V. Sutherland had set a record for the largest Google Compute Engine (GCE) job. Sutherland ran the massive mathematics workload on 220,000 GCE cores using preemptible virtual machine instances. Read more…

By Tiffany Trader

Google Debuts TPU v2 and will Add to Google Cloud

May 25, 2017

Not long after stirring attention in the deep learning/AI community by revealing the details of its Tensor Processing Unit (TPU), Google last week announced the Read more…

By John Russell

US Supercomputing Leaders Tackle the China Question

March 15, 2017

Joint DOE-NSA report responds to the increased global pressures impacting the competitiveness of U.S. supercomputing. Read more…

By Tiffany Trader

Russian Researchers Claim First Quantum-Safe Blockchain

May 25, 2017

The Russian Quantum Center today announced it has overcome the threat of quantum cryptography by creating the first quantum-safe blockchain, securing cryptocurrencies like Bitcoin, along with classified government communications and other sensitive digital transfers. Read more…

By Doug Black

Groq This: New AI Chips to Give GPUs a Run for Deep Learning Money

April 24, 2017

CPUs and GPUs, move over. Thanks to recent revelations surrounding Google’s new Tensor Processing Unit (TPU), the computing world appears to be on the cusp of Read more…

By Alex Woodie

DOE Supercomputer Achieves Record 45-Qubit Quantum Simulation

April 13, 2017

In order to simulate larger and larger quantum systems and usher in an age of “quantum supremacy,” researchers are stretching the limits of today’s most advanced supercomputers. Read more…

By Tiffany Trader

Messina Update: The US Path to Exascale in 16 Slides

April 26, 2017

Paul Messina, director of the U.S. Exascale Computing Project, provided a wide-ranging review of ECP’s evolving plans last week at the HPC User Forum. Read more…

By John Russell

Six Exascale PathForward Vendors Selected; DoE Providing $258M

June 15, 2017

The much-anticipated PathForward awards for hardware R&D in support of the Exascale Computing Project were announced today with six vendors selected – AMD Read more…

By John Russell

  • arrow
  • Click Here for More Headlines
  • arrow
Share This