摘要
提出了一种最短作业优先的分组调度算法,用于减少交互式网络应用的平均响应时间. 新的分组调度算法将最短作业优先准则在一定程度上应用于分组交换网络中. 分析与模拟显示,该算法明显地减少了网络上信息检索的平均响应时间. 算法对交互式WWW应用的执行效率有较好的实用价值.
The response time is one of the most important performance measurements for information retrieval on networks. A shortest-job-first packet scheduling algorithm to reduce the average response time of interactive network applications is proposed in the paper. The analysis and simulation show that the proposed scheduling algorithm significantly reduces the average response time and has important practical value to improve the performance of interactive applications on WWW.
出处
《上海理工大学学报》
CAS
北大核心
2003年第4期355-360,共6页
Journal of University of Shanghai For Science and Technology
基金
上海市高校科技发展基金资助项目(01F10)
关键词
网络响应时间
分组调度
最短作业
优先队列
network response time
packet scheduling
shortest-job-first scheduling
priority queues
