An approximation to the response time for shortest queue routing
SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
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
Achieving Class-Based QoS for Transactional Workloads
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Admission control for statistical QoS: theory and practice
IEEE Network: The Magazine of Global Internetworking
Web server support for tiered services
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Request Processing Systems should exhibit predictable behavior by guaranteeing Quality-of-Service parameters. One of the important requirements of predictability is that requests should have maximum acceptable response time thresholds, denoted as deadlines in this paper. In order to provide QoS, the system should try to guarantee these deadlines. This way, it is desirable to use a load-balancing algorithm that tries to both maximize the throughput and minimize the missed deadlines. Assuming that all requests durations are known a priori, this paper shows, with the help of a simulator, how the control over the big tasks plays a crucial role in the pursuit of the objective. Finally, this paper presents a derived form of the traditional Least-Work-Remaining algorithm, named Task Assignment by Isolating Big Tasks, that proved to be a better alternative in such scenarios.