Loop transformations: convexity, pruning and optimization

Publication Source: The 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), Austin, TX, USA, January, 2011

High-level loop transformations are a key instrument in mapping computational kernels to effectively exploit the resources in modern processor architectures. Nevertheless, selecting required compositions of loop transformations to achieve this remains a significantly challenging task; current compilers may be off by orders of magnitude in performance compared to hand-optimized programs. To address this fundamental challenge, we first present a convex characterization of all distinct, semantics-preserving, multidimensional affine transformations. We then bring together algebraic, algorithmic, and performance analysis results to design a tractable optimization algorithm over this highly expressive space. Our framework has been implemented and validated experimentally on a representative set of benchmarks running on state-of-the-art multi-core platforms.
Google Scholar    Article

A Path Toward Cost-Effective SCA Compliance Testing

Publication Source: Wireless Innovation Forum Conference on Wireless Communication Technologies and Software Defined Radio, SDR-WInnComm, Washington, D.C., USA, 2010

We present R-Check™, a versatile architecture used to develop R-Check SCA, an SCA-specific static-analysisbased compliance testing tool for software radio waveforms. R-Check SCA was developed for JTEL and is intended to provide a cost-effective replacement for several of their search-and-inspect-based compliance testing procedures. The R-Check architecture makes use of several off-the-shelf components and open standards and is specifically engineered to integrate into the widest possible range of vendor development environments, an essential feature for addressing a modest but heterogeneous market space such as software radio.
Google Scholar    Article

Accelerating Regular Expression Processing Using Hardware DFA Engines

Publication Source: The Annual Computer Security Applications Conference (ACSAC), Austin, TX, USA, 2010

The processing of regular expressions (regexes) constitutes a powerful and common detection mechanism in most of network intrusion detection system (IDS). Yet because regular expressions come with significant overheads in terms of both memory and CPU cycles, security network managers have traditionally been conservative in using them.

Automatic Parallelization and Locality Optimization of Beamforming Algorithms

Publication Source: High Performance Embedded Computing Workshop, MIT Lincoln Labs, 2010

This paper demonstrates the benefits of a global optimization strategy using a new automatic parallelization and locality optimization methodology for high performance embedded computing algorithms that occur in adaptive radar systems, for modern multi-core computing chips. As a baseline, the resulting performance was compared against the performance that could be obtained using highly optimized math libraries. Adaptive Beamforming Algorithms Adaptive beamforming algorithms eliminate interference and clutter in a phased array antenna. Typically, for a small number N of array elements, the weight vector application to the incoming sensor stream represents the majority of the computation. However, with the introduction of solid state transceiver elements and the transition to conformal arrays, the number of antenna elements may go into the tens of thousands.
Google Scholar    Article

Generation of High-Performance Protocol-Aware Analyzers with Applications in Intrusion Detection Systems

Publication Source: In Cyber Security, Situation Management, and Impact Assessment II; and Visual Analytics for Homeland Defense and Security II, SPIE Proceedings Vol. 7709, 2010

Traditional Intrusion Detection and Prevention (IDP) systems scan packets quickly by applying simple byte-wise pattern signatures to network flows. Such a protocol-agnostic approach can be compromised with polymorphic attacks: slight modifications of exploits that bypass pattern signatures but still reach corresponding vulnerabilities. To protect against these attacks, a solution is to provision the IDP system with protocol awareness, at the risk of degrading performance. To balance vulnerability coverage against network performance, we introduce a hardware-aware, compiler-based platform that leverages hardware engines to accelerate the core functions of protocol parsing and protocol-aware signature evaluation.
Google Scholar    Article

1 17 18 19 20 21 23