STAP: An Architecture and Design Tool for Automata Processing on Memristor TCAMs

2022 ◽  
Vol 18 (2) ◽  
pp. 1-22
Author(s):  
João Paulo Cardoso de Lima ◽  
Marcelo Brandalero ◽  
Michael Hübner ◽  
Luigi Carro
Keyword(s):  
Finite Automata ◽  
Design Tool ◽  
Design Flow ◽  
Von Neumann ◽  
Mapping Algorithm ◽  
Processing Elements ◽  
Finite State ◽  
Specific Mapping ◽  
Architecture And Design ◽  
Communication Demands

Accelerating finite-state automata benefits several emerging application domains that are built on pattern matching. In-memory architectures, such as the Automata Processor (AP), are efficient to speed them up, at least for outperforming traditional von-Neumann architectures. In spite of the AP’s massive parallelism, current APs suffer from poor memory density, inefficient routing architectures, and limited capabilities. Although these limitations can be lessened by emerging memory technologies, its architecture is still the major source of huge communication demands and lack of scalability. To address these issues, we present STAP , a Scalable TCAM-based architecture for Automata Processing . STAP adopts a reconfigurable array of processing elements, which are based on memristive Ternary CAMs (TCAMs), to efficiently implement Non-deterministic finite automata (NFAs) through proper encoding and mapping methods. The CAD tool for STAP integrates the design flow of automata applications, a specific mapping algorithm, and place and route tools for connecting processing elements by RRAM-based programmable interconnects. Results showed 1.47× higher throughput when processing 16-bit input symbols, and improvements of 3.9× and 25× on state and routing densities over the state-of-the-art AP, while preserving 10 4 programming cycles.

scholarly journals A Design Technique for Adapting Number and Boundaries of Reconfigurable Modules at Runtime

2009 ◽  
Vol 2009 ◽  
pp. 1-10 ◽  
Author(s):  
Thilo Pionteck ◽  
Roman Koch ◽  
Carsten Albrecht ◽  
Erik Maehle
Keyword(s):  
System Architecture ◽  
Design Tool ◽  
Design Flow ◽  
Design Tools ◽  
System Architectures ◽  
Flexible System ◽  
Reconfigurable System ◽  
Communication Needs ◽  
On Chip ◽  
Architecture And Design

Runtime reconfigurable system-on-chip designs for FPGAs pose manifold demands on the underlying system architecture and design tool capabilities. The system architecture has to support varying communication needs of a changing number of processing units mapped onto diverse locations. Design tools should support an arbitrary placement of processing modules and the adjustment of boundaries of reconfigurable regions to the size of the actually instantiated processing modules. While few works address the design of flexible system architectures, the adjustment of boundaries of reconfigurable regions to the size of the actually instantiated processing modules is hardly ever considered due to design tool limitations. In this paper, a technique for circumventing this restriction is presented. It allows for a rededication of the reconfigurable area to a different number of individually sized reconfigurable regions. This technique is embedded in the design flow of a runtime reconfigurable system architecture for Xilinx Virtex-4 FPGAs. The system architecture will also be presented to provide a realistic application example.

BORDERS AND FINITE AUTOMATA

2007 ◽  
Vol 18 (04) ◽  
pp. 859-871
Author(s):  
MARTIN ŠIMŮNEK ◽  
BOŘIVOJ MELICHAR
Keyword(s):  
Pattern Matching ◽  
Hamming Distance ◽  
Finite Automata ◽  
Music Analysis ◽  
Theoretical Description ◽  
Specific Form ◽  
Distance Measures ◽  
Computer Assisted ◽  
Finite State ◽  
Finite State Transducer

A border of a string is a prefix of the string that is simultaneously its suffix. It is one of the basic stringology keystones used as a part of many algorithms in pattern matching, molecular biology, computer-assisted music analysis and others. The paper offers the automata-theoretical description of Iliopoulos's ALL_BORDERS algorithm. The algorithm finds all borders of a string with don't care symbols. We show that ALL_BORDERS algorithm is an implementation of a finite state transducer of specific form. We describe how such a transducer can be constructed and what should be the input string like. The described transducer finds a set of lengths of all borders. Last but not least, we define approximate borders and show how to find all approximate borders of a string when we concern Hamming distance definition. Our solution of this problem is based on transducers again. This allows us to use analogy with automata-based pattern matching methods. Finally we discuss conditions under which the same principle can be used for other distance measures.

scholarly journals RULE-BASED SYLLABIFICATION OF KOREAN WORDS WRITTEN IN LATIN USING DETERMINISTIC FINITE AUTOMATA MODELS

2018 ◽  
Vol 2 (1) ◽  
pp. 75-85
Author(s):  
Rouly Doharma Sihite ◽  
Aditya Wikan Mahastama
Keyword(s):  
Success Rate ◽  
Statistical Approach ◽  
Markov Models ◽  
Finite Automata ◽  
Writing System ◽  
Test Results ◽  
Writing Systems ◽  
Research Focus ◽  
Finite State ◽  
Catch Up

