Data Flow Graph Partitioning Algorithms and Their Evaluations for Optimal Spatio-temporal Computation on a Coarse Grain Reconfigurable Architecture
スポンサーリンク
概要
- 論文の詳細を見る
Coarse Grain Reconfigurable Architectures (CGRA) support spatial and temporal computation to speedup execution and reduce reconfiguration time. Thus compilation involves partitioning instructions spatially and scheduling them temporally. The task of partitioning is governed by the opposing forces of being able to expose as much parallelism as possible and reducing communication time. We extend Edge-Betweenness Centrality scheme, originally used for detecting community structures in social and biological networks, for partitioning instructions of a dataflow graph. We also implement several other partitioning algorithms from literature and compare the execution time obtained by each of these partitioning algorithms on a CGRA called REDEFINE. Centrality based partitioning scheme outperforms several other schemes with 6-20% execution time speedup for various Cryptographic kernels. REDEFINE using centrality based partitioning performs 9× better than a General Purpose Processor, as opposed to 7.76× better without using centrality based partitioning. Similarly, centrality improves the execution time comparison of AES-128 Decryption from 11× to 13.2×.
論文 | ランダム
- OFDMAを用いるEvolved UTRAにおける共有データチャネルに対するブロック分割を用いるリソースブロックレベルのDistributed送信法(有線/無線シームレスネットワーク,ネットワーク制御,無線通信一般)
- 1. 上顎総義歯の動的荷重下における経時的な変形に関する研究
- B-5-51 上リリンク無線アクセスにおける周波数選択性を考慮したパケットスケジューリング法の検討(B-5.無線通信システムA(移動通信),通信1)
- 1-2-20. 局部床義歯における間接維持装置のあり方 : 第5報 片側でまとめた下顎遊離端義歯における直接および間接維持装置の効果(第77回日本補綴歯科学会学術大会講演要旨)
- 1-2-9. 遊離端局部義歯装着者における鉤歯および人工歯に加わる咀嚼力 : 第2報 義歯装着後における経時的変化(第76回日本補綴歯科学会学術大会講演要旨)