Introduction to operations research, 4th ed.
Introduction to operations research, 4th ed.
Distributed and Parallel Databases - Special issue: Research topics in distributed and parallel databases
Improvement in feasibility testing for real-time tasks
Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Maintaining Temporal Consistency: Pessimistic vs. Optimistic Concurrency Control
IEEE Transactions on Knowledge and Data Engineering
Scheduling Transactions with Temporal Constraints: Exploiting Data Semantics
IEEE Transactions on Knowledge and Data Engineering
A QoS-Sensitive Approach for Timeliness and Freshness Guarantees in Real-Time Databases
ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
On task schedulability in real-time control systems
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
Task Period Selection and Schedulability in Real-Time Systems
RTSS '98 Proceedings of the 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
Dynamic on-demand updating of data in real-time database systems
Proceedings of the 2004 ACM symposium on Applied computing
Data Management in Real-Time Systems: a Case of On-Demand Updates in Vehicle Control Systems
RTAS '04 Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium
A Deferrable Scheduling Algorithm for Real-Time Transactions Maintaining Data Freshness
RTSS '05 Proceedings of the 26th IEEE International Real-Time Systems Symposium
Quality of Service Guarantee for Temporal Consistency of Real-Time Transactions
IEEE Transactions on Knowledge and Data Engineering
F-RT-ETM: toward analysis and formalizing real time transaction and data in real-time database
MEDI'11 Proceedings of the First international conference on Model and data engineering
Journal of Systems and Software
Maintaining data temporal consistency in distributed real-time systems
Real-Time Systems
| Hi-index | 0.00 |
A real-time object is one whose state may become invalid with the passage of time. A temporal validity interval is associated with the object state, and the real-time object is temporally consistent if its temporal validity interval has not expired. Clearly, the problem of maintaining temporal consistency of data is motivated by the need for a real-time system to track its environment correctly. Hence, sensor transactions must be able to execute periodically and also each instance of a transaction should perform the relevant data update before its deadline.Unfortunately, the period and deadline assignment problem for periodic sensor transactions has not received the attention that it deserves. An exception is the More-Less scheme, which uses the Deadline Monotonic (DM) algorithm for scheduling periodic sensor transactions. However, there is no work addressing this problem from the perspective of dynamic priority scheduling. In this paper, we examine the problem of temporal consistency maintenance using the Earliest Deadline First (EDF) algorithm in three steps:First, the problem is transformed to another problem with a sufficient (but not necessary) condition for feasibly assigning periods and deadlines. An optimal solution for the problem can be found in linear time, and the resulting processor utilization is characterized and compared to a traditional approach. Second, an algorithm to search for the optimal periods and deadlines is proposed. The problem can be solved for sensor transactions that require any arbitrary deadlines. However, the optimal algorithm does not scale well when the problem size increases. Hence, thirdly, we propose a heuristic search-based algorithm that is more efficient than the optimal algorithm and is capable of finding a solution if one exists.