The Review of Cellular Automata Algorithms for Placement and Routing Problems

The paper proposes a review of the modern research experience of the cellular automata algorithms, models and methods to solve the problem of searching the shortest paths and the placement task for the logic elements within the design flow for FPGA. The classical and hybrid cellular automata models...

Full description

Saved in:
Bibliographic Details
Main Authors: Zapletina, Mariya A., Zhukov, Denis V.
Format: Conference Proceeding
Language:English
Subjects:
Automata
cellular automata
Field programmable gate arrays
field-programmable gate array
FPGA
Logic gates
multi-agent
placement
Routing
Search problems
Semantics
shortest path search
Task analysis
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The paper proposes a review of the modern research experience of the cellular automata algorithms, models and methods to solve the problem of searching the shortest paths and the placement task for the logic elements within the design flow for FPGA. The classical and hybrid cellular automata models are considered. The particular attention is paid to the cellular automata with multi-agent semantics for the shortest path search algorithms. A detailed analysis of the model for solving the placement problem based on the systolic structure is given. The main difficulties and possible problems of the cellular automata models and algorithms for placement and routing stages of an FPGA design flow are highlighted and discussed.
ISSN:2376-6565
DOI:10.1109/ElConRus51938.2021.9396339