Optimal Data Replica Placements in Linear Bus Networks

Hong Kong, SAR, China May 10-May 12

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/ISPAN.2004.1300470

2004 International Symposium on Paral ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Frank Hsu Articles by X.-D. Hu Articles by H.-J. Huang Articles by X.-H. Jia

	ASCII Text	x
	Frank Hsu, X.-D. Hu, H.-J. Huang, X.-H. Jia, "Optimal Data Replica Placements in Linear Bus Networks," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 129, 2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04), 2004.

	BibTex	x
	@article{ 10.1109/ISPAN.2004.1300470, author = {Frank Hsu and X.-D. Hu and H.-J. Huang and X.-H. Jia}, title = {Optimal Data Replica Placements in Linear Bus Networks}, journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on}, volume = {0}, year = {2004}, issn = {1087-4089}, pages = {129}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.2004.1300470}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel Architectures, Algorithms, and Networks, International Symposium on TI - Optimal Data Replica Placements in Linear Bus Networks SN - 1087-4089 SP EP A1 - Frank Hsu, A1 - X.-D. Hu, A1 - H.-J. Huang, A1 - X.-H. Jia, PY - 2004 KW - null VL - 0 JA - Parallel Architectures, Algorithms, and Networks, International Symposium on ER -

Frank Hsu, Fordham University, New York, NY

X.-D. Hu, City University of Hong Kong, Klowoon

H.-J. Huang, City University of Hong Kong, Klowoon

X.-H. Jia, City University of Hong Kong, Klowoon

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:

Frank Hsu, X.-D. Hu, H.-J. Huang, X.-H. Jia, "Optimal Data Replica Placements in Linear Bus Networks," ispan, pp.129, 2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04), 2004

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.