期刊文献+

分布式视频信息存储网络的任务均衡分配

Task Distribution Balancing for Distributed Storage Networks of Video Information
下载PDF
导出
摘要 考虑将广义超级市场模型(Generalized Supermarket Model,GSM)应用于分布式视频信息存储网络的任务均衡分配。设:①分布式视频信息存储网络由在地理上分布的存储服务结点、存储负载均衡调度结点和客户结点组成;②视频信息存储任务的到达是一泊松过程,任务粒度为视频流文件;③存储任务的执行时间服从指数分布;④系统在初始时刻的存储任务有限;⑤与存储任务的执行时间相比,存储任务的调度时间不计。在概率意义下,深入讨论了基于广义超级市场模型的负载均衡调度与随机服务选择两种情况下的平均存储任务消耗时间,分析结果表明:在大规模分布式视频信息存储网络中,采用广义超级市场模型的存储任务均衡调度可显著提高系统的平均存储任务消耗时间性能。 The Generalized Supermarket Model(GSM) is used to the task distribution balancing for distributed stor- age networks of video information. Suppose that: ①a storage network of video information consists of certain dis- tributed storage service nodes,a storage load balance-scheduling node, and client nodes;②the arrivals of video infor- mation storage tasks can be regarded as a Poisson process,and the storage task granularity is of video stream file;③ the executing time for a storage task is exponentially distributed;④at the initial time,the number of storage tasks is finite;⑤compared with the executing time used for storage tasks,the scheduling time used for storage tasks is ne- glected. In the sense of probability,the mean time consumption of storage tasks in two cases,using Generalized Super- market Model based scheduling strategy and random service node choice based scheduling strategy,is analyzed in de- tail. The result shows that: for large-scale distributed storage networks of video information, the performance of mean time consumption for storage tasks can be increased evidently by using of the GSM-based load balance schedul- ing strategy.
出处 《计算机科学》 CSCD 北大核心 2005年第2期45-47,共3页 Computer Science
基金 国家自然科学基金(69973017)
关键词 存储网络 分布式 负载均衡 任务 调度 视频信息 流文件 超级市场 客户 存储服务 Distributed systems Video information Storage networks Task distribution balancing
  • 相关文献

参考文献3

  • 1陈进才,张江陵,冯丹.GSM:一种多服务器系统的动态负载均衡调度模型[J].小型微型计算机系统,2004,25(7):1260-1263. 被引量:1
  • 2Robertazzi T G. Computer Networks and Systems: Queueing Theory and Performance Evaluation [M]. Berlin: Springer-Verlag,1990?A?A?A
  • 3Mitzenmacher M. The power of two choices in randomized load balancing [J]. IEEE Trans. on Parallel and Distributed Systems,2001,12(10): 1094~1104.

二级参考文献7

  • 1[1]Mitzenmacher M. The power of two choices in randomized load balancing [J]. IEEE Transactions on Parallel and Distributed Systems, 2001,12(10): 1094-1104.
  • 2[2]Mitzenmacher M. The load balancing and density dependent jump markov processes[C]. In: Proc. 37th IEEE Symp. Foundations of Computer Science, 1996.213-222.
  • 3[3]Vvedenskaya N D, Dobrushin R L, Karpelevich F I. The queueing system with selection of the shortest of two queues: an asymptotic approach [J]. Problems of Information Transmission, 1996, 32:15-27.
  • 4[4]Lin Chuang. Stochastic petri net and performance evaluation[M]. Beijing: Tsinghua University Press, 2000.
  • 5[5]Robertazzi T G. Computer networks and systems: queueing theory and performance evaluation[M]. Berlin: Springer-Verlag, 1990.
  • 6[6]Hua X. Queueing theory and random service system[M].Shanghai:Shanghai Translation Publishing House, 1987.
  • 7[8](美) 华兴. 排队论与随机服务系统[M].上海:上海翻译出版公司, 1987.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部