面向大数据处理的次指数计算服务分析

S. Zapechnikov, N. Miloslavskaya, A. Tolstoy
{"title":"面向大数据处理的次指数计算服务分析","authors":"S. Zapechnikov, N. Miloslavskaya, A. Tolstoy","doi":"10.1109/FICLOUD.2015.57","DOIUrl":null,"url":null,"abstract":"The paper presents two analytical models to study the performance and availability of queueing systems with the hypo exponential service time and finite queue. The analytical results obtained are verified using discrete-event simulation. A few numerical examples for varying number of service stages, service rates and arrival rates are given. The results presented in the paper can be used for analysis of MapReduce and multi-stage Big Data processing.","PeriodicalId":182204,"journal":{"name":"2015 3rd International Conference on Future Internet of Things and Cloud","volume":"66 5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Analysis of Hypoexponential Computing Services for Big Data Processing\",\"authors\":\"S. Zapechnikov, N. Miloslavskaya, A. Tolstoy\",\"doi\":\"10.1109/FICLOUD.2015.57\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper presents two analytical models to study the performance and availability of queueing systems with the hypo exponential service time and finite queue. The analytical results obtained are verified using discrete-event simulation. A few numerical examples for varying number of service stages, service rates and arrival rates are given. The results presented in the paper can be used for analysis of MapReduce and multi-stage Big Data processing.\",\"PeriodicalId\":182204,\"journal\":{\"name\":\"2015 3rd International Conference on Future Internet of Things and Cloud\",\"volume\":\"66 5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-08-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 3rd International Conference on Future Internet of Things and Cloud\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FICLOUD.2015.57\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 3rd International Conference on Future Internet of Things and Cloud","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FICLOUD.2015.57","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文提出了两个分析模型,用于研究服务时间为次指数且队列有限的排队系统的性能和可用性。用离散事件仿真对分析结果进行了验证。给出了不同服务阶段数、服务率和到达率的几个数值例子。本文的研究结果可用于MapReduce的分析和多阶段大数据处理。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Analysis of Hypoexponential Computing Services for Big Data Processing
The paper presents two analytical models to study the performance and availability of queueing systems with the hypo exponential service time and finite queue. The analytical results obtained are verified using discrete-event simulation. A few numerical examples for varying number of service stages, service rates and arrival rates are given. The results presented in the paper can be used for analysis of MapReduce and multi-stage Big Data processing.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信