Tree-based replica location scheme (TRLS) for data grids
暂无分享,去创建一个
[1] Lawrence W. Dowdy,et al. Comparative Models of the File Assignment Problem , 1982, CSUR.
[2] Dorit S. Hochbaum,et al. Database Location in Computer Networks , 1980, JACM.
[3] Sushil Jajodia,et al. An adaptive data replication algorithm , 1997, TODS.
[4] Hans Dobbertin. Cryptanalysis of MD4 , 1996, FSE.
[5] David P. Anderson,et al. Public Computing: Reconnecting People to Science , 2003 .
[6] Stephen A. Cook,et al. The optimal location of replicas in a network using a READ-ONE-WRITE-ALL policy , 2002, Distributed Computing.
[7] Ian Foster,et al. A quality of service architecture that combines resource reservation and application adaptation , 2000, 2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400).
[8] Javier Jaén Martínez,et al. Data Management in an International Data Grid Project , 2000, GRID.
[9] Konstantinos Kalpakis,et al. Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs , 2001, IEEE Trans. Parallel Distributed Syst..
[10] Feng Li,et al. A Dynamic Grid Authorization Mechanism with Result Feedback , 2004, GCC.
[11] Kavitha Ranganathan,et al. Improving Data Availability through Dynamic Model-Driven Replication in Large Peer-to-Peer Communities , 2002, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02).
[12] Ouri Wolfson,et al. The multicast policy and its relationship to replicated data placement , 1991, TODS.
[13] Joos Vandewalle,et al. Fast Hashing on the Pentium , 1996, CRYPTO.
[14] Hector Garcia-Molina,et al. The Future of Data Replication , 1986, Symposium on Reliability in Distributed Software and Database Systems.
[15] Marvin A. Sirbu,et al. Distributed network storage service with quality-of-service guarantees , 2000, J. Netw. Comput. Appl..