Parallel Reed/Solomon Coding on Multicore Processors

Peter Sobe

doi:10.1109/SNAPI.2010.16

Parallel Reed/Solomon Coding on Multicore Processors

Peter Sobe

Institute of Computer Engineering

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 language	English
Title of host publication	2010 International Workshop on Storage Network Architecture and Parallel I/Os
Number of pages	10
Publisher	IEEE
Publication date	26.10.2010
Pages	71-80
Article number	5571758
ISBN (Print)	978-1-4244-6810-2
ISBN (Electronic)	978-1-4244-6811-9
DOIs	https://doi.org/10.1109/SNAPI.2010.16
Publication status	Published - 26.10.2010
Event	2010 6th International Workshop on Storage Network Architecture and Parallel I/Os - Incline Village, United States Duration: 03.05.2010 → 03.05.2010 Conference number: 82040

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1109/SNAPI.2010.16

Cite this

@inproceedings{aba91b29f900431eb5eab499360bcc13,

title = "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.",

author = "Peter Sobe",

year = "2010",

month = oct,

day = "26",

doi = "10.1109/SNAPI.2010.16",

language = "English",

isbn = "978-1-4244-6810-2",

series = "IEEE Proceedings",

publisher = "IEEE",

pages = "71--80",

booktitle = "2010 International Workshop on Storage Network Architecture and Parallel I/Os",

note = "2010 6th International Workshop on Storage Network Architecture and Parallel I/Os , SNAPI 2010 ; Conference date: 03-05-2010 Through 03-05-2010",

}

TY - GEN

T1 - Parallel Reed/Solomon Coding on Multicore Processors

AU - Sobe, Peter

N1 - Conference code: 82040

PY - 2010/10/26

Y1 - 2010/10/26

N2 - 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.

AB - 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.

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-77958101388&origin=inward&txGid=0da30b8ac8072cfd175bd1bfb310b1fb

U2 - 10.1109/SNAPI.2010.16

DO - 10.1109/SNAPI.2010.16

M3 - Conference contribution

SN - 978-1-4244-6810-2

T3 - IEEE Proceedings

SP - 71

EP - 80

BT - 2010 International Workshop on Storage Network Architecture and Parallel I/Os

PB - IEEE

T2 - 2010 6th International Workshop on Storage Network Architecture and Parallel I/Os

Y2 - 3 May 2010 through 3 May 2010

ER -

Parallel Reed/Solomon Coding on Multicore Processors

Abstract

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this