期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种基于DAG图的异构可重构任务划分方法 被引量：4

A Method of Heterogeneous and Reconfigurable Task Partitioning Based on DAG
下载PDF
导出
摘要 为了实现高性能低功耗的计算,以任务划分为研究对象,提出了异构可重构计算的基本概念和形式化描述方法,给出了基于异构计算任务和异构可重构体系结构相结合的异构可重构两种任务划分方法:节点内部可重组及网络可重建的任务划分及算法,最后验证了其任务划分方法的有效性. In order to realize high-performance and low-power computing with task partitioning as the study object,the heterogeneous reconfigurable computing definition and its formal description were proposed and two task partitioning methods,intra-node recombined and network rebuild,were presented based on matching heterogeneous computing task with reconfigurable architecture.Then the algorithm was derived.Theoretical analysis and simulations prove the task-partitioning algorithm to be valid.
作者 郝水侠 曾国荪 谭一鸣
机构地区 同济大学计算机科学及技术系 国家高性能计算机工程技术中心同济分中心 徐州师范大学数学科学学院
出处 《同济大学学报（自然科学版）》 EI CAS CSCD 北大核心 2011年第11期1693-1698,共6页 Journal of Tongji University:Natural Science
基金 国家"863"高技术研究发展计划资助项目(2009AA012201) 国家自然科学基金资助项目(61103068) NSFC-微软亚洲研究院联合资助项目(60970155) 教育部博士点基金项目(20090072110035) 上海市优秀学科带头人计划项目(10XD1404400) 高效能服务器和存储技术国家重点实验室开放基金项目(2009HSSA06)
关键词 有向无环图(DAG) 异构计算任务 可重构体系结构 任务划分 directed acyclic graph（DAG） heterogeneous computing task reconfigurable architecture task partitioning
分类号 TP338 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献11

  • 1Freund R F. Optimal selection theory for superconcurrency [C]//Proceedings of Conference on Supercomputing. New York : ACM, 1989: 699 - 703.
  • 2Chen S,Eshaghian M,Khokhar A, et al. A selection theory and methodology for heterogeneous supercomputing [C ] // Proceedings of Workshop on Heterogeneous Processing. Los Alamitos: IEEE CS Press, 1993:15 - 22.
  • 3Khokhar A, Prasamma V K, Shaaban M E. Heterogeneous computing: challenges and opportunities[J]. Computer, 1993,26 (6):18.
  • 4Estrin G, Bussellt B, Turn R, et al. Parallel processing in a restructure computer system [ J ]. IEEE Transactions on Electronic Computers, 1963,12 (5) : 747.
  • 5Kartashev S I, Kartashev S P. A multicomputer system with dynamic architecture [J]. IEEE Transactions on Computers, 1979,28(10) :704.
  • 6Bruce H,TamaraG. Graph partitioning models for parallel computing[J]. Parallel Computing, 2000,26(1) : 1519.
  • 7Selvakkumaran N, George K. Multiobjective hypergraph partitioning algorithms for cut and maximum subdomain-degree minimization[J]. IEEE Transactions on Computer Aided Design of Intergrated Circuits and System, 2006,25 (3) :504.
  • 8HendricksonB, Kolda T G, Partitioning nonsquare and nonsymmetric matrices for parallel processing [J ]. SIAM Journal on Scientics Computer, 2000 (21) :2048.
  • 9Catalyurek U V, Aykanat C. Hypergraph-partitioning based decomposing for parallel sparsematrix vector multiplication[J]. IEEE Transactions on Parallel Distribution System, 1999, 10 (5) :673.
  • 10Karypis G,Kumar V. Multilevel k-way partitioning scheme for irregular graphs[J]. Journal of Parallel Distribution Computer, 1998,48(1) :96.

二级参考文献9

  • 1Freund R F, Siegel H J. Heterogeneous processing. Computer, 1993,26(6):18~27
  • 2Karypis G, Kumar V, A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. SIAM J Sci Comput, 1998,20 (1) : 359-392
  • 3Karypis G, Kumar Vo Multilevel k-way Partitioning Scheme for Irregular Graphs, J Parallel Distrib Comput,1998,48(1) :96~129
  • 4Hendrickson B, Leland tL An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM J Sci Comput,1995,16(2) : 452~469
  • 5Miller G L, Teng Shang-Hua, Vavasis S A. A unified geometric approach to graph separators. In: Proceedings of 31st Annual Symposium on Foundations of Computer Science, 1991. 538~547
  • 6Hendrickson B, Leland R. A multilevel algorithm for partitioning graphs: [Technical Report]. SAND93-1301, Sandia National Laboratories, 1993
  • 7Kernighan B W, Lin S. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 1970,49(2) :291~307
  • 8http://staffweb.cms. gre ac. uk/-c. walshaw/partition
  • 9曾国荪,263.net,陆鑫达.异构计算中的负载共享[J].软件学报,2000,11(4):551-556. 被引量：22

共引文献6

同被引文献42

  • 1沈轶炜,曾国荪.异构计算中一种图的非均衡划分算法[J].计算机科学,2006,33(6):260-263. 被引量：7
  • 2王峰,周学海,陈艾,罗赛.基于部分重构技术的加密算法实现研究[J].电子学报,2007,35(5):959-963. 被引量：4
  • 3张伟哲,田志宏,张宏莉,何慧,刘文懋.虚拟计算环境中的多机群协同调度算法[J].软件学报,2007,18(8):2027-2037. 被引量：9
  • 4Li Xiaobin, Gaudiot J L. Design Trade-offs and Deadlock Prevention in Transient Fault-tolerant SMT Processors[C]// Proc. of the 12th International Symposium on Dependable Computing. Riverside, USA: Is. n.], 2006.
  • 5Madan N, Balasubramonian R. Power-efficient Approaches to Redundant Multithreading[J]. IEEE Transactions on Parallel and Distributed Systems, 2007, 18(8): 1066-1079.
  • 6Ma Yi, Zhou Huiyang. Efficient Transient-fault Tolerance for Multithread Processors Using Dual-thread Execution[C]//Proc. of International Conference on Computer Design. Las Vegas, USA: Is. n.], 2007.
  • 7Dieter W, Lumpp J J. A User-level Cheekpointing Library for POSIX Threads Programs[C]//Proe. of Symposium on Fault- tolerant Computing. Los Alamitos, USA: IEEE Computer, 1999.
  • 8Tang Shanjiang, Yu Ce, Sun Jizhou, et al. EasyPDP: An Efficient Parallel Dynamic Programming Runtime System for Computational Biology[J]. IEEE Transactions on Parallel and Distributed Systems, 2012, 23(5): 862-872.
  • 9Androutsellis T S, Spinellis D. A Survey of Peer-to-Peer Content Distribution Technologies[J]. ACM Computing Surveys, 2004, 36(4): 335-371.
  • 10Canon L C, Jeannot E. Evaluation and Optimization of the Robustness of DAG Schedules in Heterogeneous Environ- ments[J]. IEEE Transactions on Parallel and Distributed Systems, 2010, 21(4): 532-546.

引证文献4

二级引证文献2

同济大学学报（自然科学版）
2011年 第11期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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