{"title":"统一请求分布的云服务的内存定价和量化","authors":"Anwar Alyatama","doi":"10.1109/ICIN.2018.8401636","DOIUrl":null,"url":null,"abstract":"Cloud computing services has emerged as the preferred technological option for future source of computing power across personal, enterprise and mobile computing applications. In this context, memory allocation has a significant bearing on the cloud based services. This paper reviews the problem of pricing and quantization when memory size requests follow a uniform distribution. We proposed a cloud computing service that advertises continuous (any) memory request size while actually supporting a small number of quantized memory sizes. We utilized simulation to investigate different factors that affect pricing and quantization such as worth model, memory size and granularity.","PeriodicalId":103076,"journal":{"name":"2018 21st Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN)","volume":"28 12","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Pricing and quantization of memory for cloud services with uniform request distribution\",\"authors\":\"Anwar Alyatama\",\"doi\":\"10.1109/ICIN.2018.8401636\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud computing services has emerged as the preferred technological option for future source of computing power across personal, enterprise and mobile computing applications. In this context, memory allocation has a significant bearing on the cloud based services. This paper reviews the problem of pricing and quantization when memory size requests follow a uniform distribution. We proposed a cloud computing service that advertises continuous (any) memory request size while actually supporting a small number of quantized memory sizes. We utilized simulation to investigate different factors that affect pricing and quantization such as worth model, memory size and granularity.\",\"PeriodicalId\":103076,\"journal\":{\"name\":\"2018 21st Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN)\",\"volume\":\"28 12\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 21st Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIN.2018.8401636\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 21st Conference on Innovation in Clouds, Internet and Networks and Workshops (ICIN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIN.2018.8401636","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Pricing and quantization of memory for cloud services with uniform request distribution
Cloud computing services has emerged as the preferred technological option for future source of computing power across personal, enterprise and mobile computing applications. In this context, memory allocation has a significant bearing on the cloud based services. This paper reviews the problem of pricing and quantization when memory size requests follow a uniform distribution. We proposed a cloud computing service that advertises continuous (any) memory request size while actually supporting a small number of quantized memory sizes. We utilized simulation to investigate different factors that affect pricing and quantization such as worth model, memory size and granularity.