期刊文献+

动态盘阵D/H分布与基于控制理论的在线重构 被引量:2

D/H Placement and On-Line Data Reorganization Based on Control Theory in Dynamic Disk Array
下载PDF
导出
摘要 由于能够提供高性能I/O,盘阵被广泛采用.但以往的盘阵扩展性不足.而用户或应用程序对外存容量和I/O性能需求是变化的,盘阵系统本身必须有很强的扩展性,以适应系统的I/O需求.因此,由于既具有盘阵的高性能I/O,又能通过增加或减去设备后进行数据重构实现性能的扩展,动态盘阵具有广泛的前景.动态盘阵的技术热点是数据分布算法和在线自适应数据重构技术,使得盘阵的性能和容量能够随着系统的扩展而伸缩,同时使得盘阵动态扩展时的数据重构对系统的影响非常小.主要工作是:第1,对动态盘阵的数据分布展开研究,并提出一种新的数据分布算法(D/H分布).在D/H分布中,盘阵扩展时始终保持各设备上空间和负载的平衡性,同时扩展时重构的数据最少;第2,针对D/H分布,提出基于控制理论的数据重构技术,使得盘阵动态扩展时的在线数据重构对请求QoS的影响非常小,同时使得数据重构能够尽快完成;第3,研究中针对Sprite trace和合成负载进行了大量模拟实验,结果表明,提出的基于控制理论的数据重构技术行之有效. Disk Array is adopted widely because of its high performance I/O. To adapt the need of applications' changeable I/O performance, I/O storage subsystem should be highly scalable. So DDA (dynamic disk array), which can scale adaptively, is an ideal system. The key technology of DDA is its data placement algorithm and online data reorganization algorithm. The main contribution of the paper is: first, a detailed study on DDA data placement is conducted and a new placement method, D/H, is presented. In D/H placement, the space in DDA is balanced after scale, and the reorganization cost is minimized; then, an online data reorganization algorithm based on control feedback theory is provided. With this strategy, the reorganization in DDA does little impression to the system QoS, and under this condition, data reorganization can be accomplished as quickly as possible; finally, simulation results show that Online Data Reorganization based on Control Theory is useful.
出处 《软件学报》 EI CSCD 北大核心 2005年第5期1028-1038,共11页 Journal of Software
基金 国家杰出青年科学基金 国家高技术研究发展计划(863)~~
关键词 盘阵 动态扩展 动态盘阵 数据分布 算法 在线重构 控制理论 Adaptive algorithms Computer simulation Control theory Data storage equipment Feedback control Quality of service
  • 相关文献

参考文献20

  • 1Shen XH, Choudhary AN, Matarazzo C, Sinha P. A distributed multi-storage resource architecture and I/O performance prediction for scientific computing. Cluster Computing, 2003,6(3): 189-200.
  • 2Harting H. An I/O architecture for microkernel-based operationg systems. Technical Report TUD-FI03-08-Juli-2003, Dresden, TU Dresden, 2003.
  • 3Ho TK, Lee JYB. A row-permutated data reorganization algorithm for growing server-less video-on-demand systems. In: Lee S,Sekiguchi S, eds. Proc. of the 3rd IEEE/ACM Int'l Symp. on Cluster Computing and the Grid (CCGRID 2003). Tokyo: IEEE/ACMPress, 2003.44-51.
  • 4刘军 唐玉华 王磊 蒋艳凰 杨学军.动态海量存储系统[J].计算机研究与发展,2002,39(1):162-167.
  • 5Ghandeharizadeh S, Kim D. On-Line reorganization of data in scalable continuous media servers. In: Feitelson DG, Rudolph L, eds.Proc. of the 7th Int'l Conf. on Database and Expert Systems Applications. Lecture Notes in Computer Science, Zurich, 1996.751-768.
  • 6Goel A, Shahabi C, Yao S-YD, Zimmermann R. SCADDAR: An efficient randomized technique to reorganize continuous media blocks. In: Chaudhuri S, Carey M, Garcia-Molina H, eds. Proc. of the 18th Int'l Conf. on Data Engineering (ICDE 2002). San Jose:IEEE CS Press, 2002.473-482.
  • 7Lu CY, Alvarez GA, Wilkes J. Aqueduct: Online data migration with performance guarantees. In: Chase J, Cole J, eds. Proc. of the USENIX Conf. on File and Storage Technologies (FAST). Monterey, 2002. 219-230.
  • 8Abdelzaher TF. An automated profiling subsystem for QoS-aware services. In: Sztipanovits J, Abdelzaher TF, Atkins EM, eds.Proc. of the 6th IEEE Real Time Technology and Applications Symp. Washington DC: IEEE Press, 2000. 208-217.
  • 9Lumb CR, Merchant A, Alvarez GA. Facade: Virtual storage devices with performance guarantees. In: Chase J, Cole J, eds. Proc.of the 2nd USENIX Conf. on File and Storage Technologies (FAST). San Francisco, 2003. 131-144.
  • 10Madell T, Madell T. Disk and File Management Tasks in HP-UX. Printice-Hall: Pearson Education POD, 1997.

同被引文献5

  • 1Schmuck F,Haskin R.GPFS:a shared-disk file system[C]//Proceedings of the Conference on File and Storage Technologies.Monterey,USA:USENIX,2002.
  • 2Hartman J,Ousterhout J.The zebra striped network file system[J].ACM Transactions on Computer Systems,1995,13(3):274-310.
  • 3Holland M,Gibson G.Parity declustering for continuous operation on redundant disk arrays[C] // Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems.New York:ACM Press,1992.
  • 4Alvarez G,Burkhard W,Stockmeyer L,et al.Declustered disk array architectures with optimal and nearoptimal parallelism[C]//Proceedings of the 25th Annual ACM/IEEE International Symposium on Computer Architecture.New York:ACM Press,1998.
  • 5Carns H,Ligon B,Ross B,et al.PVFS:a parallel file system for Linux clusters[C]//Proceedings of the 4th Annual Linux Showcase and Conference.New York:ACM Press,2000.

引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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