NDLI: P-Code: a new RAID-6 code with optimal properties

Please wait, while we are loading the content...

A european perspective on supercomputing

The roadrunner project and the importance of energy efficiency on the road to exascale computing

Computing outside the box

Implementation of a wide-angle lens distortion correction algorithm on the cell broadband engine

Zero-content augmented caches

OhHelp: a scalable domain-decomposing dynamic load balancing for particle-in-cell simulations

Fast memory snapshot for concurrent programmingwithout synchronization

Parametric multi-level tiling of imperfectly nested loops

Efficient high performance collective communication for the cell blade

Fast and scalable list ranking on the GPU

Creating artificial global history to improve branch prediction accuracy

A graph based approach for MPI deadlock detection

FTL design exploration in reconfigurable high-performance SSD for server applications

Single-particle 3d reconstruction from cryo-electron microscopy images on GPU

Combining thread level speculation helper threads and runahead execution

EpiFast: a fast algorithm for large scale realistic epidemic simulations on distributed memory systems

Adagio: making DVS practical for complex HPC applications

MPI collective communications on the blue gene/p supercomputer: algorithms and optimizations

High-performance regular expression scanning on the Cell/B.E. processor

Dynamic cache clustering for chip multiprocessors

Pattern-based sparse matrix representation for memory-efficient SMVM kernels

QuakeTM: parallelizing a complex sequential application using transactional memory

Dynamic parallelization of single-threaded binary programs using speculative slicing

Practice of parallelizing network applications on multi-core architectures

Tuned and wildly asynchronous stencil kernels for hybrid CPU/GPU systems

Exploring pattern-aware routing in generalized fat tree networks

Maximizing MPI point-to-point communication performance on RDMA-enabled clusters with customized protocols

/scratch as a cache: rethinking HPC center scratch storage

How GPUs can outperform ASICs for fast LDPC decoding

Limited early value communication to improve performance of transactional memory

Using many-core hardware to correlate radio astronomy signals

A comprehensive power-performance model for NoCs with multi-flit channel buffers

TransMetric: architecture independent workload characterization for transactional memory benchmarks

Computer generation of fast fourier transforms for the cell broadband engine

Less reused filter: improving l2 cache performance via filtering less reused lines

Dynamic topology aware load balancing algorithms for molecular dynamics applications

Refereeing conflicts in hardware transactional memory

Synchronization optimizations for efficient execution on multi-cores

Towards 100 gbit/s ethernet: multicore-based parallel communication protocol design

Performance modeling and automatic ghost zone optimization for iterative stencil loops on GPUs

Understanding the interconnection network of SpiNNaker

MPI-aware compiler optimizations for improving communication-computation overlap

P-Code: a new RAID-6 code with optimal properties

A translation system for enabling data mining applications on GPUs

A parallel levenberg-marquardt algorithm

Rate-based QoS techniques for cache/memory in CMP platforms

Cancellation of loads that return zero using zero-value caches

DBDB: optimizing DMATransfer for the cell be architecture

Divide-and-conquer: a bubble replacement for low level caches

Chunking parallel loops in the presence of synchronization

Virtualization polling engine (VPE): using dedicated CPU cores to accelerate I/O virtualization

Evaluating high performance communication: a power perspective

R-ADMAD: high reliability provision for large-scale de-duplication archival storage systems

Auto-vectorization through code generation for stream processing applications

Subdomain communication to increase scalability in large-scale scientific applications

Access map pattern matching for data cache prefetch

Prediction-based power estimation and scheduling for CMPs

Design of a novel SIMD architecture by fusing operations and registers

Thrifty interconnection network for HPC systems

Performance modeling for DFT algorithms in FFTW

PARSEC: hardware profiling of emerging workloads for CMP design

Approximate kernel matrix computation on GPUs forlarge scale learning applications

Dynamic task set partitioning based on balancing memory requirements to reduce power consumption

High-performance CUDA kernel execution on FPGAs

Load balancing using work-stealing for pipeline parallelism in emerging applications

Prefetch optimizations on large-scale applications via parameter value prediction

Designing multi-socket systems using silicon photonics

An infrastructure for scalable and portable parallel programs for computational chemistry

P-Code: a new RAID-6 code with optimal properties

Content Provider	ACM Digital Library
Author	Tian, Lei Jiang, Hong Jin, Chao Feng, Dan
Abstract	RAID-6 significantly outperforms the other RAID levels in disk-failure tolerance due to its ability to tolerate arbitrary two concurrent disk failures in a disk array. The underlying parity array codes have a significant impact on RAID-6's performance. In this paper, we propose a new XOR-based RAID-6 code, called the Partition Code (P-Code). P-Code is a very simple and flexible vertical code, making it easy to understand and implement. It works on a group of (prime-1) or (prime) disks, and its coding scheme is based on an equal partition of a specified two-integer-tuple set. P-Code has the following properties: (1) it is a Maximum-Distance-Separable (MDS) code, with optimal storage efficiency; (2) it has optimal construction and reconstruction computational complexity; (3) it has optimal update complexity (i.e., the number of parity blocks affected by a single data-block update is minimal). These optimal properties of P-Code are proven mathematically in this paper. While X-Code is provably optimal and RDP is proven optimal in computational complexity and storage efficiency, the latter in its current form is not optimal in update complexity. We propose a row-parity placement strategy for RDP to help it attain optimal update complexity. P-Code complements the other two optimal RAID-6 codes, X-code and the tweaked RDP, to provide a near-full set of optimal RAID-6 configurations of typical disk-array size (e.g., 4-20 disks). That is, for any prime in a typical array size range, P-code can be deployed for (prime-1) disks optimally, while X-code (or P-Code) and the tweaked RDP can be respectively deployed for (prime) and (prime+1) disks optimally. Moreover, P-code's potentially beneficial properties such as the flexible association between the blocks and their labels may find useful applications in distributed environments.
Starting Page	360
Ending Page	369
Page Count	10
File Format	PDF
ISBN	9781605584980
DOI	10.1145/1542275.1542326
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2009-06-08
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Update complexity Raid-6 Partition code Storage efficiency Computational complexity
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in