Transliteration is still a challenge in helping people to read or write from one to another writing systems. Korean transliteration has been a topic of research to automate the conversion between Hangul (Korean writing system) and Latin characters. Previous works have been done in transliterating Hangul to Latin, using statistical approach (72.2% accuracy) and Extended Markov Models (54.9% accuracy). This research focus on transliterating Latin (romanised) Korean words into Hangul, as many learners of Korean began using Latin first. Selected method is modeling the probable vowel and consonant forms and problable vowel and consonant sequences using Finite State Automata to avoid training. These models are then coded into rules which applied and tested to 100 random Korean words. Initial test results only 40% success rate in transliterating due to the nature that consonants have to be labeled as initial or final of a syllable, and some consonants missed the modeled rules. Additional rules are then added to catch-up and merge these consonants into existing proper syllables, which increased the success rate to 92%. This result is analysed further and it is found that certain consonants sequence caused syllabification problem if exist in a certain position. Other additional rules was inserted and yields 99% final success rate which also is the accuracy of transliterating Korean words written in Latin into Hangul characters in compund syllables.

Preface

1997 ◽  
Vol 11 (07) ◽  
pp. 1023-1024
Author(s):  
Serge Miguet ◽  
Annick Montanvert ◽  
P. S. P. Wang
Keyword(s):  
Finite State Machine ◽  
Finite Automata ◽  
Upper Bounds ◽  
Two Dimensional ◽  
Turing Machines ◽  
Closure Properties ◽  
Working Space ◽  
Finite State ◽  
The Individual ◽  
Alternating Turing Machines

Several nonclosure properties of each class of sets accepted by two-dimensional alternating one-marker automata, alternating one-marker automata with only universal states, nondeterministic one-marker automata, deterministic one-marker automata, alternating finite automata, and alternating finite automata with only universal states are shown. To do this, we first establish the upper bounds of the working space used by "three-way" alternating Turing machines with only universal states to simulate those "four-way" non-storage machines. These bounds provide us a simplified and unified proof method for the whole variants of one-marker and/or alternating finite state machine, without directly analyzing the complex behavior of the individual four-way machine on two-dimensional rectangular input tapes. We also summarize the known closure properties including Boolean closures for all the variants of two-dimensional alternating one-marker automata.

LIMITED AUTOMATA AND REGULAR LANGUAGES

2014 ◽  
Vol 25 (07) ◽  
pp. 897-916 ◽  
Author(s):  
GIOVANNI PIGHIZZINI ◽  
ANDREA PISONI
Keyword(s):  
Finite Automata ◽  
Upper And Lower Bounds ◽  
Finite State Automata ◽  
Turing Machines ◽  
Double Exponential ◽  
Finite State ◽  
A Cell ◽  
Fixed Constant ◽  
The One ◽  
Context Free

Limited automata are one-tape Turing machines that are allowed to rewrite the content of any tape cell only in the first d visits, for a fixed constant d. In the case d = 1, namely, when a rewriting is possible only during the first visit to a cell, these models have the same power of finite state automata. We prove state upper and lower bounds for the conversion of 1-limited automata into finite state automata. In particular, we prove a double exponential state gap between nondeterministic 1-limited automata and one-way deterministic finite automata. The gap reduces to a single exponential in the case of deterministic 1-limited automata. This also implies an exponential state gap between nondeterministic and deterministic 1-limited automata. Another consequence is that 1-limited automata can have less states than equivalent two-way nondeterministic finite automata. We show that this is true even if we restrict to the case of the one-letter input alphabet. For each d ≥ 2, d-limited automata are known to characterize the class of context-free languages. Using the Chomsky-Schützenberger representation for contextfree languages, we present a new conversion from context-free languages into 2-limited automata.

Architecture and Design Flow for a Highly Efficient Structured ASIC

2013 ◽  
Vol 21 (3) ◽  
pp. 424-433 ◽  
Author(s):  
Man-Ho Ho ◽  
Yan-Qing Ai ◽  
Thomas Chun-Pong Chau ◽  
Steve C. L. Yuen ◽  
Chiu-Sing Choy ◽  
...  
Keyword(s):  
Design Flow ◽  
Highly Efficient ◽  
Architecture And Design

Turbulent Flow Simulation of a Runner for Francis Hydraulic Turbines Using Pseudo-Compressibility

1996 ◽  
Vol 118 (2) ◽  
pp. 285-291 ◽  
Author(s):  
Chuichi Arakawa ◽  
Yi Qian ◽  
Takashi Kubota
Keyword(s):  
Compressible Flows ◽  
Incompressible Flows ◽  
Three Dimensional ◽  
Flow Simulation ◽  
Leading Edge ◽  
Design Tool ◽  
Design Flow ◽  
Navier Stokes ◽  
Small Computer ◽  
Strong Vortex

A three-dimensional Navier-Stokes code with pseudo-compressibility, an implicit formulation of finite difference, and a k – ε two-equation turbulence model has been developed for the Francis hydraulic runner. The viscous flow in the rotating field can be simulated well in the design flow operating condition as well as in the off-design conditions in which a strong vortex occurs due to the separation near the leading edge. Because the code employs an implicit algorithm and a wall function near the wall, it does not require a large CPU time. It can therefore be used on a small computer such as the desk-top workstation, and is available for use as a design tool. The same kind of algorithm that is used for compressible flows has been found to be appropriate for the simulation of complex incompressible flows in the field of turbomachinery.

