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
Internet Web servers: workload characterization and performance implications
IEEE/ACM Transactions on Networking (TON)
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Heavy-tailed probability distributions in the World Wide Web
A practical guide to heavy tails
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
Analytic modeling of load balancing policies for tasks with heavy-tailed distributions
Proceedings of the 2nd international workshop on Software and performance
Task assignment with unknown duration
Journal of the ACM (JACM)
EQUILOAD: a load balancing policy for clustered web servers
Performance Evaluation
A packet-size aware adaptive routing algorithm for parallel transmission server systems
Journal of Parallel and Distributed Computing
Optimal state-free, size-aware dispatching for heterogeneous M/G/-type systems
Performance Evaluation - Performance 2005
Why segregating short jobs from long jobs under high variability is not always a win
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Optimal allocation of servers and processing time in a load balancing system
Computers and Operations Research
To balance or unbalance load in size-interval task allocation
Probability in the Engineering and Informational Sciences
| Hi-index | 0.00 |
We analyze the performance of Size Interval task assignment (SITA) scheduling policies, for multi-host scheduling in a non-preemptive environment. We establish a general duality theory for the performance analysis of SITA policies. When the job size distribution is Bounded Pareto and the range of job sizes tends to infinity. we determine asymptotically optimal cutoff values and provide asymptotic formulas for average waiting time and slowdown. In the case of inhomogeneous hosts we determine their optimal ordering. We also consider TAGS policies. We provide a general formula that describes their load handling capabilities and examine their performance when the job size distribution is Bounded Pareto.