Gittins策略在G/G/1和G/G/k下的性能，有和没有设置时间

Q4 Computer Science

Performance Evaluation Review Pub Date : 2023-09-28 DOI:10.1145/3626570.3626583

Yige Hong, Ziv Scully

{"title":"Gittins策略在G/G/1和G/G/k下的性能，有和没有设置时间","authors":"Yige Hong, Ziv Scully","doi":"10.1145/3626570.3626583","DOIUrl":null,"url":null,"abstract":"We consider the classic problem of preemptively scheduling jobs of unknown size (a.k.a. service time) in a queue to minimize mean number-in-system, or equivalently mean response time (a.k.a. sojourn time). We know how to solve this problem in an M/G/1, provided the job size distribution is known to the scheduler. In this case, the optimal policy is the Gittins policy (a.k.a. Gittins index policy) [1].","PeriodicalId":35745,"journal":{"name":"Performance Evaluation Review","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Performance of the Gittins Policy in the G/G/1 and G/G/k, With and Without Setup Times\",\"authors\":\"Yige Hong, Ziv Scully\",\"doi\":\"10.1145/3626570.3626583\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the classic problem of preemptively scheduling jobs of unknown size (a.k.a. service time) in a queue to minimize mean number-in-system, or equivalently mean response time (a.k.a. sojourn time). We know how to solve this problem in an M/G/1, provided the job size distribution is known to the scheduler. In this case, the optimal policy is the Gittins policy (a.k.a. Gittins index policy) [1].\",\"PeriodicalId\":35745,\"journal\":{\"name\":\"Performance Evaluation Review\",\"volume\":\"46 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.3626583\",\"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.3626583","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Computer Science","Score":null,"Total":0}

引用次数: 0

摘要

我们考虑了一个经典的问题，即在队列中抢占调度未知大小的作业(即服务时间)，以最小化平均系统数，或等效的平均响应时间(即逗留时间)。我们知道如何在M/G/1中解决这个问题，前提是调度程序知道作业大小的分布。在这种情况下，最优策略是Gittins策略(又称Gittins索引策略)[1]。

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

查看原文本刊更多论文

Performance of the Gittins Policy in the G/G/1 and G/G/k, With and Without Setup Times

We consider the classic problem of preemptively scheduling jobs of unknown size (a.k.a. service time) in a queue to minimize mean number-in-system, or equivalently mean response time (a.k.a. sojourn time). We know how to solve this problem in an M/G/1, provided the job size distribution is known to the scheduler. In this case, the optimal policy is the Gittins policy (a.k.a. Gittins index policy) [1].

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Performance Evaluation Review Computer Science-Computer Networks and Communications

CiteScore

1.00

自引率

0.00%

发文量

193