{"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><</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><</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}
Consider a job that normally requires units of time to complete. A higher authority comes and interrupts the service. The inter-arrival times of the interrupts are , which are the actual available service times to work on the job. Thus, if the first available service time is larger than , the job gets completed, and the remaining service time 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 the next available service time. As before, if , the job gets completed and the remaining service time is the first available service time for the next job. If not, the service is lost, and is the available service time for the job. And so on. Let 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 and , the time to complete two jobs normally requiring times , and give some guidance whether when . We obtain the asymptotic distribution of a stochastic process based on 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.
期刊介绍:
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.