Distributed and Parallel Databases - Special issue: Research topics in distributed and parallel databases
Scheduling Jobs with Temporal Distance Constraints
SIAM Journal on Computing
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Maintaining Temporal Consistency: Pessimistic vs. Optimistic Concurrency Control
IEEE Transactions on Knowledge and Data Engineering
Scheduling transactions with temporal constraints: exploiting data semantics
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Similarity-based load adjustment for real-time data-intensive applications
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Deriving Deadlines and Periods for Real-Time Update Transactions
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Real-Time Primary-Backup (RTPB) Replication with Temporal Consistency Guarantees
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Real-Time Databases and Data Services
Real-Time Systems
Quality of Service Guarantee for Temporal Consistency of Real-Time Transactions
IEEE Transactions on Knowledge and Data Engineering
On new scheduling policy for the improvement of firm RTDBSs performances
Data & Knowledge Engineering
DESH: overhead reduction algorithms for deferrable scheduling
Real-Time Systems
Journal of Systems and Software
Maintaining data temporal consistency in distributed real-time systems
Real-Time Systems
Hi-index | 14.98 |
Typically, temporal validity of real-time data is maintained by periodic update transactions. In this paper, we examine the problem of period and deadline assignment for these update transactions such that 1) these transactions can be guaranteed to complete by their deadlines and 2) the imposed CPU workload is minimized. To this end, we propose a novel approach, named the More-Less approach. By applying this approach, updates occur with a period which is more than the period obtained through traditional approaches, but with a deadline which is less than the traditional period. We show that the More-Less approach is better than existing approaches in terms of schedulability and the imposed load. We examine the issue of determining the assignment order in which transactions must be considered for period and deadline assignment so that the resulting CPU workloads can be minimized. To this end, the More-Less approach is first examined in a restricted case where the Shortest Validity First (SVF) order is shown to be an optimal solution. We then relax some of the restrictions and show that SVF is an approximate solution which results in CPU workloads that are close to the optimal solution. Our analysis and experiments show that the More-Less approach is an effective design approach that can provide better schedulability and reduce update transaction CPU workload while guaranteeing data validity constraints.