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
Broadcast disks: data management for asymmetric communication environments
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
General perfectly periodic scheduling
Proceedings of the twenty-first annual symposium on Principles of distributed computing
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)
Pushing dependent data in clients-providers-servers systems
Wireless Networks
Laxity Threshold Polling for Scalable Real-Time/Non-Real-Time Scheduling
ICCNMC '03 Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing
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 on-demand broadcast with timing constraints
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
In many on-demand broadcast environments, there can be a mix of requests, in which some of the requests have real-time constraints, while other requests have no time constraints associated with them. We refer to such environments as mixed-type environments. Existing strategies for on-demand data in broadcast systems typically only consider how to minimize the wait time of the requests, while scheduling strategies for real-time requests typically only consider how to minimize the number of deadlines missed. How to satisfy both of these constraints is a challenging problem whose solution can benefit many applications. In this paper, we present an on-demand broadcast cost model that is more general than existing broadcast cost models because it considers both response time and number of deadlines missed. An analysis of the system is presented as a Markov decision process to ascertain the feasibility of an optimal policy. We propose two scheduling strategies for mixed-type broadcast systems that are based on our cost model: maximum paid cost first and maximum value gained first. The simulation results show that both of our strategies always achieve the best result, when compared to existing broadcast strategies, for varying request arrival rates, real-time to non-real-time request ratios, missed deadline weight values, wait-time bounds on the non-real-time requests, and varying broadcast rates.