OVERVIEW OF METHODS FOR ORGANIZING DATA STORAGE SYSTEMS BASED ON CODES WITH A SIMPLE PARITY CHECK WITH OFFSETS
The task of developing optimal data storage systems (DSS) requires finding a compromise between the indicators of storage reliability (determined by the correcting ability of the code), redundancy (determined by the speed of the code), and the complexity of the implementation of coding algorithms.At the same time, it should be taken into account that all computing systems and data storage devices have a wide range of limitations: the availability of computing resources, communication channels between system components, the width of the read/write channel of end storage devices.Leveling the influence of the above limitations requires the development of more complex code structures that allow reconstruction of the contents of damaged data storage devices in a short time, while ensuring a small amount of load on the remaining data storage devices.The article discusses two methods of organizing data within a data storage system, and also provides an overview of a comprehensive solution based on them.The proposed solution allows you to organize an interleaved array of data storage devices aimed at providing highly reliable storage with a reduced volume of data recovery traffic.