Repairing with Zero Skip Cost
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916237023379456 |
|---|---|
| author | Zhang, Wenqin Chee, Yeow Meng Dau, Son Hoang Etzion, Tuvi Kiah, Han Mao Luo, Yuan |
| author_facet | Zhang, Wenqin Chee, Yeow Meng Dau, Son Hoang Etzion, Tuvi Kiah, Han Mao Luo, Yuan |
| contents | To measure repair latency at helper nodes, we introduce a new metric called skip cost that quantifies the number of contiguous sections accessed on a disk. We provide explicit constructions of zigzag codes and fractional repetition codes that incur zero skip cost |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_03614 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Repairing with Zero Skip Cost Zhang, Wenqin Chee, Yeow Meng Dau, Son Hoang Etzion, Tuvi Kiah, Han Mao Luo, Yuan Information Theory To measure repair latency at helper nodes, we introduce a new metric called skip cost that quantifies the number of contiguous sections accessed on a disk. We provide explicit constructions of zigzag codes and fractional repetition codes that incur zero skip cost |
| title | Repairing with Zero Skip Cost |
| topic | Information Theory |
| url | https://arxiv.org/abs/2405.03614 |