- 1、本文档共26页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Caching and scheduling for broadcast disk systems
Caching and Scheduling for Broadcast Disk SystemsVincenzo Liberatore1Institute for Advanced Computer Studies
1UMIACS, A. V. Williams Building, University of Maryland, College Park, MD 20742. E-mail:vliberatore@. URL: /users/liberato/.
AbstractUnicast connections lead to performance and scalability problems when a large client population attemptsto access the same data. Broadcast push and broadcast disk technology address the problem by broadcastingdata items from a server to a large number of clients. Broadcast disk performance depends mainly on cachingstrategies at the client site and on how the broadcast is scheduled at the server site. An on-line broadcastdisk paging strategy makes caching decisions without knowing access probabilities. In this paper, we subjecton-line paging algorithms to extensive empirical investigation. The Gray algorithm [25] always outperformedother on-line strategies on both synthetic and Web traces. Moreover, caching limited the skewness neededfrom a broadcast schedule, and led to favor ecient caching algorithms over rened scheduling strategieswhen the cache was not small. Prior to this paper, no work had empirically investigated on-line pagingalgorithms and their relation with server scheduling.
1 IntroductionThe demand of network data services has been growing exponentially during the past few years. Moreand more often, increased workloads cannot be satised by current technology. In particular, when clientsrequested several million connections to a hot Web site during peak periods (e.g. Deep Blue chess match,Olympic games), servers were overmatched by the heavy workload. The problem was that point-to-point(unicast) connections satised each request individually, and server performance did not scale with thenumber of requests. In general, the point-to-point paradigm poses a scalability problem that is exacerbatedby the exponential and sustained growth of data service demand. In this scenario, broadcast push promises toaddress the issu
您可能关注的文档
- B156HTN03 2(LVDS).pdf
- Ayada Maldives 阿雅达 马尔代夫.pdf
- B3-U4_1版大字版.ppt
- AZ_PR光刻胶的数据资料.pdf
- B3FS-1002P;B3FS-1000P;B3FS-1052;B3FS-1050;B3FS-1010P;中文规格书,Datasheet资料.pdf
- B3SL-1002P;B3SL-1022P;中文规格书,Datasheet资料.pdf
- B5U4 period 3 learning about the language(完整免费).ppt
- B3942 data sheet(revise)MOS管规格书.pdf
- b4 U 4 Warming up & Reading.ppt
- B3SN-3012P;B3SN-3112P;B3SN-3012;中文规格书,Datasheet资料.pdf
最近下载
- 陕西中医药大学学位英语考试真题.pdf VIP
- 第5单元—解决问题(减法) (2).ppt
- 上海传芯半导体掩模基版研发与产业化项目环评报告表 (1).pdf
- 2024年学校辅导员少先队知识竞赛备考题库.docx VIP
- 高鸿业《西方经济学(微观部分)》(第6版)课后习题附带答案详解(完整版).pdf
- 丰田雷凌说明书.docx VIP
- 《物联网在生活中的应用》教学设计.docx VIP
- 炼油设备知识分解.ppt
- 鲁科版(五四学制)(三起)英语五年级上册Unit2 Lesson3 Wang Hong is worried 课件.pptx
- 2024年度学校辅导员少先队知识竞赛备考题库(含答案).docx VIP
文档评论(0)