异构任务图的实现模型  

Implementing Model for Heterogeneous Task Graph

作　　者：曾国荪[1] 陆鑫达[2] 

机构地区：[1]同济大学计算机科学与工程系,上海200092 [2]上海交通大学计算机科学及工程系,上海200030

出　　处：《同济大学学报（自然科学版）》2001年第8期954-960,共7页Journal of Tongji University:Natural Science

基　　金：国家自然科学基金资助项目 ( 6 97730 14 )

摘　　要：任意异构程序映射到任意异构系统上执行 ,是并行程序计算最复杂的情况 .为此提出了异构任务图的定义 ,它是异构程序直观和有效描述方法 .还研究了异构任务图的实现模型 ,它是异构计算环境中软件和硬件的桥梁 .分别给出了任务图的分簇算法、系统图的分簇算法和映射算法及应用实例 .利用该模型可设计出可移植的并行程序 。It is the most complicated situations in parallel program computing that arbitrary heterogeneous tasks are mapped and executed on arbitrary heterogeneous systems.This paper proposes an origin definition of heterogeneous task graph,which is a visual and valid description scheme of heterogeneous programs.Furthermore,we study an implementing model for heterogeneous task graph,which is the bridge between software and hardware in the environment of heterogeneous computing.The paper presents task graph clustering algorithm,system graph clustering algorithm and mapping algorithm respectively,as well as their application instances.We can write portable parallel programs by means of the model,then schedule and run these programs onto dynamically reconfigured heterogeneous computer organizations.

关 键 词：异构计算 任务图 计算模型 分簇算法 并行处理 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]