Exploiting process lifetime distributions for dynamic load balancing
ACM Transactions on Computer Systems (TOCS)
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
On choosing a task assignment policy for a distributed server system
Journal of Parallel and Distributed Computing - Special issue on software support for distributed computing
An admission control scheme for predictable server response time for web accesses
Proceedings of the 10th international conference on World Wide Web
Task assignment with unknown duration
Journal of the ACM (JACM)
The state of the art in locally distributed Web-server systems
ACM Computing Surveys (CSUR)
Session-Based Admission Control: A Mechanism for Peak Load Management of Commercial Web Sites
IEEE Transactions on Computers
A Load Balancing Framework for Adaptive and Asynchronous Applications
IEEE Transactions on Parallel and Distributed Systems
A method for transparent admission control and request scheduling in e-commerce web sites
Proceedings of the 13th international conference on World Wide Web
A Comparative Evaluation of Transparent Scaling Techniques for Dynamic Content Servers
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Achieving Class-Based QoS for Transactional Workloads
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Optimizing Performance of Web Service Providers
AINA '07 Proceedings of the 21st International Conference on Advanced Networking and Applications
Extensible Contract Broker for Performance Differentiation
SEAMS '07 Proceedings of the 2007 International Workshop on Software Engineering for Adaptive and Self-Managing Systems
Fair Load-Balancing on Parallel Systems for QoS
ICPP '07 Proceedings of the 2007 International Conference on Parallel Processing
Hi-index | 0.00 |
In order to avoid stress conditions in information systems, the use of a simple admission control (SAC) mechanism is widely adopted by systems' administrators. Most of the SAC approaches limit the number of concurrent work, redirecting to a waiting FCFS queue all transactions that exceed that number. The introduction of such a policy can be very useful when the most important metric for the system is the total throughput. But such a simple AC approach may not be sufficient when transactions have deadlines to meet, since in stressed scenarios a transaction may spend a lot of time only waiting for execution. This paper presents 2 enhancements that help keeping the number of transactions executed within the deadline near to the throughput. The enhancements are DiffServ, in which short transactions have priority, and a 2-Phase Admission Control (2PAC) mechanism, which tries to avoid the previousmentioned problem by limiting the queue size dynamically using informations provided by a feedback control. It also introduces the QoS-Broker --- a tool which implements both SAC and 2PAC --- and uses it to compare their performances when submitted to the TPC-C benchmark. Our results show that both total throughput and throughput within deadline increase when the 2 enhancements are used, although it becomes clear that 2PAC has a much bigger impact on performance than DiffServ.