基于IP-SAN的拟序备份调度算法的研究  

Research on Scheduling Algorithm of Quasi-ordering Backup Task Based on IP-SAN

作　　者：董谷音[1] 康慕宁[1] 孙展望[1] 

机构地区：[1]西北工业大学

出　　处：《微型电脑应用》2012年第2期13-16,69,共4页Microcomputer Applications

基　　金：国家863重大项目-海量存储系统关键技术(2009AA01A404)

摘　　要：随着企业信息爆炸性增长,海量信息存储成为目前存储行业研究的热点。先分析了传统的拟序备份AOE模型的缺陷和依赖该模型的调度算法的不足,然后针对网络状况不确定的因素,提出了一种改进的拟序备份AOV模型和调度算法。该调度算法依赖图的深度搜索与动态剪枝算法,能够根据任务的完成状况动态地调度,达到最大化地并发处理任务的目的。模拟仿真实验结果表明该调度算法能很好地弥补传统算法的不足。With the enterprise information increasing explosively, mass data storage has been a research hotspot of storage area. First, this paper analyzesthe traditional AOE model of quasi-ordering backup task and a scheduling algorithm dependent on it, Second, it proposes that a improved AOV model ofquasi-ordering backup task and a scheduling algorithm by consider the network conditions of uncertainty. This scheduling algorithm dependent on theDFS and pruning algorithm, It can be based on that task scheduler dynamically, to maximize the purpose of concurrent to process tasks. Simulationexperiment results show that the scheduling algorithm can be good enough to make up for the traditional algorithm

关 键 词：IP-SAN 拟序备份 剪枝 调度算法 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]