On the problem of increasing efficiency of Reed-Solomon-code-based algorithms for creating checkpoints for calculation applications
An algorithm for constructing checksums based on the Reed-Solomon code is proposed. It makes it possible to increase the efficiency of creating checkpoint files on local disk memory for parallel applications, as well as provide a series of other capabilities. The paper also corrects a number of erro...
Saved in:
| Published in | Programming and computer software Vol. 34; no. 1; pp. 54 - 57 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
Dordrecht
SP MAIK Nauka/Interperiodica
01.01.2008
Springer Nature B.V |
| Subjects | |
| Online Access | Get full text |
| ISSN | 0361-7688 1608-3261 |
| DOI | 10.1134/S0361768808010076 |
Cover
| Summary: | An algorithm for constructing checksums based on the Reed-Solomon code is proposed. It makes it possible to increase the efficiency of creating checkpoint files on local disk memory for parallel applications, as well as provide a series of other capabilities. The paper also corrects a number of errors committed by other researchers of this domain. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0361-7688 1608-3261 |
| DOI: | 10.1134/S0361768808010076 |