Skip to main content
SpringerLink
Log in

Memristive Computing for NP-Hard AI Problems

  • Chapter
  • First Online:
Memristor-Based Nanoelectronic Computing Circuits and Architectures

Part of the book series: Emergence, Complexity and Computation ((ECC,volume 19))

  • 1679 Accesses

Abstract

Reported properties of network configurations of memristors, as presented in Chap. 7, showed that composite memristive systems significantly improve the efficiency of logic operations via massive analog parallelism. The sparse nature of such network-based computations, though, resembles certain operational features and computing capabilities of Cellular Automata (CA), a powerful parallel computational model which leads to scalable hardware (HW) architectures with very high device densities. When CA-based models are implemented in HW, the circuit design reduces to the design of a single cell and the overall layout results regular with exclusively local inter-connections. Moreover, the models are executed fast by exploiting the parallelism of the CA structure. This chapter focuses on a circuit-level CA-inspired approach for in-memory computing schemes using memristors and composite memristive components. A generalized CA cell circuit design methodology is described, which facilitates the implementation of CA-based computing algorithms, exploiting the threshold-type resistance switching behavior of memristors and of multi-state memristive components. Several CA cell example structures are designed and employed in array-like circuit geometries, where computations regarding classic NP-hard problems of various areas of artificial intelligence (AI) take place. The main contribution of this methodology consists in the combination of unconventional computing with CA and the unique circuit properties of memristors, aiming to set off parallel computing capabilities and improve CA-based hardware accelerators for NP-hard AI problems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. International Technology Roadmap for Semiconductors (ITRS) (2013) (Online), Available: http://www.itrs.net/. Accessed June 2014

  2. M. Klimo, O. Such, Memristors can implement fuzzy logic (2011) (Online), Available: http://arxiv.org/abs/1110.2074

  3. S. Park, J. Park, S. Kim, W. Lee, B.H. Lee, H. Hwang, Programmable analogue circuits with multilevel memristive device. IET Electron Lett 48(22), 1415–1417 (2012)

    Article  Google Scholar 

  4. V. Ntinas, I. Vourkas, G. C. Sirakoulis, LC filters with enhanced memristive damping, in IEEE Int. Symp. Circuits Syst. (ISCAS), Lisbon, 2015

    Google Scholar 

  5. M. Di Ventra, Y.V. Pershin, The parallel approach. Nat. Phys. 9, 200–202 (2013)

    Article  Google Scholar 

  6. D.B. Strukov, K.K. Likharev, CMOL FPGA: a reconfigurable architecture for hybrid digital circuits with two-terminal nanodevices. Nanotechnology 16(6), 888–900 (2005)

    Article  Google Scholar 

  7. A.A. El-Slehdar, A.H. Fouad, A.G. Radwan, Memristor based N-bits redundant binary adder. Microelectron. J. 46(3), 207–213 (2015)

    Article  Google Scholar 

  8. Y. Pershin, M. Di Ventra, Practical approach to programmable analog circuits with memristors. IEEE Trans. Circ. Syst. I Regul. Pap. 57(8), 1857–1864 (2010)

    Article  MathSciNet  Google Scholar 

  9. S. Shin, K. Kim, S. Kang, Memristor applications for programmable analog ICs. IEEE Trans. Nanotechnol. 10(2), 266–274 (2011)

    Article  Google Scholar 

  10. E.A. Vittoz, Future of analog in the VLSI environment, in IEEE Int. Symp. Circuits Syst. (ISCAS), New Orleans, LA, USA, 1990

    Google Scholar 

  11. M. Laiho, E. Lehtonen, Arithmetic Operations within Memristor-Based Analog Memory, in 12th International Workshop on Cellular Nanoscale Networks and Their Applications (CNNA), Berkeley, CA, 2010

    Google Scholar 

  12. Y.V. Pershin, M. Di Ventra, Solving mazes with memristors: a massively parallel approach. Phys. Rev. E 84, 046703 (2011)

    Article  Google Scholar 

  13. Y. Leblebici, H. Ozdemir, A. Kepkep, U. Cilingiroglu, A compact high-speed (31, 5) parallel counter circuit based on capacitive threshold logic gates. IEEE J. Solid State Circuits 31(8), 1177–1183 (1996)

    Article  Google Scholar 

  14. M. Halbach, R. Hoffmann, Implementing cellular automata in FPGA logic, in 18th International Parallel and Distributed Processing Symposium (IPDPS), Santa Fe, New Mexico, 2004

    Google Scholar 

  15. I. Vourkas, G.C. Sirakoulis, On the generalization of composite memristive network structures for computational analog/digital circuits and systems. Microelectron. J. 45(11), 1380–1391 (2014)

    Article  Google Scholar 

  16. G. Papandroulidakis, I. Vourkas, N. Vasileiadis, G.C. Sirakoulis, Boolean Logic Operations and Computing Circuits Based on Memristors. IEEE Trans. Circ. Syst. II Express Briefs 61(12), 972–976 (2014)

    Google Scholar 

  17. I. Vourkas, D. Stathis, G.C. Sirakoulis, Massively parallel analog computing: Ariadne’s thread was made of memristors. IEEE Trans. Emerg. Top. Comput. (2015 in press). doi: 10.1109/TETC.2015.2420353

  18. B. Chopard, Cellular automata modeling of physical systems, in Computational Complexity, ed. by R.A. Meyers (Springer International Publishing, New York, NY, 2012), pp. 407–433

    Chapter  Google Scholar 

  19. S. Wolfram, Cellular Automata and Complexity, Reading (Addison Wesley, MA, 1994)

    MATH  Google Scholar 

  20. A.I. Adamatzky, Computation of Shortest path in cellular automata. Math. Comput. Modelling 23(4), 105–113 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  21. K. Charalampous, A. Amanatiadis, A. Gasteratos, Efficient Robot Path Planning in the presence of dynamically expanding obstacles, in 10th International conference on Cellular Automata for Research and Industry (ACRI), Santorini island, Greece, 2012

    Google Scholar 

  22. I. Georgoudas, G.C. Sirakoulis, E.M. Skordilis, I. Andreadis, A cellular automaton simulation tool for modelling seismicity in the region of Xanthi. Environ. Model Softw. 22(10), 1455–1464 (2007)

    Article  Google Scholar 

  23. I. Georgoudas, P. Kyriakos, G.C. Sirakoulis, I. Andreadis, An FPGA implemented cellular automaton crowd evacuation model inspired by the electrostatic-induced potential fields. Microprocess. Microsyst. 34(7–8), 285–300 (2010)

    Article  Google Scholar 

  24. I. Karafyllidis, A model for the prediction of oil slick movement and spreading using cellular automata. Environ. Int. 23(6), 839–850 (1997)

    Article  Google Scholar 

  25. I. Karafyllidis, A. Thanailakis, A model for predicting forest fire spreading using cellular automata. Ecol. Model. 99, 87–97 (1997)

    Article  Google Scholar 

  26. C. Mizas, G.C. Sirakoulis, V. Mardiris, I. Karafyllidis, N. Glykos, R. Sandaltzopoulos, Reconstruction of DNA sequences using genetic algorithms and cellular automata: towards mutation prediction? Biosystems 92(1), 61–68 (2008)

    Article  Google Scholar 

  27. G.C. Sirakoulis, I. Karafyllidis, A. Thanailakis, A cellular automaton model for the effect of population movement on epidemic propagation. Ecol. Model. 133(3), 209–223 (2000)

    Article  Google Scholar 

  28. M.-A. Tsompanas, G.C. Sirakoulis, Modeling and hardware implementation of an amoeba-like cellular automaton. Bioinspir. Biomim. 7, 036013 (2012)

    Google Scholar 

  29. I. Vourkas, G.C. Sirakoulis, FPGA based cellular automata for environmental modeling, in 19th IEEE International Conf. Electronics, Circuits, and Systems (ICECS), Seville, Spain, 2012

    Google Scholar 

  30. P. Progias, G.C. Sirakoulis, An FPGA processor for modelling wildfire spread. Math. Comput. Model. 57(5–6), 1436–1452 (2013)

    Article  MathSciNet  Google Scholar 

  31. J. von Neumann, Theory of self-reproducing automata, Urbana (University of Illinois, IL, 1966)

    Google Scholar 

  32. S. Golzari, M.R. Meybodi, A maze routing algorithm based on two dimensional cellular automata, in 7th International Conference of Cellular Automata for Research and Industry (ACRI), Perpignan, France, 2006

    Google Scholar 

  33. M. Itoh, L.O. Chua, Memristor cellular automata and memristor discrete-time cellular neural networks. Int. J. Bifurcat. Chaos 19(11), 3605–3656 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  34. I. Vourkas, G.C. Sirakoulis, A novel design and modeling paradigm for memristor-based crossbar circuits. IEEE Trans. Nanotechnol. 11(6), 1151–1159 (2012)

    Article  Google Scholar 

  35. Easy Java Simulations (EJS) (Online). Available: http://fem.um.es/Ejs/. Accessed 2014

  36. D. Stathis, I. Vourkas, G.C. Sirakoulis, Shortest path computing using memristor-based circuits and cellular automata, in 11th International Conference on Cellular Automata for Research and Industry (ACRI), Krakow, Poland, 2014

    Google Scholar 

  37. J.W. Moon, L. Moser, On cliques in graphs. Isr. J. Math. 3(1), 23–28 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  38. A. Ben-Dor, R. Shamir, Z. Yakhini, Clustering gene expression patterns. J. Comput. Biol. 6(3–4), 281–297 (1999)

    Article  Google Scholar 

  39. J. Cong, M.L. Smith, A parallel bottom-up clustering algorithm with applications to circuit partitioning in VLSI design, in 30th International Design Automation Conference, New York, NY, 2003

    Google Scholar 

  40. V. Spirin and L.A. Mirny, Protein complexes and functional modules in molecular networks. Proc. Nat. Acad. Sci. U.S.A. 100(21), 12123–12128 (2003)

    Google Scholar 

  41. E. Balas, C.S. Yu, Finding a maximum clique in an arbitrary graph. SIAM J. Comput. 15(4), 1054–1068 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  42. Y.S. Reddy, Solving max-clique using cellular neural network, in 9th International Workshop on Cellular Neural Networks and Their Applications (CNNA), Hsinchu, Taiwan, 2005

    Google Scholar 

  43. D.E. Knuth, The art of computer programming, 2nd ed., vol. 3. Sorting and Searching, Reading, MA: Addison-Wesley (1998)

    Google Scholar 

  44. J.L. Gordillo, J. V. Luna, Parallel sort on a linear array of cellular automata, in IEEE International Conference on Systems, Man, and Cybernetics, Humans, Information and Technology, San Antonio, TX, 1994

    Google Scholar 

  45. I. Vourkas, D. Stathis, G.C. Sirakoulis, Memristor-based parallel sorting approach using one-dimensional cellular automata. IET Electron. Lett. 50(24), 1819–1821 (2014)

    Google Scholar 

  46. R. Lewis, A general-purpose hill-climbing method for order independent minimum grouping problems: a case study in graph colouring and bin packing. Comput. Oper. Res. 36(7), 2295–2310 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  47. E.G. Coffman Jr, J. Csirik, G. Galambos, S. Martello, D. Vigo, Bin packing approximation algorithms: survey and classification, in Handbook of Combinatorial Optimization, ed. by P.M. Pardalos, D. Du, R.L. Graham (Springer International Publishing, New York, NY, 2013), pp. 455–531

    Chapter  Google Scholar 

  48. D.S. Johnson, Fast algorithms for bin packing. J. Comput. Syst. Sci. 8(3), 272–314 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  49. D. Stathis, I. Vourkas, G.C. Sirakoulis, Solving AI problems with memristors: a case study for optimal “bin packing”, in 18th Panhellenic Conference on Informatics (PCI), Athens, Greece, 2014

    Google Scholar 

  50. A. Scholl, R. Klein, Bin packing, problem description, solving procedures, and benchmark data sets, (Online). Available: http://www.wiwi.uni-jena.de/entscheidung/binpp/index.htm. Accessed 15 Mar 2015

  51. G. Dosa, The tight bound of first fit decreasing bin-packing algorithm is FFD(I) ≤ 11/9OPT(I) + 6/9, in Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, ed. B. Chen, M. Paterson, G. Zhang. Lecture Notes in Computer Science, vol. 4614 (Springer, 2007), pp. 1–11

    Google Scholar 

  52. H. Kellerer, U. Pferschy, D. Pisinger, in Knapsack Problems (Springer, Berlin, 2004)

    Google Scholar 

  53. S. Martello, P. Toth, Knapsack Problems: Algorithms and Computer Implementation, New York (John Wiley and Sons, NY, 1990)

    MATH  Google Scholar 

  54. G.B. Dantzig, Discrete-variable extremum problems. Oper. Res. 5(2), 266–288 (1957)

    Article  MathSciNet  Google Scholar 

  55. J. Burkardt, sets of data associated with specific problems or subjects, (Online). Available: http://people.sc.fsu.edu/~jburkardt/datasets. Accessed 1 June 2014

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, Democritus University of Thrace, Xanthi, Greece

    Ioannis Vourkas & Georgios Ch. Sirakoulis

Authors
  1. Ioannis Vourkas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Georgios Ch. Sirakoulis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ioannis Vourkas .

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Vourkas, I., Sirakoulis, G.C. (2016). Memristive Computing for NP-Hard AI Problems. In: Memristor-Based Nanoelectronic Computing Circuits and Architectures. Emergence, Complexity and Computation, vol 19. Springer, Cham. https://doi.org/10.1007/978-3-319-22647-7_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-22647-7_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-22646-0

  • Online ISBN: 978-3-319-22647-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation