检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:田甜[1] 郭庆[1] 张辰 TIAN Tian;GUO Qing;ZHANG Chen(School of Computer Science and Technology,Shandong Jianzhu University,Jinan 250101,China)
机构地区:[1]山东建筑大学计算机科学与技术学院,山东济南250101
出 处:《聊城大学学报(自然科学版)》2018年第4期104-110,共7页Journal of Liaocheng University:Natural Science Edition
基 金:国家自然科学基金项目(61503220)资助
摘 要:随着高性能技术的发展,MPI并行程序得到了越来越广泛的应用,其可靠性也得到了软件工程界越来越多的关注.一个MPI并行程序有多个并行执行的进程,每个进程包含一系列串行执行语句.死锁是并行程序的一类典型错误,本文提出一种基于占优关系的死锁检测方法.首先,根据通信语句之间的占优关系,得到每个进程内,通信边之间的占优关系;然后,通过判定通信边占优关系是否相互违背,检测程序中的死锁.基于上述思想,开发了基于占优关系的死锁检测原型工具,用于检测多个典型的MPI并行程序.结果表明,本文方法能够检测出程序中的死锁缺陷.MPI parallel programs have been applied broadly and their reliability has attracted more and more attention from the software engineering community. A MPI parallel program contains several processes, each of which has a series of statements executed sequentially. The deadlock is a typical error that occurs in parallel programs. This study proposes a method of detecting deadlocks based on dominance relation. Firstly, the dominance relations of communication edges are firstly conducted from those of communication statements. Secondly, the deadlock is detected by checking the dominance relations of communication edges. The proposed method is preliminarily implemented and used for detecting several MPI parallel programs. The experimental results verify the effectiveness of the proposed method.
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7