{"id":247304,"date":"2021-05-11T22:58:30","date_gmt":"2021-05-11T19:58:30","guid":{"rendered":"https:\/\/en.buradabiliyorum.com\/novel-circuitry-solves-multiple-computationally-intensive-problems-with-minimum-energy\/"},"modified":"2021-05-11T22:58:30","modified_gmt":"2021-05-11T19:58:30","slug":"novel-circuitry-solves-multiple-computationally-intensive-problems-with-minimum-energy","status":"publish","type":"post","link":"https:\/\/buradabiliyorum.com\/en\/novel-circuitry-solves-multiple-computationally-intensive-problems-with-minimum-energy\/","title":{"rendered":"#Novel circuitry solves multiple computationally intensive problems with minimum energy"},"content":{"rendered":"

“#Novel circuitry solves multiple computationally intensive problems with minimum energy<\/strong>”<\/p>\n

\n
\n
\n
\"Novel
\n n\/a Credit: NIST
\n <\/figcaption><\/figure>\n<\/div>\n<\/div>\n

From the branching pattern of leaf veins to the variety of interconnected pathways that spread the coronavirus, nature thrives on networks\u2014grids that link the different components of complex systems. Networks underlie such real-life problems as determining the most efficient route for a trucking company to deliver life-saving drugs and calculating the smallest number of mutations required to transform one string of DNA into another.<\/p>\n

Instead of relying on software to tackle these computationally intensive puzzles, researchers at the National Institute of Standards and Technology<\/a> (NIST) took an unconventional app<\/a>roach. They created a design for an electronic hardware system that directly replicates the architecture of many types of networks.<\/p>\n

The researchers demonstrated that their proposed hardware system, using a computational technique known as race logic, can solve a variety of complex puzzles both rapidly and with a minimum expenditure of energy. Race logic requires less power and solves network problems more rapidly than competing general<\/a>-purposed computers.<\/p>\n

The scientists, who include Advait Madhavan of NIST and the University of Maryland in College Park and Matthew Daniels and Mark Stiles of NIST, describe their work in Volume 17, Issue 3 (May 2021) of the ACM Journal on Emerging Technologies in Computing Systems<\/i>.<\/p>\n

A key feature of race logic is that it encodes information differently from a standard computer. Digital information is typically encoded and processed using values of computer bits\u2014a “1” if a logic statement is true and a “0” if it’s false. When a bit flips its value, say from 0 to 1, it means that a particular logic operation has been performed in order to solve a mathematical problem.<\/p>\n

\n
\n
\"Novel
\n Credit: NIST
\n <\/figcaption><\/figure>\n<\/div>\n<\/div>\n

In contrast, race logic encodes and processes information by representing it as time signals\u2014the time at which a particular group of computer bits transitions, or flips, from 0 to 1. Large numbers of bit flips are the primary cause of the large power consumption in standard computers. In this respect, race logic offers an advantage because signals encoded in time involve only a few carefully orchestrated bit flips to process information, requiring much less power than signals encoded as 0s or 1s.<\/p>\n

Computation is then performed by delaying some time signals relative to others, determined by the physics of the system under study. For example, consider a group of truck drivers who starts at point A and must deliver medicine to point E as fast as possible. Different possible routes go through three intersections\u2014call them B, C and D. To determine the most efficient route, the race logic circuit evaluates each possible segment of the trip, such as A-B and A-D. If A-B takes more time to travel<\/a> than A-D, whether it’s because the path is longer or has more traffic, A-B will be assigned a longer delay time. In the team’s design, the longer time delay is implemented by adding additional resistance to the slower segment.
\n <\/p>\n

Race logic does indeed involve a race, but in this contest all the truck drivers initially drive in different directions. To determine which route to the final destination is fastest, they race over all possible routes through the different intermedia<\/a>te delivery points. In the new circuit, the NIST researchers inserted a group of time-encoded signals at the starting point, each acting as a different driver that speeds through the team’s simulated hardware circuit.<\/p>\n

Whenever a driver arrives at one of her intermediate destination points in the race, the model system sends out new drivers (new time signals) who fan out in different directions to the remaining destinations. If a driver arrives at a destination that another driver has already been to, that driver drops out, because her path is no longer competitive. The winner of the race\u2014the first driver to arrive at the end of the circuit\u2014indicates the solution to the particular puzzle that the hardware was programmed to solve.<\/p>\n

\n
\n
\"Novel
\n Credit: NIST
\n <\/figcaption><\/figure>\n<\/div>\n<\/div>\n

Madhavan began pioneering work on race logic circuits while a graduate student at the University of California, Santa Barbara, in 2016. Those first systems used specialized circuits and silicon chips that were designed to simulate specific networks, such as DNA manipulation, and therefore could solve only a limited number of network-related problems.<\/p>\n

At NIST, Madhavan and his colleagues have begun work on more advanced race logic circuits. Simulations conducted by Madhavan, Daniels and Stiles showed that their design, which has not yet been incorporated into a working device, can handle a much broader class of networks, enabling race logic to tackle a wider variety of computational puzzles. These puzzles include finding the best alignment between two proteins or two strings of nucleotides\u2014the molecules that form the building blocks of DNA\u2014and determining the shortest path between two destinations in a network.<\/p>\n

“We showed how to use memory, which has not been used in previous implementations of race logic, to create a more general temporal computer,” said Stiles. “Incorporating memory will allow us to treat a broad class of problems with the next race logic chip that we are planning to make,” he added.\n <\/p>\n\n

\n

A future of helpful engineered ‘living’ machines?<\/a>\n <\/div>\n

\n
\n More information:<\/strong>
\n Advait Madhavan et al, Temporal State Machines: Using Temporal Memory to Stitch Time-based Graph Computations, ACM Journal on Emerging Technologies in Computing Systems<\/i> (2021). DOI: 10.1145\/3451214<\/a><\/p><\/div>\n
\n Provided by
\n National Institute of Standards and Technology
\n
\n <\/svg><\/a><\/p><\/div>\n

<\/p>\n

\n

Citation<\/strong>:
\n Novel circuitry solves multiple computationally intensive problems with minimum energy (2021, May 11)
\n retrieved 11 May 2021
\n from https:\/\/techxplore.com\/news<\/a>\/2021-05-circuitry-multiple-computationally-intensive-problems.html<\/p>\n

This document is subject to copyright. Apart from any fair dealing for the purpose of private study or research, no
\n part may be reproduced without the written permission. The content is provided for information purposes only.<\/p><\/div>\n<\/p><\/div>\n