VLCC中的DAG并行算法  

DAG Parallel Arithmetic in Virtual Laboratory of Cryptology Based on Components

作　　者：周深[1] 杨路明[1] 段桂华[1] 

机构地区：[1]中南大学信息科学与工程学院,长沙410083

出　　处：《计算机工程》2009年第19期151-153,共3页Computer Engineering

摘　　要：基于组件的密码学虚拟实验室(VLCC)采用有向无环图(DAG)的拓扑排序机制管理组件。在分析VLCC各组件之间的数据依赖和运行次序关系的基础上,提出一种新的基于Java多线程机制和"唤醒"机制的DAG并行算法。与拓扑排序算法相比,具有低算法时间复杂度的特点。实验结果表明,系统在新算法下较大地缩短了系统运行时间,提高资源使用效率和用户满意度,能更好地完善VLCC。Virtual Laboratory of Cryptology based on Components（VLCC） uses topological sorting in Directed Acyclic Graph（DAG） to manage the data-dependant and execute-order between components. Based on the Java thread and ＂wake＂ mechanism, this paper proposes a new DAG parallel arithmetic. Compared with topological sorting, new arithmetic＇s time-complexity is highly reduced. Experimental result shows that VLCC works much faster and the usage rate of resource is heightened, and makes user more satisfied. New arithmetic is a better solution for VLCC.

关 键 词：基于组件的密码学虚拟实验室 有向无环图 拓扑排序 并行 

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