Efficient Mappings for Parity-Declustered Data Layouts

DOI10.1007/3-540-45071-8_27zbMATH Open1276.68131OpenAlexW4214748960MaRDI QIDQ3082933

Eric J. Schwabe, Ian M. Sutherland

Publication date: 18 March 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45071-8_27

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)

Related Items (1)

Optimizing large data transfers in parity-declustered data layouts

This page was built for publication: Efficient Mappings for Parity-Declustered Data Layouts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3082933)