<?xml version='1.0' encoding='utf-8'?>
<?xml-stylesheet type="text/xsl" href="/v2/static/oai2.xsl"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-09-19T03:00:30Z</responseDate>
  <request identifier="oai:figshare.com:article/32995673" metadataPrefix="oai_dc" verb="GetRecord">https://api.figshare.com/v2/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:figshare.com:article/32995673</identifier>
        <datestamp>2026-05-01T00:00:00Z</datestamp>
        <setSpec>portal_693</setSpec>
        <setSpec>item_type_8</setSpec>
        <setSpec>month_year_05_2026</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"  xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>A Framework for the Design and Generation of Spatial MFSA Accelerators: The SPARX Approach</dc:title>
          <dc:creator>Alessandro Aldo Marina (24400601)</dc:creator>
          <dc:subject>Computer Architecture</dc:subject>
          <dc:subject>Computer Science</dc:subject>
          <dc:subject>Electrical and Computer Engineering</dc:subject>
          <dc:description>The growing demand for high-throughput pattern matching in fields such as cybersecurity, bioinformatics, and natural language processing has intensified research into automata-based accelerators. Regular expressions, while expressive and versatile, impose significant computational overhead when evaluated over massive data streams. Traditional CPU and GPU solutions, despite vectorization and multi-threading, remain constrained by the sequential execution model of Von Neumann architectures.
This thesis addresses these limitations by introducing SPARX, the first complete framework that translates the Multi-RE Finite State Automaton (MFSA) formalism into synthesizable spatial hardware. The work builds on iMFAnt, a software engine that merges multiple regular expressions into a unified automaton, reducing redundancy by identifying shared prefixes, suffixes, and internal sequences. The MFSA model enables simultaneous multi-regex evaluation within a single traversal of the input, achieving compactness and high algorithmic efficiency.

While iMFAnt demonstrated remarkable software performance—reducing state counts by 72%, transitions by 39%, and improving throughput up to 6×, its potential for spatial acceleration had not yet been explored. SPARX bridges this gap as a complete framework that translates the MFSA model into spatial hardware. It integrates simulation, validation, hardware resource utilization prediction, and automatic hardware generation into a single flow, mapping merged automata onto reconfigurable logic to combine algorithmic compression with hardware-level concurrency.</dc:description>
          <dc:date>2026-05-01T00:00:00Z</dc:date>
          <dc:type>Text</dc:type>
          <dc:type>Thesis</dc:type>
          <dc:identifier>10.25417/uic.32995673.v1</dc:identifier>
          <dc:relation>https://figshare.com/articles/thesis/A_Framework_for_the_Design_and_Generation_of_Spatial_MFSA_Accelerators_The_SPARX_Approach/32995673</dc:relation>
          <dc:rights>In Copyright</dc:rights>
          <dc:rights>Open Access after 2031-05-01</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
