Scheduling real-time transactions: a performance evaluation
ACM Transactions on Database Systems (TODS)
Eliminating receive livelock in an interrupt-driven kernel
ACM Transactions on Computer Systems (TOCS)
An admission control scheme for predictable server response time for web accesses
Proceedings of the 10th international conference on World Wide Web
Session-Based Admission Control: A Mechanism for Peak Load Management of Commercial Web Sites
IEEE Transactions on Computers
Adaptive Load Control in Transaction Processing Systems
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
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
Qos-aware real-time data management
Qos-aware real-time data management
A method for transparent admission control and request scheduling in e-commerce web sites
Proceedings of the 13th international conference on World Wide Web
Managing Deadline Miss Ratio and Sensor Data Freshness in Real-Time Databases
IEEE Transactions on Knowledge and Data Engineering
How to Determine a Good Multi-Programming Level for External Scheduling
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Autonomic computing through analytic performance models
Autonomic computing through analytic performance models
Web server support for tiered services
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
One of the relevant Quality-of-Service (QoS) issues in web service provider infrastructures (Web-servers, web-services and backend database-servers) is how well they are able to handle congestion, while still meeting time-constraints for accepted transactions. There are many works proposing admission control mechanisms, but their focus is on throughput maximization under miss ratio constraints. These metrics are misleading -- at maximum service rate, throughput can only be improved by accepting small transactions while starving long ones. In this paper we investigate whether admission control based on time-constraints may be a more suitable solution, and analyze the hypothesis by means of simulation. We show that time-based control works well. These conclusions are a basis for our future work within the Adapt-DB project on: alternative time-bounding based control approaches; effective control of starving with best throughput; and especially on SLA-targets tracking and feedback control, all of them using timing control as a basis.