Optimal data replica placements in linear bus networks

Author

Hsu, Frank ; Hu, X.-D. ; Huang, H.-J. ; Jia, X.-H.

Author_Institution

Dept. of Comput. & Inf. Sci., Fordham Univ., New York, NY, USA

fYear

2004

fDate

10-12 May 2004

Firstpage

129

Lastpage

134

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.

Keywords

data communication; multiprocessor interconnection networks; protocols; replicated databases; data access; data availability maximization; distributed systems; linear bus networks; majority voting protocol; optimal data replica placements; read dominant system; read-any/write-all protocol; write dominant system; Access protocols; Availability; Computer science; Cost function; Intelligent networks; Mathematics; Parallel architectures; Polynomials; Sufficient conditions; Voting;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Architectures, Algorithms and Networks, 2004. Proceedings. 7th International Symposium on

ISSN

1087-4089

Print_ISBN

0-7695-2135-5

Type

conf

DOI

10.1109/ISPAN.2004.1300470

Filename

1300470

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3013036