在广播环境中调度web请求

WWW Alt. '04 Pub Date : 2004-05-19 DOI:10.1145/1013367.1013435

Jianliang Xu, Wang-Chien Lee, Jiangchuan Liu

{"title":"在广播环境中调度web请求","authors":"Jianliang Xu, Wang-Chien Lee, Jiangchuan Liu","doi":"10.1145/1013367.1013435","DOIUrl":null,"url":null,"abstract":"On-demand broadcast has been supported in the Internet to enhance system scalability. Unfortunately, most of existing on-demand scheduling algorithms did not consider the time constraints associated with web requests. This paper proposes a novel scheduling algorithm, called Slack Inverse Number of requests (SIN), that takes into account the urgency and productivity of serving pending requests. Trace-driven experiments demonstrate that SIN significantly out performs existing algorithms over a wide range of workloads.","PeriodicalId":409891,"journal":{"name":"WWW Alt. '04","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Scheduling web requests in broadcast environments\",\"authors\":\"Jianliang Xu, Wang-Chien Lee, Jiangchuan Liu\",\"doi\":\"10.1145/1013367.1013435\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"On-demand broadcast has been supported in the Internet to enhance system scalability. Unfortunately, most of existing on-demand scheduling algorithms did not consider the time constraints associated with web requests. This paper proposes a novel scheduling algorithm, called Slack Inverse Number of requests (SIN), that takes into account the urgency and productivity of serving pending requests. Trace-driven experiments demonstrate that SIN significantly out performs existing algorithms over a wide range of workloads.\",\"PeriodicalId\":409891,\"journal\":{\"name\":\"WWW Alt. '04\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"WWW Alt. '04\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1013367.1013435\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"WWW Alt. '04","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1013367.1013435","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

互联网支持点播广播，以增强系统的可扩展性。不幸的是，大多数现有的按需调度算法没有考虑与web请求相关的时间限制。本文提出了一种新的调度算法，称为Slack逆请求数(SIN)，该算法考虑了处理待处理请求的紧迫性和生产率。跟踪驱动的实验表明，在广泛的工作负载范围内，SIN的性能明显优于现有算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Scheduling web requests in broadcast environments

On-demand broadcast has been supported in the Internet to enhance system scalability. Unfortunately, most of existing on-demand scheduling algorithms did not consider the time constraints associated with web requests. This paper proposes a novel scheduling algorithm, called Slack Inverse Number of requests (SIN), that takes into account the urgency and productivity of serving pending requests. Trace-driven experiments demonstrate that SIN significantly out performs existing algorithms over a wide range of workloads.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

WWW Alt. '04

自引率

0.00%

发文量