Ultra lightweight adaptation processes for scheduling servers in push-based systems

C. Liaskos, G. Papadimitriou
{"title":"Ultra lightweight adaptation processes for scheduling servers in push-based systems","authors":"C. Liaskos, G. Papadimitriou","doi":"10.1109/SCVT.2010.5720465","DOIUrl":null,"url":null,"abstract":"Waiting time-optimal scheduling of items for broadcasting in wireless environments requires knowledge of their corresponding access probabilities. Feedback mechanisms have been proposed, according to which the clients notify the server of their needs directly or indirectly. This feedback is then processed at the server, producing the items' access probability distribution function estimate. Based on the principle of maximum uncertainty, a novel, extremely lightweight adaptation scheme algorithm is proposed. Requiring trivial input, this algorithm is shown to estimate almost perfectly the real probability distribution, while alleviating synchronization issues of related approaches and minimizing the processing needs at the server side.","PeriodicalId":344975,"journal":{"name":"2010 17th IEEE Symposium on Communications and Vehicular Technology in the Benelux (SCVT2010)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 17th IEEE Symposium on Communications and Vehicular Technology in the Benelux (SCVT2010)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCVT.2010.5720465","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Waiting time-optimal scheduling of items for broadcasting in wireless environments requires knowledge of their corresponding access probabilities. Feedback mechanisms have been proposed, according to which the clients notify the server of their needs directly or indirectly. This feedback is then processed at the server, producing the items' access probability distribution function estimate. Based on the principle of maximum uncertainty, a novel, extremely lightweight adaptation scheme algorithm is proposed. Requiring trivial input, this algorithm is shown to estimate almost perfectly the real probability distribution, while alleviating synchronization issues of related approaches and minimizing the processing needs at the server side.
用于在基于推送的系统中调度服务器的超轻量级自适应过程
无线环境中广播项目的等待时间优化调度需要了解其相应的访问概率。已经提出了反馈机制,根据该机制,客户可以直接或间接地通知服务器他们的需求。然后,该反馈在服务器上进行处理,生成项目的访问概率分布函数估计。基于最大不确定性原理,提出了一种新颖的极轻量自适应方案算法。只需少量输入,该算法几乎可以完美地估计真实概率分布,同时减轻相关方法的同步问题,并最大限度地减少服务器端的处理需求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信