抢占后重新开始(SOAP)协议

IF 1.3 4区 数学 Q3 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS
Jayaram Sethuraman
{"title":"抢占后重新开始(SOAP)协议","authors":"Jayaram Sethuraman","doi":"10.1002/asmb.2902","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Consider a job that normally requires <span></span><math>\n <mrow>\n <mi>a</mi>\n </mrow></math> units of time to complete. A higher authority comes and interrupts the service. The inter-arrival times of the interrupts are <span></span><math>\n <mrow>\n <msub>\n <mrow>\n <mi>X</mi>\n </mrow>\n <mrow>\n <mn>1</mn>\n </mrow>\n </msub>\n <mo>,</mo>\n <msub>\n <mrow>\n <mi>X</mi>\n </mrow>\n <mrow>\n <mn>2</mn>\n </mrow>\n </msub>\n <mo>,</mo>\n <mi>⋯</mi>\n </mrow></math>, which are the actual available service times to work on the job. Thus, if the first available service time <span></span><math>\n <mrow>\n <msub>\n <mrow>\n <mi>X</mi>\n </mrow>\n <mrow>\n <mn>1</mn>\n </mrow>\n </msub>\n </mrow></math> is larger than <span></span><math>\n <mrow>\n <mi>a</mi>\n </mrow></math>, the job gets completed, and the remaining service time <span></span><math>\n <mrow>\n <msub>\n <mrow>\n <mi>X</mi>\n </mrow>\n <mrow>\n <mn>1</mn>\n </mrow>\n </msub>\n <mo>−</mo>\n <mi>a</mi>\n </mrow></math> is the first available service time for the next job. If not, the previous service is lost and service on the job starts from scratch using <span></span><math>\n <mrow>\n <msub>\n <mrow>\n <mi>X</mi>\n </mrow>\n <mrow>\n <mn>2</mn>\n </mrow>\n </msub>\n </mrow></math> the next available service time. As before, if <span></span><math>\n <mrow>\n <msub>\n <mrow>\n <mi>X</mi>\n </mrow>\n <mrow>\n <mn>2</mn>\n </mrow>\n </msub>\n <mo>≥</mo>\n <mi>a</mi>\n </mrow></math>, the job gets completed and the remaining service time <span></span><math>\n <mrow>\n <msub>\n <mrow>\n <mi>X</mi>\n </mrow>\n <mrow>\n <mn>2</mn>\n </mrow>\n </msub>\n <mo>−</mo>\n <mi>a</mi>\n </mrow></math> is the first available service time for the next job. If not, the service is lost, and <span></span><math>\n <mrow>\n <msub>\n <mrow>\n <mi>X</mi>\n </mrow>\n <mrow>\n <mn>3</mn>\n </mrow>\n </msub>\n </mrow></math> is the available service time for the job. And so on. Let <span></span><math>\n <mrow>\n <msub>\n <mrow>\n <mi>T</mi>\n </mrow>\n <mrow>\n <mi>a</mi>\n </mrow>\n </msub>\n </mrow></math> be the time to complete the job. This is called the start over after pre-empt (SOAP) protocol. An example of such interrupts is power outages. After a power outage interrupt the partial service on a job running on a computer is lost and service on the job has to start again. We study properties of <span></span><math>\n <mrow>\n <msub>\n <mrow>\n <mi>T</mi>\n </mrow>\n <mrow>\n <mi>a</mi>\n </mrow>\n </msub>\n </mrow></math> and <span></span><math>\n <mrow>\n <msub>\n <mrow>\n <mi>T</mi>\n </mrow>\n <mrow>\n <mi>a</mi>\n <mo>,</mo>\n <mi>b</mi>\n </mrow>\n </msub>\n </mrow></math>, the time to complete two jobs normally requiring times <span></span><math>\n <mrow>\n <mi>a</mi>\n <mo>,</mo>\n <mi>b</mi>\n </mrow></math>, and give some guidance whether <span></span><math>\n <mrow>\n <mi>E</mi>\n <mo>(</mo>\n <msub>\n <mrow>\n <mi>T</mi>\n </mrow>\n <mrow>\n <mi>a</mi>\n <mo>,</mo>\n <mi>b</mi>\n </mrow>\n </msub>\n <mo>)</mo>\n <mo>≤</mo>\n <mi>E</mi>\n <mo>(</mo>\n <msub>\n <mrow>\n <mi>T</mi>\n </mrow>\n <mrow>\n <mi>b</mi>\n <mo>,</mo>\n <mi>a</mi>\n </mrow>\n </msub>\n <mo>)</mo>\n </mrow></math> when <span></span><math>\n <mrow>\n <mi>a</mi>\n <mo>&lt;</mo>\n <mi>b</mi>\n </mrow></math>. We obtain the asymptotic distribution of a stochastic process based on <span></span><math>\n <mrow>\n <msub>\n <mrow>\n <mi>T</mi>\n </mrow>\n <mrow>\n <mi>a</mi>\n </mrow>\n </msub>\n </mrow></math> which has interesting independent increments of a new type. My frustrations standing in a queue in India, where a supervisor interrupts and the service on my job has to start again, were my inspiration for the protocol named here as SOAP. A careful referee pointed out that the SOAP protocol is not new in the queues literature. It goes by the name RESTART and has variants called RESUME and REPLACE.</p>\n </div>","PeriodicalId":55495,"journal":{"name":"Applied Stochastic Models in Business and Industry","volume":"41 3","pages":""},"PeriodicalIF":1.3000,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Start Over After Pre-Empt (SOAP) Protocol\",\"authors\":\"Jayaram Sethuraman\",\"doi\":\"10.1002/asmb.2902\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n <p>Consider a job that normally requires <span></span><math>\\n <mrow>\\n <mi>a</mi>\\n </mrow></math> units of time to complete. A higher authority comes and interrupts the service. The inter-arrival times of the interrupts are <span></span><math>\\n <mrow>\\n <msub>\\n <mrow>\\n <mi>X</mi>\\n </mrow>\\n <mrow>\\n <mn>1</mn>\\n </mrow>\\n </msub>\\n <mo>,</mo>\\n <msub>\\n <mrow>\\n <mi>X</mi>\\n </mrow>\\n <mrow>\\n <mn>2</mn>\\n </mrow>\\n </msub>\\n <mo>,</mo>\\n <mi>⋯</mi>\\n </mrow></math>, which are the actual available service times to work on the job. Thus, if the first available service time <span></span><math>\\n <mrow>\\n <msub>\\n <mrow>\\n <mi>X</mi>\\n </mrow>\\n <mrow>\\n <mn>1</mn>\\n </mrow>\\n </msub>\\n </mrow></math> is larger than <span></span><math>\\n <mrow>\\n <mi>a</mi>\\n </mrow></math>, the job gets completed, and the remaining service time <span></span><math>\\n <mrow>\\n <msub>\\n <mrow>\\n <mi>X</mi>\\n </mrow>\\n <mrow>\\n <mn>1</mn>\\n </mrow>\\n </msub>\\n <mo>−</mo>\\n <mi>a</mi>\\n </mrow></math> is the first available service time for the next job. If not, the previous service is lost and service on the job starts from scratch using <span></span><math>\\n <mrow>\\n <msub>\\n <mrow>\\n <mi>X</mi>\\n </mrow>\\n <mrow>\\n <mn>2</mn>\\n </mrow>\\n </msub>\\n </mrow></math> the next available service time. As before, if <span></span><math>\\n <mrow>\\n <msub>\\n <mrow>\\n <mi>X</mi>\\n </mrow>\\n <mrow>\\n <mn>2</mn>\\n </mrow>\\n </msub>\\n <mo>≥</mo>\\n <mi>a</mi>\\n </mrow></math>, the job gets completed and the remaining service time <span></span><math>\\n <mrow>\\n <msub>\\n <mrow>\\n <mi>X</mi>\\n </mrow>\\n <mrow>\\n <mn>2</mn>\\n </mrow>\\n </msub>\\n <mo>−</mo>\\n <mi>a</mi>\\n </mrow></math> is the first available service time for the next job. If not, the service is lost, and <span></span><math>\\n <mrow>\\n <msub>\\n <mrow>\\n <mi>X</mi>\\n </mrow>\\n <mrow>\\n <mn>3</mn>\\n </mrow>\\n </msub>\\n </mrow></math> is the available service time for the job. And so on. Let <span></span><math>\\n <mrow>\\n <msub>\\n <mrow>\\n <mi>T</mi>\\n </mrow>\\n <mrow>\\n <mi>a</mi>\\n </mrow>\\n </msub>\\n </mrow></math> be the time to complete the job. This is called the start over after pre-empt (SOAP) protocol. An example of such interrupts is power outages. After a power outage interrupt the partial service on a job running on a computer is lost and service on the job has to start again. We study properties of <span></span><math>\\n <mrow>\\n <msub>\\n <mrow>\\n <mi>T</mi>\\n </mrow>\\n <mrow>\\n <mi>a</mi>\\n </mrow>\\n </msub>\\n </mrow></math> and <span></span><math>\\n <mrow>\\n <msub>\\n <mrow>\\n <mi>T</mi>\\n </mrow>\\n <mrow>\\n <mi>a</mi>\\n <mo>,</mo>\\n <mi>b</mi>\\n </mrow>\\n </msub>\\n </mrow></math>, the time to complete two jobs normally requiring times <span></span><math>\\n <mrow>\\n <mi>a</mi>\\n <mo>,</mo>\\n <mi>b</mi>\\n </mrow></math>, and give some guidance whether <span></span><math>\\n <mrow>\\n <mi>E</mi>\\n <mo>(</mo>\\n <msub>\\n <mrow>\\n <mi>T</mi>\\n </mrow>\\n <mrow>\\n <mi>a</mi>\\n <mo>,</mo>\\n <mi>b</mi>\\n </mrow>\\n </msub>\\n <mo>)</mo>\\n <mo>≤</mo>\\n <mi>E</mi>\\n <mo>(</mo>\\n <msub>\\n <mrow>\\n <mi>T</mi>\\n </mrow>\\n <mrow>\\n <mi>b</mi>\\n <mo>,</mo>\\n <mi>a</mi>\\n </mrow>\\n </msub>\\n <mo>)</mo>\\n </mrow></math> when <span></span><math>\\n <mrow>\\n <mi>a</mi>\\n <mo>&lt;</mo>\\n <mi>b</mi>\\n </mrow></math>. We obtain the asymptotic distribution of a stochastic process based on <span></span><math>\\n <mrow>\\n <msub>\\n <mrow>\\n <mi>T</mi>\\n </mrow>\\n <mrow>\\n <mi>a</mi>\\n </mrow>\\n </msub>\\n </mrow></math> which has interesting independent increments of a new type. My frustrations standing in a queue in India, where a supervisor interrupts and the service on my job has to start again, were my inspiration for the protocol named here as SOAP. A careful referee pointed out that the SOAP protocol is not new in the queues literature. It goes by the name RESTART and has variants called RESUME and REPLACE.</p>\\n </div>\",\"PeriodicalId\":55495,\"journal\":{\"name\":\"Applied Stochastic Models in Business and Industry\",\"volume\":\"41 3\",\"pages\":\"\"},\"PeriodicalIF\":1.3000,\"publicationDate\":\"2024-11-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Applied Stochastic Models in Business and Industry\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/asmb.2902\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Stochastic Models in Business and Industry","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/asmb.2902","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

摘要

考虑一个通常需要一个单位时间才能完成的工作。更高的权限来中断服务。中断的间隔到达时间为x1, x2,⋯⋯,这是工作中实际可用的服务时间。因此,如果第一个可用服务时间x1大于a,则作业完成;剩余服务时间x1−a为下一个作业的第一个可用服务时间。否则,前一个服务将丢失,作业上的服务将使用下一个可用的服务时间x2从头开始。如前所述,如果x2≥a,任务完成,剩余服务时间x2−a为下一个任务的第一个可用服务时间。否则,服务丢失,x3为该作业的可用服务时间。等等......。让它成为完成工作的时间。这被称为抢占后重新开始(SOAP)协议。这种中断的一个例子是停电。停电中断后,在计算机上运行的作业上的部分服务丢失,作业上的服务必须重新启动。我们研究了ta和ttab的性质,完成两项通常需要的工作的时间乘以a, b,并给出一些指导是否E (T) a,当a <时,b)≤E (T b, a);b .我们得到了一类新的具有有趣独立增量的随机过程的渐近分布。在印度排队时,当一个主管打断我的工作,我的服务不得不重新开始时,我感到很沮丧,这是我对这里称为SOAP的协议的灵感来源。一位细心的推荐人指出,SOAP协议在队列文献中并不新鲜。它的名称是RESTART,还有RESUME和REPLACE的变体。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Start Over After Pre-Empt (SOAP) Protocol

