ISPASS 2008 - IEEE International Symposium on Performance Analysis of Systems and software最新文献

筛选

英文中文

Characterizing the Unique and Diverse Behaviors in Existing and Emerging General-Purpose and Domain-Specific Benchmark Suites 在现有的和新兴的通用的和领域特定的基准套件中描述独特的和不同的行为

ISPASS 2008 - IEEE International Symposium on Performance Analysis of Systems and software Pub Date : 2008-04-20 DOI: 10.1109/ISPASS.2008.4510748

Kenneth Hoste, L. Eeckhout

引用次数: 9

Conservative vs. Optimistic Parallelization of Stateful Network Intrusion Detection 有状态网络入侵检测的保守与乐观并行化

ISPASS 2008 - IEEE International Symposium on Performance Analysis of Systems and software Pub Date : 2007-03-14 DOI: 10.1145/1229428.1229455

Derek L. Schuff, Yung Ryn Choe, Vijay S. Pai

{"title":"Conservative vs. Optimistic Parallelization of Stateful Network Intrusion Detection","authors":"Derek L. Schuff, Yung Ryn Choe, Vijay S. Pai","doi":"10.1145/1229428.1229455","DOIUrl":"https://doi.org/10.1145/1229428.1229455","url":null,"abstract":"This paper presents and experimentally analyzes the performance of three parallelization strategies for the popular open-source Snort network intrusion detection system (NIDS). The parallelizations include 2 conservative variants and 1 optimistic scheme. The conservative strategy parallelizes inspection at the level of TCP/IP flows, as any potential inter-packet dependences are confined to a single flow. The flows are partitioned among threads, and each flow is processed in-order at one thread. A second variation reassigns flows between threads to improve load balance but still requires that only one thread process a given flow at a time. The flow-concurrent scheme provides good performance for 3 of the 5 network packet traces studied, reaching as high as 4.1 speedup and 3.1 Gbps inspection rate on a commodity 8-core server. Dynamic reassignment does not improve performance scalability because it introduces locking overheads that offset any potential benefits of load balancing. Neither conservative version can achieve good performance, however, without enough concurrent networkflows. For this case, this paper presents an optimistic parallelization that exploits the observation that not all packets from a flow are actually connected by dependences. This system allows a single flow to be simultaneously processed by multiple threads, stalling if an actual dependence is found. The optimistic version has additional overheads that reduce speedup by 25% for traces with flow concurrency, but its benefits allow one additional trace to see substantial speedup (2.4 on five cores).","PeriodicalId":137239,"journal":{"name":"ISPASS 2008 - IEEE International Symposium on Performance Analysis of Systems and software","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132130677","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 33

首页上一页