A DYNAMIC OBJECT ALLOCATION AND REPLICATION ALGORITHM FOR DISTRIBUTED SYSTEMS WITH CENTRALIZED CONTROL

W.J. Lin and B. Veeravalli

References

  1. [1] A.S. Tanenbaum & M. Van Steen, Distributed systems: Prin-ciples and paradigms (New Jersey: Prentice-Hall, 2002).
  2. [2] P. Verissimo & L. Rodrigues, Distributed systems for systemarchitects (Norwell, MA: Kluwer, 2001).
  3. [3] R.H. Thomas, A majority consensus approach to concurrencycontrol for multiple copy databases, ACM Trans. on DatabaseSystems, 4(2), 1979, 180–209. doi:10.1145/320071.320076
  4. [4] D.D. Sleator & R.E. Tarjan, Amortized efficiency of list updateand paging rules, Comm. ACM, 28(2), 1985, 202–208. doi:10.1145/2786.2793
  5. [5] S. Albers, Competitive online algorithms, BRICS LS-96-2,LSSN 1395–2048, 1996.
  6. [6] B. Awerbuch, Y. Bartal, & A. Fiat, Competitive distributed fileallocation, Proc. 25th ACM Symp. on Theory of Computing,1993, San Diego, CA, 164–173.33 doi:10.1145/167088.167142
  7. [7] O. Wolfson & S. Jajodia, Distributed algorithms for dynamicreplication of data, 11th ACM Symp. on Principles of DatabaseSystems, 1992, San Diego, CA, 149–163.
  8. [8] O. Wolfson & S. Jajodia, An algorithm for dynamic datadistribution, Proc. 2nd Workshop Management of ReplicatedData, 1992, Monterey, CA, 62–65. doi:10.1109/MRD.1992.242616
  9. [9] Y. Huang & O. Wolfson, A competitive dynamic data replica-tion algorithm, Proc. 9th Int. Conf. Data Eng., 1993, Vienna,Austria, 310–317.
  10. [10] O. Wolfson & Y. Huang, Competitive analysis of caching indistributed databases, IEEE Trans. on Parallel and DistributedSystems, 9(4), 1998, 391–409. doi:10.1109/71.667899
  11. [11] K. Ranganathan, A. Iamnitchi, & I. Foster, Improving dataavailability through dynamic model-driven replication in largepeer-to-peer communities, Global and Peer-to-Peer Computingon Large Scale Distributed Systems Workshop, 2002, Berlin,Germany.
  12. [12] G.F. Johnson & A.K. Singh, Stable and fault-tolerant objectallocation, Proc. 19th ACM Symp. on Principles of DistributedComputing, 2000, Portland, Oregon, 259–268.
  13. [13] E. Pitoura & G. Samaras, Data management for mobile com-puting (Norwell, MA: Kluwer, 1998).
  14. [14] A. Prasad Sistla, O. Wolfson, & Y. Huang, Minimization ofcommunication cost through caching in mobile environments,IEEE Trans. on Parallel and Distributed Systems, 9(4), 1998,378–390. doi:10.1109/71.667898
  15. [15] W. Lin & B. Veeravalli, An adaptive object management al-gorithm for distributed databases in mobile computing en-vironments, Proc. of IEEE 4th Int. Conf. on Information,Communications & Signal Processing, Singapore, 2003.
  16. [16] B.R. Badrinath, A. Acharya, & T. Imielinski, Designing dis-tributed algorithms for mobile computing networks, Proc. 2ndWorkshop on the Management of Replicated Data, 1994, NewJersey.
  17. [17] D. Barbara & H. Garcia-Molina, Replicated data manage-ment in mobile environments: Anything new under the sun?Applications in Parallel and Distributed Computing, 1994.
  18. [18] D.P. Reed, Implementing atomic actions on decentralized data,ACM Trans. on Computer Systems, 1(1), 1983, 3–23. doi:10.1145/357353.357355
  19. [19] P. Bernstein, V. Hadzilacos, & N. Goodman, Concurrency con-trol and recovery in database systems (Reading, MA: AddisonWesley, 1987).
  20. [20] O. Wolfson, S. Jajodia, & Huang, An adaptive data replicationalgorithm, ACM Trans. on Database Systems, 22(2), 1997,255–314. doi:10.1145/249978.249982
  21. [21] P.K. Reddy & S. Bhalla, Asynchronous operations in dis-tributed concurrency control, IEEE Trans. on Knowledge andData Engineering, 15(3), 2003, 721–733. doi:10.1109/TKDE.2003.1198401

Important Links:

Go Back