On 14 Dec 2003 12:47:58 -0500, Rubin Bennett <[EMAIL PROTECTED]> writes:
> And, has anyone given any thought to working the SA engine up in C or > something faster than Perl? I've seen many issues with system resources > and SA, and the answer keeps coming back as one of two responses: It is not perl, its the design of the matching routines and the number of patterns searched. > 1. Get more system resources > 2. Throttle SA to a certain number of simultaneous threads > > I'd be very happy to see a 3rd possibility: make SA less hoggy of the > resources, so that one could run more instances with less CPU etc.. > Kind of like what happened with MRTG and the rateup routine (was Perl, > then some kind soul re-wrote it in C and exponentially improved it's > performance). Its possible to speed up much of the core matching engine using automata techniques to match hundreds/thousands of re's in parallel in effectively a single pass. If you write a perl module implementing them, I am confident that SA will use it. See some of my posts over the last 10 days for references. If after reading them you have any questions, reply here. Scott ------------------------------------------------------- This SF.net email is sponsored by: IBM Linux Tutorials. Become an expert in LINUX or just sharpen your skills. Sign up for IBM's Free Linux Tutorials. Learn everything from the bash shell to sys admin. Click now! http://ads.osdn.com/?ad_id=1278&alloc_id=3371&op=click _______________________________________________ Spamassassin-talk mailing list [EMAIL PROTECTED] https://lists.sourceforge.net/lists/listinfo/spamassassin-talk
