针对目前国内外大多数仓库系统调度研究只局限于某一局部问题(或某一子系统)而不能全面考虑整个系统运行状况的问题,在分析已有调度策略的基础上提出了各子系统的优化调度策略,并应用有色时间 Petri 网(CTPN)进行建模。基于对各子系统...针对目前国内外大多数仓库系统调度研究只局限于某一局部问题(或某一子系统)而不能全面考虑整个系统运行状况的问题,在分析已有调度策略的基础上提出了各子系统的优化调度策略,并应用有色时间 Petri 网(CTPN)进行建模。基于对各子系统的调度特点及其对整个自动化仓库系统的影响的分析,给出了使各子系统能够协调运行的系统整体上的优化调度策略,并采用仿真工具 CPN-Tools 对调度策略进行了仿真,仿真结果表明,所提出的调度策略可以提高系统的运行效率,可作为研究自动化仓库系统的调度问题的参考手段。展开更多
There are two kinds of dispatching policies in content-aware web server cluster; segregation dispatching policy and mixture dispatching policy. Traditional scheduling algorithms all adopt mixture dispatching policy. T...There are two kinds of dispatching policies in content-aware web server cluster; segregation dispatching policy and mixture dispatching policy. Traditional scheduling algorithms all adopt mixture dispatching policy. They do not consider that dynamic requests＇ serving has the tendency to slow down static requests＇ serving, and that different requests have different resource demands, so they can not use duster＇s resource reasonably and effectively. This paper uses stochastic reward net （SRN） to model and analyze the two dispatching policies, and uses stochastic Petri net package （SPNP） to simulate the models. The simulation results and practical tests both show that segregation dispatching policy is better than mixture dispatching policy. The principle of segregation dispatching policy can guide us to design efficient scheduling algorithm.展开更多
文摘针对目前国内外大多数仓库系统调度研究只局限于某一局部问题(或某一子系统)而不能全面考虑整个系统运行状况的问题,在分析已有调度策略的基础上提出了各子系统的优化调度策略,并应用有色时间 Petri 网(CTPN)进行建模。基于对各子系统的调度特点及其对整个自动化仓库系统的影响的分析,给出了使各子系统能够协调运行的系统整体上的优化调度策略,并采用仿真工具 CPN-Tools 对调度策略进行了仿真,仿真结果表明,所提出的调度策略可以提高系统的运行效率,可作为研究自动化仓库系统的调度问题的参考手段。
基金Supported by the National Natural Science Foun-dation of China (90204008) the Science Council of Wuhan(20001001004)
文摘There are two kinds of dispatching policies in content-aware web server cluster; segregation dispatching policy and mixture dispatching policy. Traditional scheduling algorithms all adopt mixture dispatching policy. They do not consider that dynamic requests＇ serving has the tendency to slow down static requests＇ serving, and that different requests have different resource demands, so they can not use duster＇s resource reasonably and effectively. This paper uses stochastic reward net （SRN） to model and analyze the two dispatching policies, and uses stochastic Petri net package （SPNP） to simulate the models. The simulation results and practical tests both show that segregation dispatching policy is better than mixture dispatching policy. The principle of segregation dispatching policy can guide us to design efficient scheduling algorithm.
