具有等待时间限制的多处理机系统的队列状态

V. Sahakyan, Artur Vardanyan
{"title":"具有等待时间限制的多处理机系统的队列状态","authors":"V. Sahakyan, Artur Vardanyan","doi":"10.1109/CSITechnol.2019.8895093","DOIUrl":null,"url":null,"abstract":"The queue state in multiprocessor computing systems is an actual problem for their use in the process of tasks scheduling. In this paper, a system of differential equations is obtained describing the probabilities of the system state at time t, which can be solved using numerical methods. However, the probabilities sought-for the system M|M|m|n with a constraint on the residence time can be obtained in terms of the Laplace- Stieltjes transform.","PeriodicalId":414834,"journal":{"name":"2019 Computer Science and Information Technologies (CSIT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"The Queue State for Multiprocessor System with Waiting Time Restriction\",\"authors\":\"V. Sahakyan, Artur Vardanyan\",\"doi\":\"10.1109/CSITechnol.2019.8895093\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The queue state in multiprocessor computing systems is an actual problem for their use in the process of tasks scheduling. In this paper, a system of differential equations is obtained describing the probabilities of the system state at time t, which can be solved using numerical methods. However, the probabilities sought-for the system M|M|m|n with a constraint on the residence time can be obtained in terms of the Laplace- Stieltjes transform.\",\"PeriodicalId\":414834,\"journal\":{\"name\":\"2019 Computer Science and Information Technologies (CSIT)\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 Computer Science and Information Technologies (CSIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSITechnol.2019.8895093\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Computer Science and Information Technologies (CSIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSITechnol.2019.8895093","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在多处理器计算系统中,队列状态是任务调度过程中的一个实际问题。本文得到了描述系统在时刻t的状态概率的微分方程组,该方程组可以用数值方法求解。然而,系统M|M| M| n在给定停留时间约束下的概率可以用Laplace- Stieltjes变换得到。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The Queue State for Multiprocessor System with Waiting Time Restriction
The queue state in multiprocessor computing systems is an actual problem for their use in the process of tasks scheduling. In this paper, a system of differential equations is obtained describing the probabilities of the system state at time t, which can be solved using numerical methods. However, the probabilities sought-for the system M|M|m|n with a constraint on the residence time can be obtained in terms of the Laplace- Stieltjes transform.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信