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 inho-rnogeneous 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.
ASJC Scopus subject areas
- Hardware and Architecture
- Computer Networks and Communications