2010 13th Euromicro Conference on Digital System Design: Architectures, Methods and Tools 2010
DOI: 10.1109/dsd.2010.22
|View full text |Cite
|
Sign up to set email alerts
|

A Memetic Approach for Nanoscale Hybrid Circuit Cell Mapping

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2011
2011
2015
2015

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(12 citation statements)
references
References 20 publications
0
12
0
Order By: Relevance
“…Results for defect scenario (i) are given in the following tables; Table 3 report the maximum and averaged CPU computation times (in seconds), which SimE and TS needed to reconfigure all benchmark circuits for random and clustered defect maps when q nano is between 10 and 30 %. For this given range of stuck-open probabilities, both SimE and TS were successful in reconfiguring circuits around all defective 1 Previous solutions for CMOL cells placement [21,[23][24][25][26]28] defined the connectivity domain based on Manhattan distance, where a cell is said to be within the connectivity domain of another cell if the Manhattan distance between them is less or equal to connectivity radius a = 12.…”
Section: Reconfiguration Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Results for defect scenario (i) are given in the following tables; Table 3 report the maximum and averaged CPU computation times (in seconds), which SimE and TS needed to reconfigure all benchmark circuits for random and clustered defect maps when q nano is between 10 and 30 %. For this given range of stuck-open probabilities, both SimE and TS were successful in reconfiguring circuits around all defective 1 Previous solutions for CMOL cells placement [21,[23][24][25][26]28] defined the connectivity domain based on Manhattan distance, where a cell is said to be within the connectivity domain of another cell if the Manhattan distance between them is less or equal to connectivity radius a = 12.…”
Section: Reconfiguration Resultsmentioning
confidence: 99%
“…3 proposals had been introduced for defect-unaware cell placement/assignment in CMOL circuits including the works of Likharev et al [15,22] and Hung et al [23]. Previous attempts to use sub-optimal search heuristics for CMOL placement are reported in [24][25][26][27]. Simulated evolution [28] and TS [21,29] heuristics have also been attempted for defect-unaware CMOL placement problem.…”
Section: Literature Reviewmentioning
confidence: 98%
“…The main difference between works in [23] and this paper is the integration of LRT within the MA framework. By moving the hard structural connectivity domain constraint to the cost function, a Lagrangian problem is formulated and solved by the MA incremental search engine.…”
Section: A Overviewmentioning
confidence: 94%
“…A preliminary conference version of our work [23] presented a basic framework of MA for CMOL cell mapping. In this paper, we extend our work and formulate it as an LR problem by moving hard connectivity domain constraints to the objective function.…”
Section: Introductionmentioning
confidence: 99%
“…Instead of working at tiles level, Hung et al [6] encoded the CMOL cell assignment as a Satisfiability problem at cells level, where placement solution was found when all Boolean constraints are satisfied. However, when circuits sizes increased the computation time became exhibitant Previous attempts to use sub-optimal search heuristics are reported in [7,8,9]. Genetic Algorithm (GA) [7] was used with two dimensional block PMX crossover operator and mutation, where the fitness function evaluates the Manhattan distance between connected cells.…”
Section: Introductionmentioning
confidence: 99%