Optimal data replica placements in linear bus networks
Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45) › 32_Refereed conference paper (with host publication) › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN |
| Pages | 129-134 |
| Publication status | Published - 2004 |
Conference
| Title | Proceedings on the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN |
|---|---|
| Place | China |
| City | Hong Kong |
| Period | 10 - 12 May 2004 |
Link(s)
Abstract
This paper discusses two optimal data replica placement problems in linear bus networks, one is to maximize data availability and the other to minimize data access cost. The optimal placements are constructed for these two problems under read-any/write-all and majority voting protocols, respectively. The obtained results show that these two problems have the same optimal solutions under read dominant, write dominant, and majority voting systems.
Citation Format(s)
Optimal data replica placements in linear bus networks. / Hsu, Frank; Hu, X. D.; Huang, H. J. et al.
Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN. 2004. p. 129-134.
Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN. 2004. p. 129-134.
Research output: Chapters, Conference Papers, Creative and Literary Works (RGC: 12, 32, 41, 45) › 32_Refereed conference paper (with host publication) › peer-review
