Conference paper Open Access

Time-division Multiplexing Automata Processor

Jintao Yu; Hoang Anh Du Nguyen; Muath Abu Lebdeh; Mottaqiallah Taouil; Said Hamdioui


MARC21 XML Export

<?xml version='1.0' encoding='UTF-8'?>
<record xmlns="http://www.loc.gov/MARC21/slim">
  <leader>00000nam##2200000uu#4500</leader>
  <datafield tag="041" ind1=" " ind2=" ">
    <subfield code="a">eng</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">time-division multiplexing</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">automata</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="a">parallel processing</subfield>
  </datafield>
  <controlfield tag="005">20200120170149.0</controlfield>
  <controlfield tag="001">2533075</controlfield>
  <datafield tag="711" ind1=" " ind2=" ">
    <subfield code="d">25-29 March, 2019</subfield>
    <subfield code="g">DATE</subfield>
    <subfield code="a">Design, Automation and test in Europe 2019</subfield>
    <subfield code="c">Florence, IT</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Laboratory of Computer Engineering, Delft University of Technology, Delft (NL)</subfield>
    <subfield code="a">Hoang Anh Du Nguyen</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Laboratory of Computer Engineering, Delft University of Technology, Delft (NL)</subfield>
    <subfield code="a">Muath Abu Lebdeh</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Laboratory of Computer Engineering, Delft University of Technology, Delft (NL)</subfield>
    <subfield code="a">Mottaqiallah Taouil</subfield>
  </datafield>
  <datafield tag="700" ind1=" " ind2=" ">
    <subfield code="u">Laboratory of Computer Engineering, Delft University of Technology, Delft (NL)</subfield>
    <subfield code="a">Said Hamdioui</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="s">627563</subfield>
    <subfield code="z">md5:e6f0231db1cd4426aa201d27ae8b7723</subfield>
    <subfield code="u">https://zenodo.org/record/2533075/files/tdm_automata_postprint.pdf</subfield>
  </datafield>
  <datafield tag="542" ind1=" " ind2=" ">
    <subfield code="l">open</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2=" ">
    <subfield code="y">Conference website</subfield>
    <subfield code="u">https://www.date-conference.com/</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="c">2019-01-07</subfield>
  </datafield>
  <datafield tag="909" ind1="C" ind2="O">
    <subfield code="p">openaire</subfield>
    <subfield code="o">oai:zenodo.org:2533075</subfield>
  </datafield>
  <datafield tag="100" ind1=" " ind2=" ">
    <subfield code="u">Laboratory of Computer Engineering, Delft University of Technology, Delft (NL)</subfield>
    <subfield code="a">Jintao Yu</subfield>
  </datafield>
  <datafield tag="245" ind1=" " ind2=" ">
    <subfield code="a">Time-division Multiplexing Automata Processor</subfield>
  </datafield>
  <datafield tag="536" ind1=" " ind2=" ">
    <subfield code="c">780215</subfield>
    <subfield code="a">Computation-in-memory architecture based on resistive devices</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
    <subfield code="u">https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode</subfield>
    <subfield code="a">Creative Commons Attribution Non Commercial No Derivatives 4.0 International</subfield>
  </datafield>
  <datafield tag="650" ind1="1" ind2="7">
    <subfield code="a">cc-by</subfield>
    <subfield code="2">opendefinition.org</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">&lt;p&gt;Automata Processor (AP) is a special implementation of non-deterministic finite automata that performs pattern matching by exploring parallel state transitions. The implementation typically contains a hierarchical switching network, causing long latency. This paper proposes a methodology to split such a hierarchical switching network into multiple pipelined stages, making it possible to process several input sequences in parallel by using time-division multiplexing. We use a new resistive RAM based AP (instead of known DRAM or SRAM based) to illustrate the potential of our method. The experimental results show that our approach increases the throughput by almost a factor of 2 at a cost of marginal area overhead.&lt;/p&gt;</subfield>
  </datafield>
  <datafield tag="773" ind1=" " ind2=" ">
    <subfield code="n">doi</subfield>
    <subfield code="i">isVersionOf</subfield>
    <subfield code="a">10.5281/zenodo.2533074</subfield>
  </datafield>
  <datafield tag="024" ind1=" " ind2=" ">
    <subfield code="a">10.5281/zenodo.2533075</subfield>
    <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="980" ind1=" " ind2=" ">
    <subfield code="a">publication</subfield>
    <subfield code="b">conferencepaper</subfield>
  </datafield>
</record>
57
40
views
downloads
All versions This version
Views 5757
Downloads 4040
Data volume 25.1 MB25.1 MB
Unique views 5151
Unique downloads 3838

Share

Cite as