Abstract
A real-time distributed database system (RTDDBS) must maintain the consistency constraints of objects and must also guarantee the time constraints imposed by each request arriving at the system. Such a time constraint of a request is usually defined as a deadline period, which means that the request must be serviced on or before its time constraint. Servicing these requests may incur I/O costs, control-message transferring costs or data-message transferring costs. As a result, in our work, we first present a mathematical model that considers all these costs. Using this cost model, our objective is to service all the requests on or before their respective deadline periods and minimize the total servicing cost. To this end, from theoretical standpoint, we design a dynamic object replication algorithm, referred to as Real-time distributed dynamic Window Mechanism (RDDWM), that adapts to the random patterns of read-write requests. Using competitive analysis, from practical perspective, we study the performance of RDDWM algorithm under two different extreme conditions, i.e., when the deadline period of each request is sufficiently long and when the deadline period of each request is very short. Several illustrative examples are provided for the ease of understanding.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D.D. Sleator and R.E. Tarjan, “Amortized efficiency of list update and paging rules,” Comm. of the ACM, vol. 28, no. 2, pp. 202–208, 1985.
Naser S. Barghouti and Gail E. Kaiser, “Concurrency control in advanced database applications,” ACM Computing Surveys, vol. 23, no. 3, pp. 269–317, September 1991.
O. Wolfson and S. Jajodia, “Distributed algorithms for dynamic replication of data,” 11th ACM Symposium on Principles of Database Systems(PODS), pp. 149–163, June 1992.
O. Wolfson and S. Jajodia, “An algorithm for dynamic data distribution,” Proc. Second Workshop Management of Replicated Data(WMRD-II), 1992, pp. 62–65,
P.E. O’Neil and K. Ramamritham, and C. Pu, A two-phase approach to predictably scheduling real-time transactions, Performance of Concurrency Control Algorithms in Centralized Database Systems, V.Kumar, Prentice-Hall, Englewood Cliffs, NJ, 1995, pp. 494–522.
S. Albers and H. Koga, “Page migration with limited local memory capacity,” Workshop on Algorithms and Data Structures, 1995.
O. Wolfson, Shushil Jajodia, and Yixiu Huang, “An adaptive data replication algorithm,” ACM Transactions on Database Systems, vol. 22, no. 2, pp. 255–314, 1997.
Paul J. Fortier, Database Systems Handbook, McGraw-Hill Companies, Inc. 1997.
H. Xu, T. Furukawa, and Y. Shi, “Concurrency control based on order constraints in advanced database systems,” in Proc. of International Symposium on Cooperative Database Systems for Advanced Applications (CODAS), 1997, pp. 380–385.
O. Wolfson and Y. Huang, “Competitive analysis of caching in distributed databases,” IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 4, pp. 391–409, April 1998.
H. Attiya and J. Welch, “Distributed computing: fundamentals”, Simulations and Advanced Topics, McGraw-Hill Higher Education, 1998.
K. Hwang and Z. Xu, Scalable Parallel Computing-Technology, Architecture, Programming, McGraw-Hill Publishers, 2000.
T. Loukopoulos and I. Ahmad, “Static and adaptive data replication algorithms for fast information access in large distributed systems,” in Proc. of the 20th IEEE International Conference on Distributed Computing Systems, April 2000, pp. 385–392.
Gregory F. Johnson and Ambuj K. Singh, “Stable and fault-tolerant object allocation,” in Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, July 2000, pp. 259–268.
P.M. Melliar-Smith, L.E. Moser, V. Kalogeraki, and P. Narasimhan, “Realize: resource management for soft real-time distributed systems,” in Proceedings of the IEEE DARPA Information Survivability Conference and Exposition, January 2000, pp. 281–293.
P. Verissimo and L. Rodrigues, Distributed Systems for System Architects, Kluwer Academic Publishers: USA, 2001.
K. Kalpakis, K. Dasgupta, and O. Wolfson, “Optimal placement of replicas in trees with read, write, and storage costs,” IEEE Transaction on Parallel and Distributed Systems, vol. 12, no. 6, pp. 628–637, June 2001.
Andrew S. Tanenbaum and Maarten Van Steen, Distributed Systems: Principles and Paradigms, Prentice Hall, 2002.
K. Ranganathan, A. Iamnitchi, and I. Foster, “Improving data availability through dynamic model-driven replication in large peer-to-peer communities,” in Global and Peer-to-Peer Computing on Large Scale Distributed Systems Workshop, May 2002.
P. Peddi and L.C. DiPippo, “A replication strategy for distributed real-time object-oriented databases,” in Proceedings of the 5th IEEE International Symposium on Object-Oriented Real-Time Distributed Computing, 2002, pp. 129–136.
T. Hegazy and B. Ravindran, “Using application benefit for proactive resource allocation in asynchronous real-time distributed systems,” IEEE Transactions on Computers, vol.51, no.8, pp. 945–962, August 2002.
L. Wujuan and V. Bharadwaj, Object Management in Distributed Database Systems for Stationary and Mobile Computing Environments: A Competitive Approach, Kluwer Academic Publishers: USA, 2003.
L. Wujuan and V. Bharadwaj, “An adaptive object allocation and replication algorithm in distributed databases,” in Proceedings of the 23rd IEEE International Conference on Distributed Computing Systems Workshops, May 2003, pp. 132–137.
Author information
Authors and Affiliations
Corresponding author
Additional information
Recommended by: Ashfaq Khokhar
Rights and permissions
About this article
Cite this article
Wujuan, L., Veeravalli, B. An object replication algorithm for real-time distributed databases. Distrib Parallel Databases 19, 125–146 (2006). https://doi.org/10.1007/s10619-006-7477-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10619-006-7477-3