2018 IEEE 3rd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC) 2018
DOI: 10.1109/iaeac.2018.8577573
|View full text |Cite
|
Sign up to set email alerts
|

A Dependence-First Clustering Based Partitioning Algorithm for Coarse-Grained Reconfigurable Cipher Logic Array

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 5 publications
0
1
0
Order By: Relevance
“…The formula is Cost=αN+βC, where N represents the number of clusters in the data flow graph partition result, C represents the total traffic between clusters [5]. A cluster corresponds to a PE of the coarse-grained reconfigurable cryptographic logic array, α、β are their respective weights, which are both 1 in this paper, it can be seen from the formula that the number of partitioned clusters and the inter-cluster communication overhead should be minimized [6]. According to the above analysis, the specific process of the ant colony task partition algorithm designed in this paper is as follows:…”
Section: Acp Algorithmmentioning
confidence: 99%
“…The formula is Cost=αN+βC, where N represents the number of clusters in the data flow graph partition result, C represents the total traffic between clusters [5]. A cluster corresponds to a PE of the coarse-grained reconfigurable cryptographic logic array, α、β are their respective weights, which are both 1 in this paper, it can be seen from the formula that the number of partitioned clusters and the inter-cluster communication overhead should be minimized [6]. According to the above analysis, the specific process of the ant colony task partition algorithm designed in this paper is as follows:…”
Section: Acp Algorithmmentioning
confidence: 99%