Scheduling real-time transactions: a performance evaluation
ACM Transactions on Database Systems (TODS)
Distributed and Parallel Databases - Special issue: Research topics in distributed and parallel databases
Mobile wireless computing: challenges in data management
Communications of the ACM
Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Scheduling data broadcast in asymmetric communication environments
Wireless Networks
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Complexity of finite-horizon Markov decision process problems
Journal of the ACM (JACM)
RETINA: a real-time traffic navigation system
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Data on Air: Organization and Access
IEEE Transactions on Knowledge and Data Engineering
Pinwheel Scheduling for Fault-Tolerant Broadcast Disks in Real-time Database Systems
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
AIDA-based real-time fault-tolerant broadcast disks
RTAS '96 Proceedings of the 2nd IEEE Real-Time Technology and Applications Symposium (RTAS '96)
Broadcast on Demand: Efficient and Timely Dissemination of Data in Mobile Environments
RTAS '97 Proceedings of the 3rd IEEE Real-Time Technology and Applications Symposium (RTAS '97)
Broadcast Scheduling for Information Distribution
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A Pull-Based Broadcast Algorithm that Considers Timing Constraints
ICPPW '04 Proceedings of the 2004 International Conference on Parallel Processing Workshops
Time-Critical On-Demand Data Broadcast: Algorithms, Analysis, and Performance Evaluation
IEEE Transactions on Parallel and Distributed Systems
Scheduling pull-based broadcast with timing constraints
Scheduling pull-based broadcast with timing constraints
Scheduling on-demand data broadcast in mixed-type request environments
Computer Networks: The International Journal of Computer and Telecommunications Networking
Loss ratio of the EDF scheduling policy with early discarding technique
Information Processing Letters
| Hi-index | 0.00 |
In a distributed system, broadcasting is an efficient way to dispense data in certain highly dynamic environments. While there are several well-known on-line broadcast scheduling strategies that minimize wait time, there has been little research that considers on-demand broadcasting with timing constraints. One application which could benefit from a strategy for on-demand broadcast with timing constraints is a real-time database system. Scheduling strategies are needed in real-time databases that identify which data item to broadcast next in order to minimize missed deadlines. The scheduling decisions required in a real-time broadcast system allow the system to be modeled as a Markov Decision Process (MDP). In this paper, we analyze the MDP model and determine that finding an optimal solution is a hard problem in PSPACE. We propose a scheduling approach, called Aggregated Critical Requests (ACR), which is based on the MDP formulation and present two algorithms based on this approach. ACR is designed for timely delivery of data to clients in order to maximize the reward by minimizing the deadlines missed. Results from trace-driven experiments indicate the ACR approach provides a flexible strategy that can outperform existing strategies under a variety of factors.