Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