scholarly journals On deterministic 1-limited 5′ → 3′ sensing Watson–Crick finite-state transducers

2021 ◽  
Vol 55 ◽  
pp. 5
Author(s):  
Benedek Nagy ◽  
Zita Kovács
Keyword(s):  
Dna Computing ◽  
Finite Automata ◽  
Theoretical Computer Science ◽  
Theoretical Computer ◽  
Double Stranded Dna ◽  
Finite State Transducers ◽  
Special Cases ◽  
Finite State ◽  
Dna Strands ◽  
Processing Order

Finite automata and finite state transducers belong to the bases of (theoretical) computer science with many applications. On the other hand, DNA computing and related bio-inspired paradigms are relatively new fields of computing. Watson–Crick automata are in the intersection of the above fields. These finite automata have two reading heads as they read the upper and lower strands of the input DNA molecule, respectively. In 5′ → 3′ Watson–Crick automata the two reading heads move in the same biochemical direction, that is, from the 5′ end of the strand to the direction of the 3′ end. However, in the double-stranded DNA, the DNA strands are directed in opposite way to each other, therefore 5′ → 3′ Watson–Crick automata read the input from the two extremes. In sensing 5′ → 3′ automata the automata sense if the two heads are at the same position, moreover, the computing process is finished at that time. Based on this class of automata, we define WK transducers such that, at each transition, exactly one input letter is being processed, and exactly one output letter is written on a normal output tape. Some special cases are defined and analyzed, e.g., when only one of the reading heads is being used and when the transducer has only one state. We also show that the minimal transducer is uniquely defined if the transducer is deterministic and it has marked output, i.e., the output letter written in a step identifies the reading head that is used in that transition. We have also used the functions ‘processing order’ and ‘reading heads’ to analyze these transducers.

scholarly journals Penerapan Finite State Automata Pada Vending Machine Penjual Obat Non Resep Dokter Dan Keperluan Medis

2021 ◽  
Vol 9 (2) ◽  
pp. 08-14
Author(s):  
Eko Supriyanto ◽  
Angga Ardiansyah ◽  
Frieyadie Frieyadie ◽  
Sri Rahayu ◽  
Windu Gata
Keyword(s):  
Finite Automata ◽  
Finite State Automata ◽  
Deterministic Finite Automata ◽  
Finite State

Kebutuhan obat non resep dokter dan keperluan medis menjadi salah satu kebutuhan yang sangat penting untuk dipenuhi dengan mudah,cepat, tepat, dan aman bagi masyarakat saat ini, beragamnya pilihan  obat yang dijual   mengharuskan masyarakat mampu memilih dengan cermat dan tepat dalam membeli obat sesuai dengan kebutuhan penyakit yang dialami,informasi tentang kandungan, aturan pakai dan efek samping dari obat juga sangat penting untuk diketahui masyarakat guna memaksimalkan maanfaat dari obat yang dikonsumsi. Sistem penjualan obat yang tersedia saat ini adalah dengan penjualan langsung di apotek, toko kelontong dan secara daring yang memiliki keterbatasan dalam sebaran ketersedian toko dan waktu pelayanan yang terbatas. Penelitian ini bertujuan untuk memberikan alternatif sistem penjualan obat non resep dokter dan keperluan medis dengan memanfaatkan perkembangan teknologi vending machine (VM) menggunakan  finite state automata (FSA model Non-deterministic Finite Automata (NFA)). Dengan kelebihan penjualan menggunakan VM yang dapat diletakan dimana saja dan dapat beroperasi kapan saja membuat penjualan dengan sistem ini dapat tersedia kapanpun dan dimanapun untuk memenuhi kebutuhan obat dan keperluan medis bagi masyarakat yang mendesak dengan mudah,cepat, tepat, dan aman. Metode yang diterapkan dalam Penerapan FSA pada VM Penjual Obat Non Resep Dokter dan Keperluan Medis ini antara lain Finite State Automata VM Obat Non Resep Dokter dan Keperluan Medis, Perancangan Sistem VM Obat Non Resep Dokter dan Keperluan Medis,dan Desain VM Obat Non Resep Dokter dan Keperluan Medis. Berdasarkan perancangan FSA VM diatas, dihasilkan VM Penjual Obat Non Resep Dokter dan Keperluan Medis yang dapat diletakan dimana saja dan tersedia kapan saja, sehingga dapat disimpulkan penggunaan finite state automata (FSA) model Non-deterministic Finite Automata (NFA) dapat dimanfaatkan dalam pembuatan VM Penjual Obat Non Resep Dokter dan Keperluan Medis dengan menyediakan menu pilihan metode pembayaran tunai dan non tunai, kebutuhan akan obat dan keperluan medis yang mendesak bagi masyarakat dapat terpenuhi dengan mudah, cepat, tepat dan aman.

Sign in / Sign up

Export Citation Format

Share Document