期刊文献+

异构通信的可伸缩通用矩阵乘二维波动内核成本测量

Scalable Universal Matrix Multiplied Two-Dimensional Fluctuation Kernel Cost Measurement for Heterogeneous Communications
下载PDF
导出
摘要 [目的]采用处理器和通信信道共享策略的异构系统正逐渐成为研究主流,但是算法部署过于复杂,而采用工作负载分配的通信计算模型又会导致通信的不平衡,导致系统均衡性存在偏差。[方法]为解决该问题提出一种内核成本测量可伸缩通用矩阵乘异构通信τ-LOP模型分析方式。首先,在混合异构平台上,采用τ-LOP模型估计并行应用数据的通信开销扩展。其次,使用两个具有相反特征的数据构建并行核的扩展模型,建立具有高通信与计算比SUMMA矩阵乘法和二维波动方程的有限差分求解器,有效降低通信复杂度。[结果]最后,通过仿真实验,验证了所提算法模型的有效性。 Heterogeneous systems using processor and communication channel sharing strategies are becoming the mainstream of research, but the algorithm deployment is too complex, and the communication computing model using workload distribution will lead to communication imbalance, resulting in system balance bias. To solve this problem, a kernel cost measurement can be proposed. The generalized universal matrix multiplying heterogeneous communication τ-LOP model analysis method. Firstly, the τ-LOP model is used to estimate the communication overhead expansion of parallel application data on hybrid heterogeneous platforms. Secondly, an extended model of parallel kernel is constructed by using two data with opposite characteristics, and a finite difference solver with high communication and computational ratio SUMMA matrix multiplication and two-dimensional wave equation is established, which can effectively reduce the communication complexity. Finally, the effectiveness of the proposed algorithm is verified by simulation experiments.
作者 赵彤 何涛 ZHAO Tong;HE Tao(School of Automation & Electrical Engineering,Lanzhou Jiaotong University,Lanzhou 730070,China)
出处 《电视技术》 2019年第2期73-80,共8页 Video Engineering
关键词 内核成本 可伸缩 通用矩阵 异构通信 τ-LOP模型 kernel cost scalable generic matrix heterogeneous communication τ-LOP model
  • 相关文献

参考文献3

二级参考文献41

  • 1T. Benson, A. Akella, and D. A. Maltz, Network traffic characteristics of data centers in the wild, in Proceedings of the 10th ACM SIGCOMM Conference on Internet Measurement, ACM, 2010, pp. 267-280. 被引量:1
  • 2D. T. Meyer and W. J. Bolosky, A study of practical deduplication, ACM Transactions on Storage (TOS), vol. 7, no. 4, p. 14, 2012. 被引量:1
  • 3A. T. Clements, I. Ahmad, M. Vilayannur, and J. Li, Decentralized deduplication in san cluster file systems, in USENIXAnnual Technical Conference, 2009, pp. 101-114. 被引量:1
  • 4U. Manber, Finding similar files in a large file system, in Usenix Winter 1994 Technical Conference, 1994, pp. 1-10. 被引量:1
  • 5B. S. Baker, On finding duplication and near-duplication in large software systems, in Reverse Engineering, 1995, Proceedings of 2nd Working Conference on, IEEE, 1995, pp. 86-95. 被引量:1
  • 6G. Forman, K. Eshghi, and S. Chiocchetti, Finding similar files in large document repositories, in Proceedings of the Eleventh ACM S1GKDD International Conference on Knowledge Discovery in Data Mining, ACM, 2005, pp. 394-400. 被引量:1
  • 7J. R. Douceur, A. Adya, W. J. Bolosky, R Simon, and M. Theimer, Reclaiming space from duplicate files in a serverless distributed file system, in Distributed Computing Systems, 2002. Proceedings. 22nd International Conference on, IEEE, 2002, pp. 617-624. 被引量:1
  • 8S. Quinlan and S. Dorward, Venti: A new approach to archival storage, FAST, vol. 2, pp. 89-101, 2002. 被引量:1
  • 9B. Zhu, K. Li, and R. H. Patterson, Avoiding the disk bottleneck in the data domain deduplication file system, FAST, vol. 8, pp. 1-14, 2008. 被引量:1
  • 10B. Balasubramanian, T. Lan, and M. Chiang, Sap: Similarity aware partitioning for efficient cloud storage, in Infocom 2014 Proceedings IEEE, 2014, pp. 592-600. 被引量:1

共引文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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