BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:Turkey
BEGIN:DAYLIGHT
DTSTART:20380119T061407
TZOFFSETFROM:+0300
TZOFFSETTO:+0300
RRULE:FREQ=YEARLY;BYDAY=3TU;BYMONTH=1
TZNAME:+03
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20160907T000000
TZOFFSETFROM:+0300
TZOFFSETTO:+0300
RRULE:FREQ=YEARLY;BYDAY=1WE;BYMONTH=9
TZNAME:+03
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20180522T233402Z
UID:01136E79-C508-40E6-AC0A-595CE1C57A9D
DTSTART;TZID=Turkey:20180518T133000
DTEND;TZID=Turkey:20180518T153000
DESCRIPTION:Speaker: Dr. Salih Zengin\, TUBITAK SAGE\n\nTopic: "Hardware Ba
 sed String Matching Architectures"\n\nLocation: Middle East Technical Univ
 ersity\, Ankara\, Turkey\n\nAbstract: Many fields of computing such as De
 ep Packet Inspection (DPI) employ string matching modules (SMM) that searc
 h for a given set of positive strings in their input. An SMM is expected t
 o produce correct outcomes while scanning the input data at high rates. Fu
 rthermore the string sets that are searched for are usually large and thei
 r sizes increase steadily. Bloom Filters (BFs) are hashing data structures
  which are fast but their false positive results require further processin
 g. That is\, their speed can be exploited for Standard Bloom Filter SMMs (
 SBFs) as long as the positive probability is low. Multiple BFs in parallel
  can further increase the throughput. In this paper\, we propose the Doubl
 e Bloom Filter SMM (DBF) which achieves a higher throughput than the SBF a
 nd maintains a high throughput even for large positive probabilities. The 
 second Bloom Filter of DBF stores a small enough subset of the positive st
 rings such that its false positive probability is approximately zero. We d
 evelop an analytical model of the DBF and show that the throughput advanta
 ge of DBF over SBF becomes more prominent if the positive probability and 
 the fraction of matches in the second Bloom Filter increase. Accordingly\,
  we propose a heuristic algorithm that stores the strings that are more fr
 equently matched in the second Bloom Filter according to localities identi
 fied in the input. Our numerical results are obtained using realistic val
 ues from an FPGA implementation and are validated by SystemC simulations.\
 n\nSpeaker(s): Dr. Salih Zengin\, \n\nAnkara\, Ankara\, Türkiye
LOCATION:Ankara\, Ankara\, Türkiye
ORGANIZER:ozergul@metu.edu.tr
SEQUENCE:0
SUMMARY:IEEE AP/MTT/EMC/ED TURKEY CHAPTER SEMINAR SERIES -- SEMINAR 34
URL;VALUE=URI:https://events.vtools.ieee.org/m/173303
X-ALT-DESC:Description: <br /><p>Speaker: Dr. Salih Zengin\, TUBITAK SAGE</
 p>\n<p>Topic: "Hardware Based String Matching Architectures"</p>\n<p>Locat
 ion:&nbsp\;Middle East Technical University\, Ankara\, Turkey</p>\n<p>Abst
 ract: Many fields of computing such as Deep Packet Inspection (DPI) emplo
 y string matching modules (SMM) that search for a given set of positive st
 rings in their input. An SMM is expected to produce correct outcomes while
  scanning the input data at high rates. Furthermore the string sets that a
 re searched for are usually large and their sizes increase steadily. Bloom
  Filters (BFs) are hashing data structures which are fast but their false 
 positive results require further processing. That is\, their speed can be 
 exploited for Standard Bloom Filter SMMs (SBFs) as long as the positive pr
 obability is low. Multiple BFs in parallel can further increase the throug
 hput. In this paper\, we propose the Double Bloom Filter SMM (DBF) which a
 chieves a higher throughput than the SBF and maintains a high throughput e
 ven for large positive probabilities. The second Bloom Filter of DBF store
 s a small enough subset of the positive strings such that its false positi
 ve probability is approximately zero. We develop an analytical model of th
 e DBF and show that the throughput advantage of DBF over SBF becomes more 
 prominent if the positive probability and the fraction of matches in the s
 econd Bloom Filter increase. Accordingly\, we propose a heuristic algorith
 m that stores the strings that are more frequently matched in the second B
 loom Filter according to localities identified in the input. Our numerica
 l results are obtained using realistic values from an FPGA implementation 
 and are validated by SystemC simulations.</p>
END:VEVENT
END:VCALENDAR