Bypass node non-redundant adding algorithm for crossing-level data transmission in two-dimension reconfigurable cell array
As for the problem of hardware task crossing-level data transmission,a preorder traversing backtracking adding_bypass_node (PTBA) algorithm is presented which maintains logic relation among original computing nodes and does not add redundancy nodes based on data flow graph with crossing-level-in-tre...
Saved in:
Main Authors: | Nai-jin CHEN, Zhi-yong FENG, Jian-hui JIANG |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2015-04-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015132/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Research on seed node mining algorithm in large-scale temporal graph
by: Xiaohong ZOU, et al.
Published: (2022-09-01) -
Partition detection for large scale ad hoc networks
by: LI Jian-dong, et al.
Published: (2008-01-01) -
Myocardial damage in cardioplegia and cardiopulmonary bypass
by: M.Т. Vatutin, et al.
Published: (2016-05-01) -
Homomorphisms of complete n-partite graphs
by: Robert D. Girse
Published: (1986-01-01) -
Graph partition based mapping algorithm on multiprocessors for streaming applications
by: Qi TANG, et al.
Published: (2016-06-01)