Parallel Reed/Solomon Coding on Multicore Processors

Peter Sobe

doi:10.1109/SNAPI.2010.16

Parallel Reed/Solomon Coding on Multicore Processors

Peter Sobe

Institut für Technische Informatik

14 Zitate (Scopus)

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.

Originalsprache	Englisch
Titel	2010 International Workshop on Storage Network Architecture and Parallel I/Os
Seitenumfang	10
Herausgeber (Verlag)	IEEE
Erscheinungsdatum	26.10.2010
Seiten	71-80
Aufsatznummer	5571758
ISBN (Print)	978-1-4244-6810-2
ISBN (elektronisch)	978-1-4244-6811-9
DOIs	https://doi.org/10.1109/SNAPI.2010.16
Publikationsstatus	Veröffentlicht - 26.10.2010
Veranstaltung	2010 6th International Workshop on Storage Network Architecture and Parallel I/Os - Incline Village, USA / Vereinigte Staaten Dauer: 03.05.2010 → 03.05.2010 Konferenznummer: 82040

UN SDGs

Dieser Output leistet einen Beitrag zu folgendem(n) Ziel(en) für nachhaltige Entwicklung

SDG 9 – Industrie, Innovation und Infrastruktur

Dokumente

10.1109/SNAPI.2010.16

Weitere Links

https://www.scopus.com/pages/publications/77958101388

Zitieren

@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",

}

Sobe, P 2010, Parallel Reed/Solomon Coding on Multicore Processors. in 2010 International Workshop on Storage Network Architecture and Parallel I/Os., 5571758, IEEE Proceedings, IEEE, S. 71-80, 2010 6th International Workshop on Storage Network Architecture and Parallel I/Os , Incline Village, Nevada, USA / Vereinigte Staaten, 03.05.10. https://doi.org/10.1109/SNAPI.2010.16

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/pages/publications/77958101388

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

Dokumente

Weitere Links

Fingerprint

Zitieren