异构可重构计算系统的Petri网模型  

A Petri Net Model for Heterogeneous Reconfigurable Computing Systems

作　　者：张娓娓[1] 郭军[2] ZHANG Wei-wei;GUO Jun(Xi＇an Siyuan University,Xi＇an 710038,China;Northwest University,Xi＇an 710069,China)

机构地区：[1]西安思源学院,陕西西安710038 [2]西北大学,陕西西安710069

出　　处：《计算机技术与发展》2018年第9期112-117,共6页Computer Technology and Development

基　　金：陕西省教育自然科学专项基金(17JK1073);陕西省自然科学基础研究计划资助项目(2017JM6056)

摘　　要：构建系统描述模型是设计可重构计算系统的重要环节。现有的系统建模方法主要分为形式化方法和非形式化方法两种,其中,非形式化模型缺乏严格的数学定义,给模型的分析和验证带来困难。采用形式化方法建立的系统模型无歧义,更适合分析和验证。Petri网作为一种常用的形式化建模方法,有严格的数学定义和建模理论,但是,基本Petri网在对可重构计算系统建模时存在数据流描述能力不足的问题。为此,对基本Petri网进行扩展,提出了一种数据流Petri网。首先给出了数据流Petri网的结构定义和动态行为规则,并定义了模型的图形符号表示方法。然后,分析了模型对可重构计算配置任务和计算任务的描述方法,在考虑硬件资源约束条件下,讨论了可重构计算系统的数据流Petri网建模技术。最后,通过一个典型的乘加运算器模型分析,表明该方法易于实现,所建模型结构简洁,便于分析验证系统功能。The system description model plays an important role in the design of reconfigurable computing systems. The existing modelscan be divided into two categories：formal and informal methods. As informal models lack rigorous mathematical definitions,it is difficultto analyze and verify the functions of a system by informal models. On the contrary,formal models are unambiguous and suitable forfunctional verification. Petri nets is a commonly used formal method with rigorous mathematical definitions and modeling theory. But thebasic Petri net could not meet the requirement of modeling reconfigurable computing systems without the ability of describing data flow.Thus we extend the basic Petri net and propose a kind of data flow Petri net（DPN）. Firstly,we define the structure and firing rules ofDPN mathematically. The graphic symbols of DPN are also defined. And then we introduce the DPN models of configurable tasks andcomputing tasks for reconfigurable computing systems. At the same time,the techniques for modeling reconfigurable computing systemsby DPN are discussed with the consideration of hardware resource constrain. Finally,as an instance,a multiply-adder is analyzed by DPNmodels. The result indicates that the DPN model is simple to construct,easy to understand and convenient for functional verification.

关 键 词：可重构计算 异构系统 PETRI网 形式化模型 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]