检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:孙琳琳[1] 侯秀萍[1] 朱波[1] 肖宇虹[1] 王荣丽[1]
机构地区:[1]长春工业大学计算机科学与工程学院,长春130012
出 处:《吉林大学学报(信息科学版)》2015年第5期588-594,共7页Journal of Jilin University(Information Science Edition)
基 金:吉林省科技厅科技成果转化基金资助项目(20130303010GX)
摘 要:为了提高传统串行类簇级测试速度,对类簇测试任务并行化方法进行研究。使用类间依赖关系和类测试依赖关系分析方法将类簇级测试任务并行化问题转化为求解对象关系图中节点的并行性。复杂的类簇关系会形成有向环路,为确定环路中测试的起始位置需要将环路打破,提出了综合考虑节点度数、环路数和测试桩复杂度3种因素的破环方法;对消除环路的对象关系图进行并行性分析,并设计了一种分层并行算法。通过实验对串行方案和分层并行方案进行对比,证明了分层并行方案的有效性。In order to improve the test speed of the traditional serial cluster level,we study the parallel method of cluster test tasks. In this process we through the dependencies between the classes and between the class tests to make the cluster level test task parallelization problem transformed into solving the parallel nodes in object relational graph. First,complex cluster relationships could be formed into the loop. In order to determine the starting position of the test,we need to break loop. We put forward the broken loop method considering the node degree,number of loops and complexity of test stub of the three kinds of factors. Second,by means of analyzing the elimination of the loop object relation graphs,a hierarchical parallel algorithm is designed. Finally,an example of serial scheme and hierarchical parallel scheme comparison demonstrate that the hierarchical parallel scheme has a practical significance.
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222