Consider a job that normally requires a units of time to complete. A higher authority comes and interrupts the service. The inter-arrival times of the interrupts are X 1 , X 2 , , which are the actual available service times to work on the job. Thus, if the first available service time X 1 is larger than a , the job gets completed, and the remaining service time X 1 a is the first available service time for the next job. If not, the previous service is lost and service on the job starts from scratch using X 2 the next available service time. As before, if X 2 a , the job gets completed and the remaining service time X 2 a is the first available service time for the next job. If not, the service is lost, and X 3 is the available service time for the job. And so on. Let T a be the time to complete the job. This is called the start over after pre-empt (SOAP) protocol. An example of such interrupts is power outages. After a power outage interrupt the partial service on a job running on a computer is lost and service on the job has to start again. We study properties of T a and T a , b , the time to complete two jobs normally requiring times a , b , and give some guidance whether E ( T a , b ) E ( T b , a ) when a < b . We obtain the asymptotic distribution of a stochastic process based on T a which has interesting independent increments of a new type. My frustrations standing in a queue in India, where a supervisor interrupts and the service on my job has to start again, were my inspiration for the protocol named here as SOAP. A careful referee pointed out that the SOAP protocol is not new in the queues literature. It goes by the name RESTART and has variants called RESUME and REPLACE.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.70
自引率
0.00%
发文量
67
审稿时长
>12 weeks
期刊介绍: ASMBI - Applied Stochastic Models in Business and Industry (formerly Applied Stochastic Models and Data Analysis) was first published in 1985, publishing contributions in the interface between stochastic modelling, data analysis and their applications in business, finance, insurance, management and production. In 2007 ASMBI became the official journal of the International Society for Business and Industrial Statistics (www.isbis.org). The main objective is to publish papers, both technical and practical, presenting new results which solve real-life problems or have great potential in doing so. Mathematical rigour, innovative stochastic modelling and sound applications are the key ingredients of papers to be published, after a very selective review process. The journal is very open to new ideas, like Data Science and Big Data stemming from problems in business and industry or uncertainty quantification in engineering, as well as more traditional ones, like reliability, quality control, design of experiments, managerial processes, supply chains and inventories, insurance, econometrics, financial modelling (provided the papers are related to real problems). The journal is interested also in papers addressing the effects of business and industrial decisions on the environment, healthcare, social life. State-of-the art computational methods are very welcome as well, when combined with sound applications and innovative models.
×
引用
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学术官方微信