post_parent): $temp_content = $post->post_content; $temp_content = explode("

",$temp_content); $temp_content = $temp_content[1]; $temp_content = explode("

",$temp_content); $temp_content = $temp_content[0]; $temp_content = strip_tags($temp_content); $temp_content = trim($temp_content); $authors = explode(",",$temp_content); ?> post_title));?>"> $value): ?> "> "> "> post_content); while ($parser->parse()) { if (($parser->iNodeName=="a")&&(substr_count($parser->iNodeAttributes['href'],".pdf")>0)): ?>

Organization of redundancy in distributed data storage systems

Ivanov D.G.

In paper the version of erasures codes for protecting against multiple failures in disk arrays for distributed networked storage is proposed. Developed erasures codes provide a codespecific means for reconstruction of erased data. Proposed version of linear erasures codes is optimized to reconstruct of information from two or more disks. The methodology we propose for both problems is completely general and can be applied to any erasure code, but is most suitable for XOR-based codes.


Full text (pdf)