检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西北工业大学,华南理工大学
出 处:《西北工业大学学报》1996年第3期410-414,共5页Journal of Northwestern Polytechnical University
基 金:航空科学基金
摘 要:基于Transputer并行网络,给出了一种测试并行结构的算法。该算法用堆栈作为核心数据结构,采用类似于图的深度优先搜索遍历方式,快速而准确地测试出各种Transputer并行网络的结构。该算法的实现对硬件调试者在其调试过程中及对用户或编程员在其软件调试过程中都有着十分重要的意义。At present, It is very important for users to understand interconnecting constructions of parallel networks and to improve use efficiency of parallel computer further. We aim at developing a tool to help users and technical personnel, who are engaged in hardware debugging and software debugging, understand the interconnecting constructions. To implement the needed tool, we present an algorithm (Fig. 2) that can test various constructions of transputer parallel networks quickly and precisely. The algorithm uses stack as data structure and adopts the method of depth - first search traversing. This tool can determine whether Links communications are correct or not; it can also determine the parallel network's topology structure corresponding to the user's algorithm. The algorithm is also suitable for point-to-point parallel network constructions based on other processors.
分 类 号:TP311.56[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.112