Google Play icon

Nanoscale magnets could compute complex functions significantly faster than conventional computers

Share
Posted October 28, 2015

Researchers from College of Engineering at University of South Florida have proposed a new form of computing that uses circular nanomagnets to solve quadratic optimization problems orders of magnitude faster than that of a conventional computer. A wide range of application domains can be potentially accelerated through this research such as finding patterns in social media, error-correcting codes to Big Data and biosciences.

Illustration by Ryan Wakefield

Illustration by Ryan Wakefield

Magnets have been used as computer memory/data storage since as early as 1920; they even made an entry into common hardware terminology like multi-“core”. The field of nanomagnetism has recently attracted tremendous attention as it can potentially deliver low-power, high speed and dense non-volatile memories. It is now possible to engineer the size, shape, spacing, orientation and composition of sub-100 nm magnetic structures. This has spurred the exploration of nanomagnets for unconventional computing paradigms.

In this work “Non Boolean computing with nanomagnets for computer vision applications” as published in Nature Nanotechnology1 , the USF research team has harnessed the energy-minimization nature of nanomagnetic systems to solve the quadratic optimization problems that arise in computer vision applications, which are computationally expensive. By exploiting the magnetization states of nanomagnetic disks as state representations of a vortex and single domain, the team has created a modeling framework to address the vortex and in-plane single domain in a unified framework and developed a magnetic Hamiltonian which is quadratic in nature. The implemented magnetic system can identify the salient features of a given image with more than 85% true positive rate. This form of computing, on average, is 1,528 times faster than IBM ILOG CPLEX (an industry standard software optimizer) with sparse affinity matrices (four neighbor), and 468 times faster with denser (eight neighbor) affinity matrices. These results show the potential of this alternative computing method to develop a magnetic coprocessor that might solve complex problems in fewer clock cycles than traditional processors.

Source: NSFUniversity of South Florida

Featured news from related categories:

Technology Org App
Google Play icon
85,387 science & technology articles

Most Popular Articles

  1. New treatment may reverse celiac disease (October 22, 2019)
  2. "Helical Engine" Proposed by NASA Engineer could Reach 99% the Speed of Light. But could it, really? (October 17, 2019)
  3. New Class of Painkillers Offers all the Benefits of Opioids, Minus the Side Effects and Addictiveness (October 16, 2019)
  4. The World's Energy Storage Powerhouse (November 1, 2019)
  5. Plastic waste may be headed for the microwave (October 18, 2019)

Follow us

Facebook   Twitter   Pinterest   Tumblr   RSS   Newsletter via Email