Welcome to the Parabix Technology Home Page

Parabix technology is a high-performance programming framework for streaming text processing applications, leveraging both SIMD and multicore parallel processing features.

• October, 2018: Unicode Level 2 support for regex matching under canonical and compatible (?K flag) equivalence
• September, 2018: ICU 42 presentation on AVX-512/Parabix
• June, 2018: AVX-512 support for Parabix/icgrep
• June, 2018: u32u8 application
• April, 2018: File glob parsing using Parabix methods
• May 2, 2016: Check out the [wiki:ParabixOS ParabixOS] project!
• November 18-20, 2015: Join us in Zhangjiajie, China for our presentation at [http://trust.csu.edu.cn/conference/ICA3PP2015/ ICA3PP 2015].
• October 28-29, 2015: Join us at the [http://llvm.org/devmtg/2015-10/ 2015 LLVM Developers' Meeting] for Parabix-LLVM discussion.
• October 26-27, 2015: Join us at [http://www.unicodeconference.org/ Unicode Conference 39] for our presentation of Unicode regular expression matching in icgrep.
• September 2015: Look at our plans for additional Parabix regular expression facilities in the [ParabixRegexRoadMap Parabix Regular Expression Road Map]
• February 2015: Check out [wiki:ICgrep icGrep] 1.0 offering [GigabytePerSecondGrep Gigabyte Per Second Performance]!

Parabix Transform

The Parabix framework is based on the concept of parallel bit streams, a fundamentally new transform representation of text. Byte-oriented character stream data is first transformed into eight parallel bit streams, each bit stream comprising one bit per character code unit. Code units may be ASCII characters or UTF-8 bytes, for example, with one parallel bit stream defined for each of bit 0 through bit 7 of each code unit. Given such a representation, the 128-bit SIMD (single-instruction multiple-data) registers of the SSE (Intel architecture SIMD technology) or Altivec (Power PC architecture) may be used to process 128 code unit positions at a time.

See the Parabix Transform page for details.