非对称调度减少大流量响应时间

Q4 Computer Science
Runhan Xie, Ziv Scully
{"title":"非对称调度减少大流量响应时间","authors":"Runhan Xie, Ziv Scully","doi":"10.1145/3626570.3626584","DOIUrl":null,"url":null,"abstract":"Reducing mean response time has always been a desirable goal in queueing systems. If job sizes (a.k.a. service times) are known to the scheduler, the policy that minimizes mean response time of a single-server queue is SRPT (Shortest Remaining Processing Time). This is true even for queues that are part of a larger system, such as immediate-dispatch systems where jobs are sent to one of multiple single-server queues upon arrival.","PeriodicalId":35745,"journal":{"name":"Performance Evaluation Review","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Reducing Heavy-Traffic Response Time with Asymmetric Dispatching\",\"authors\":\"Runhan Xie, Ziv Scully\",\"doi\":\"10.1145/3626570.3626584\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Reducing mean response time has always been a desirable goal in queueing systems. If job sizes (a.k.a. service times) are known to the scheduler, the policy that minimizes mean response time of a single-server queue is SRPT (Shortest Remaining Processing Time). This is true even for queues that are part of a larger system, such as immediate-dispatch systems where jobs are sent to one of multiple single-server queues upon arrival.\",\"PeriodicalId\":35745,\"journal\":{\"name\":\"Performance Evaluation Review\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-09-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Performance Evaluation Review\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3626570.3626584\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Performance Evaluation Review","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3626570.3626584","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 0

摘要

减少平均响应时间一直是排队系统的理想目标。如果调度器知道作业大小(也就是服务时间),则最小化单服务器队列平均响应时间的策略是SRPT(最短剩余处理时间)。即使对于作为大型系统一部分的队列也是如此,例如即时调度系统,其中作业在到达时被发送到多个单服务器队列中的一个。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Reducing Heavy-Traffic Response Time with Asymmetric Dispatching
Reducing mean response time has always been a desirable goal in queueing systems. If job sizes (a.k.a. service times) are known to the scheduler, the policy that minimizes mean response time of a single-server queue is SRPT (Shortest Remaining Processing Time). This is true even for queues that are part of a larger system, such as immediate-dispatch systems where jobs are sent to one of multiple single-server queues upon arrival.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Performance Evaluation Review
Performance Evaluation Review Computer Science-Computer Networks and Communications
CiteScore
1.00
自引率
0.00%
发文量
193
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信