Paper Info
Title
Shortest Path Computing Using Memristor-Based Circuits And Cellular Automata
Abstract
This paper addresses Cellular Automata (CA) based algorithm implementations using circuits with memory resistors (memristors). Memristors are two-terminal passive nonvolatile resistance switching devices whose unique adaptive properties are suitable for massively parallel computational purposes. The sparse nature of computations using network configurations of memristors resembles certain operational features and computing capabilities of CA. Here a memristive CA capable of detecting the shortest path between given nodes of a mesh with weighted edges is proposed. Simulation results are in absolute agreement with the solutions given by the corresponding CA-based algorithmic approach. The proposed memristive CA circuit structure is also used for the effective solution of the traveling salesman problem.
Year
DOI
Venue
2014
10.1007/978-3-319-11520-7_41
CELLULAR AUTOMATA: 11TH INTERNATIONAL CONFERENCE ON CELLULAR AUTOMATA FOR RESEARCH AND INDUSTRY
Keywords
Field
DocType
Cellular Automata, memristor, memristive computing, parallel algorithms, shortest path problem, traveling salesman problem
Topology,Cellular automaton,Memristor,Mobile automaton,Shortest path problem,Parallel algorithm,Computer science,Massively parallel,Theoretical computer science,Travelling salesman problem,Electronic circuit,Distributed computing
Conference
Volume
ISSN
Citations 
8751
0302-9743
0
PageRank 
References 
Authors
0.34
4
3
Name
Order
Citations
PageRank
Dimitrios Stathis1244.20
Ioannis Vourkas29916.26
Sirakoulis Georgios Ch.330660.41