Amortized efficiency of list update and paging rules
Communications of the ACM
Concurrency control in advanced database applications
ACM Computing Surveys (CSUR)
Distributed algorithms for dynamic replication of data
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A two-phase approach to predictably scheduling real-time transactions
Performance of concurrency control mechanisms in centralized database systems
An adaptive data replication algorithm
ACM Transactions on Database Systems (TODS)
Competitive Analysis of Caching in Distributed Databases
IEEE Transactions on Parallel and Distributed Systems
Stable and fault-tolerant object allocation
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Optimal Placement of Replicas in Trees with Read, Write, and Storage Costs
IEEE Transactions on Parallel and Distributed Systems
Database Systems Handbook
Scalable Parallel Computing: Technology,Architecture,Programming
Scalable Parallel Computing: Technology,Architecture,Programming
Distributed Systems for System Architects
Distributed Systems for System Architects
Distributed Systems: Principles and Paradigms
Distributed Systems: Principles and Paradigms
IEEE Transactions on Computers
Page Migration with Limited Local Memory Capacity
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
An Adaptive Object Allocation and Replication Algorithm in Distributed Databases
ICDCSW '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
A Replication Strategy for Distributed Real-Time Object-Oriented Databases
ISORC '02 Proceedings of the Fifth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
| Hi-index | 0.00 |
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.