Parallel Reed/Solomon Coding on Multicore Processors

Abstract

Cauchy Reed/Solomon is an XOR-based erasure-tolerant coding scheme, applied for reliable distributed storage, fault-tolerant memory and reconstruction of content from widely distributed data. The encoding and decoding is based on XOR operations and already well supported by microprocessors. On multicore processors, the coding procedures should also exploit parallelism to speed up coding. In this paper we derive coding procedures from code parameters (e.g. the number of tolerated failures) and propose their transformation into parallel coding schedules that are mapped on multicore processors. We (i) compare functionally decomposed coding procedures with data-parallel coding of different blocks, and (ii) specify the method to derive these schedules.

Original languageEnglish
Title of host publication 2010 International Workshop on Storage Network Architecture and Parallel I/Os
Number of pages10
PublisherIEEE
Publication date26.10.2010
Pages71-80
Article number5571758
ISBN (Print)978-1-4244-6810-2
ISBN (Electronic)978-1-4244-6811-9
DOIs
Publication statusPublished - 26.10.2010
Event2010 6th International Workshop on Storage Network Architecture and Parallel I/Os - Incline Village, United States
Duration: 03.05.201003.05.2010
Conference number: 82040

Fingerprint

Dive into the research topics of 'Parallel Reed/Solomon Coding on Multicore Processors'. Together they form a unique fingerprint.

Cite this