{"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}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
