Quantifying the properties of SRPT scheduling

11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003. Pub Date : 2003-10-27 DOI:10.1109/MASCOT.2003.1240650

Mingwei Gong, C. Williamson

{"title":"Quantifying the properties of SRPT scheduling","authors":"Mingwei Gong, C. Williamson","doi":"10.1109/MASCOT.2003.1240650","DOIUrl":null,"url":null,"abstract":"This paper uses a probe-based sampling approach to study the behavioural properties of Web server scheduling strategies, such as processor sharing (PS) and shortest remaining processing time (SRPT). The approach is general purpose, in that it can be used to estimate the mean and variance of the job response time, for arbitrary arrival processes, service time distributions, and scheduling policies. In the paper, we apply the approach to trace-driven simulation of Web server scheduling to compare and contrast the PS and SRPT scheduling policies. We identify two types of unfairness, called endogenous and exogenous unfairness. We quantify each, focusing on the mean and variance of slowdown, conditioned on job size, for a range of system loads. Finally, we confirm recent theoretical results regarding the asymptotic convergence of scheduling policies with respect to slowdown, and illustrate typical performance results for a practical range of job sizes from an empirical Web server workload.","PeriodicalId":344411,"journal":{"name":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASCOT.2003.1240650","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 24

Abstract

This paper uses a probe-based sampling approach to study the behavioural properties of Web server scheduling strategies, such as processor sharing (PS) and shortest remaining processing time (SRPT). The approach is general purpose, in that it can be used to estimate the mean and variance of the job response time, for arbitrary arrival processes, service time distributions, and scheduling policies. In the paper, we apply the approach to trace-driven simulation of Web server scheduling to compare and contrast the PS and SRPT scheduling policies. We identify two types of unfairness, called endogenous and exogenous unfairness. We quantify each, focusing on the mean and variance of slowdown, conditioned on job size, for a range of system loads. Finally, we confirm recent theoretical results regarding the asymptotic convergence of scheduling policies with respect to slowdown, and illustrate typical performance results for a practical range of job sizes from an empirical Web server workload.

查看原文本刊更多论文

量化SRPT调度的属性

本文采用基于探针的抽样方法，研究了处理器共享(PS)和最短剩余处理时间(SRPT)等Web服务器调度策略的行为特性。该方法是通用的，因为它可用于估计任意到达流程、服务时间分布和调度策略的作业响应时间的均值和方差。本文将该方法应用于Web服务器调度的跟踪驱动仿真，对PS和SRPT调度策略进行了比较和对比。我们确定了两种不公平，即内生不公平和外生不公平。我们对每一个都进行了量化，重点关注在系统负载范围内，以作业大小为条件的减速的平均值和方差。最后，我们确认了最近关于调度策略在减速方面的渐近收敛的理论结果，并举例说明了来自经验Web服务器工作负载的实际作业大小范围的典型性能结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

11th IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems, 2003. MASCOTS 2003.

自引率

0.00%

发文量