基三互连网络的遍历性质及流水模型设计

Research on Ergodic Property and Streaming Model of Triplet-Based Interconnection Network

  • 摘要: 通过对一种新颖的片上网络拓扑——基三互连网络进行图论定义,证明了基三互连网络的遍历特性,描述了数据在基三体系结构上的运行特征,归纳出几种流水模型,并以规则抽样并行排序算法为例,给出了流水模型的应用过程. 模拟实验显示,利用流水模型能够描述并行应用在特定网络拓扑结构上的运行方式,并估算出网络拓扑结构对其并行性能的影响.

     

    Abstract: Triplet-based interconnection network (THIN), which is a novel topology of network-on-chip, is redefined using graph theory. The ergodic property of THIN is proved, and several kinds of streaming models of THIN are induced. The streaming models conclude the streaming features of data in the triplet-based architecture. The parallel sorting by regular sampling (PSRS) algorithm is used to explain the course of applying streaming models. The simulation shows that the performance effected by the topology and the running patterns can be well evaluated by using cited streaming models.

     

/

返回文章
返回
Baidu
map