基于完成时间的任务分配方案与性能分析  

A Task Allocation and Performance Analysis Based on Finished Time

作　　者：曲绍刚[1] 杨广文[1] 林闯[1] 史树明[1] 

机构地区：[1]清华大学计算机科学与技术系,北京100084

出　　处：《计算机研究与发展》2005年第8期1397-1402,共6页Journal of Computer Research and Development

基　　金：国家自然科学基金项目(60373004;60373005;90412006);国家"八六三"高技术研究发展计划基金项目(2004AA1Z2300);国家"九七三"重点基础研究发展规划基金项目(2004CB318000)

摘　　要：网络计算的迅速发展对网络资源的调度问题提出了新的挑战,用户对于服务质量的要求越来越高.大规模的复杂系统,如何能在现有硬件资源的基础之上提高整个系统的响应时间和吞吐量是当前的一个研究热点.基于完成时间的任务分配方案(SEF,OSEF),以多服务器多队列模型为基础,通过这种方案与现有方案之间的性能比较和分析,利用随机Petri网进行模拟实验,结果表明这种方案是高效可行的.Seemingly overnight, the Internet has gone from an academic experiment to a worldwide information matrix. How to improve the response time and throughput of a complicated network system is a challenging problem. Discussed and provided in this paper are quest dispatching and selecting schemes for Web server clusters and the stochastic high level Petrinet models for those schemes. A novel method is proposed to allocate Web request tasks according to the minimums finished time and an analysis is also presented based on the experiments using Petri net. Experiment results show that the method is feasible and effective.

关 键 词：请求选择 请求分配 随机PETRI网 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]