skip to main content
10.1145/2213836.2213863acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article

Skeleton automata for FPGAs: reconfiguring without reconstructing

Published:20 May 2012Publication History

ABSTRACT

While the performance opportunities of field-programmable gate arrays field (FPGAs)field for high-volume query processing are well-known, system makers still have to compromise between desired query expressiveness and high compilation effort. The cost of the latter is the primary limitation in building efficient FPGA/CPU hybrids.

In this work we report on an FPGA-based stream processing engine that does not have this limitation. We provide a hardware implementation of XML projection [14] that can be reconfigured in less than a micro-second, yet supports a rich and expressive dialect of XPath. By performing XML projection in the network, we can fully leverage its filtering effect and improve XQuery performance by several factors.

These improvements are made possible by a new design approach for FPGA acceleration, called skeleton automata. Skeleton automata separate the structure of finite-state automata from their semantics. Since individual queries only affect the latter, with our approach query workload changes can be accommodated fast and with high expressiveness.

References

  1. Mehmet Altnel and Michael J. Franklin. Efficient Filtering of XML Documents for Selective Dissemination of Information. In Proc. of the 26th Int'l Conference on Very Large Data Bases (VLDB), Cairo, Egypt, September 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Véronique Benzaken, Giuseppe Castagna, Dario Colazzo, and Kim Nguyên. Type-Based XML Projection. In Proc. of the 32nd Int'l Conference on Very Large Data Bases (VLDB), Seoul, Korea, September 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Anders Berglund, Scott Boag, Don Chamberlin, Mary F. Fernández, Michael Kay, Jonathan Robie, and Jérôme Siméon. XML Path Language (XPath) 2.0 (Second Edition), December 2010. W3C Recommendation.Google ScholarGoogle Scholar
  4. Shekhar Borkar and Andrew A. Chien. The Future of Microprocessors. Communications of the ACM, 54(5):67--77, May 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Robert S. Boyer and J. Strother Moore. A Fast String Searching Algorithm. Communications of the ACM, 20(10):762--772, October 1977. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Beate Commentz-Walter. A String Matching Algorithm Fast on the Average. In Proc. of the 6th Int'l Colloquium on Automata, Languages and Programming (ICALP), Graz, Austria, July 1979. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. IBM WebSphere DataPower SOA Appliance. http://www.ibm.com/software/integration/datapower/. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. André DeHon. Balancing Interconnect and Computation in a Reconfigurable Computing Array (or, why you don't really want 100% LUT utilization). In Proc. of the Int'l Symposium on Field Programmable Gate Arrays (FPGA), pages 125--134, February 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Yanlei Diao, Mehmet Altnel, Michael J. Franklin, Hao Zhang, and Peter Fischer. Path Sharing and Predicate Evaluation for High-Performance XML Filtering. ACM Transactions on Database Systems (TODS), 28(4):467--516, December 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Peter Fischer and Jens Teubner. MXQuery with Hardware Acceleration. In Proc. of the 28th Int'l Conference on Data Engineering (ICDE), Arlington, VA, USA, April 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Michael Kay. Ten Reasons Why Saxon XQuery is Fast. IEEE Data Eng. Bull., 31(4):65--74, 2008.Google ScholarGoogle Scholar
  12. Christoph Koch, Stefanie Scherzinger, and Michael Schmidt. XML Prefiltering as a String Matching Problem. In Proc. of the 24th Int'l Conference on Data Engineering (ICDE), Cancún, Mexico, April 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Ian Kuon and Jonathan Rose. Measuring the Gap Between FPGAs and ASICs. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, 26(2), February 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Amélie Marian and Jérôme Siméon. Projecting XML Documents. In Proc. of the 29th Int'l Conference on Very Large Data Bases (VLDB), Berlin, Germany, September 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Roger Moussalli, Mariam Salloum, Walid A. Najjar, and Vassilis J. Tsotras. Accelerating XML Query Matching through Custom Stack Generation on FPGAs. In Proc. of the 5th Int'l Conference on High-Performance Embedded Architectures and Compilers (HiPEAC), pages 141--155, Pisa, Italy, January 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Roger Moussalli, Mariam Salloum, Walid A. Najjar, and Vassilis J. Tsotras. Massively Parallel XML Twig Filtering Using Dynamic Programming on FPGAs. In Proc. of the 27th Int'l Conference on Data Engineering (ICDE), pages 948--959, Hannover, Germany, April 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Rene Mueller, Jens Teubner, and Gustavo Alonso. Data Processing on FPGAs. Proc. of the VLDB Endowment (PVLDB), 2(1), August 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Netezza. http://www.netezza.com/.Google ScholarGoogle Scholar
  19. Matthias Nicola and Jasmi John. XML Parsing: A Threat to Database Performance. In Proc. of the 12th Int'l Conference on Information and Knowledge Management (CIKM), pages 175--178, New Orleans, LA, USA, November 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Mohammad Sadoghi, Martin Labrecque, Harsh Singh, Warren Shum, and Hans-Arno Jacobsen. Efficient Event Processing through Reconfigurable Hardware for Algorithmic Trading. Proc. of the VLDB Endowment (PVLDB), 3(2), September 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Mohammad Sadoghi, Harsh Singh, and Hans-Arno Jacobsen. Towards Highly Parallel Event Processing through Reconfigurable Hardware. In Proc. of the 7th Int'l Workshop on Data Management on New Hardware (DaMoN), Athens, Greece, June 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Albrecht R. Schmidt, Florian Waas, Martin L. Kersten, Michael J. Carey, Ioana Manolescu, and Ralph Busse. XMark: A Benchmark for XML Data Management. In Proc. of the 28th Int'l Conference on Very Large Data Bases (VLDB), pages 974--985, Hong Kong, China, August 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Reetinder Sidhu and Viktor Prasanna. Fast Regular Expression Matching Using FPGAs. In IEEE Symp. on Field-Programmable Custom Computing Machines (FCCM), Rohnert Park, CA, USA, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Jens Teubner and Louis Woods. Snowfall: Hardware Stream Analysis Made Easy. In Proc. of the 14th Conference on Databases in Business, Technology, and Web (BTW), Kaiserslautern, Germany, March 2011.Google ScholarGoogle Scholar
  25. Jan van Lunteren. Searching Very Large Routing Tables in Wide Embedded Memory. In Proc. of the IEEE Global Telecommunications Conference (GLOBECOM'01), volume 3, pages 1615--1619, San Antonio, TX, USA, November 2001.Google ScholarGoogle Scholar
  26. Jan van Lunteren, Ton Engbersen, Joe Bostian, Bill Carey, and Chris Larsson. XML Accelerator Engine. In Proc. of the 1st Int'l Workshop on High-Performance XML Processing, New York, NY, USA, May 2004.Google ScholarGoogle Scholar
  27. Louis Woods, Jens Teubner, and Gustavo Alonso. Complex Event Detection at Wire Speed with FPGAs. Proc. of the VLDB Endowment (PVLDB), 3(1), September 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Xilinx Inc. 7 Series FPGAs Overview, September 2011.Google ScholarGoogle Scholar
  29. Yi-Hua E. Yang, Weirong Jiang, and Viktor K. Prasanna. Compact Architecture for High-Throughput Regular Expression Matching on FPGA. In ACM/IEEE Symp. on Architectures for Networking and Communication Systems (ANCS), pages 30--39, San Jose, CA, USA, November 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Skeleton automata for FPGAs: reconfiguring without reconstructing

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SIGMOD '12: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
      May 2012
      886 pages
      ISBN:9781450312479
      DOI:10.1145/2213836

      Copyright © 2012 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 20 May 2012

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      SIGMOD '12 Paper Acceptance Rate48of289submissions,17%Overall Acceptance Rate785of4,003submissions,20%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader