Parallel scanning with bitstream addition: an XML case study

Authors:
Robert D. Cameron;Ehsan Amiri;Kenneth S. Herdy;Dan Lin;Thomas C. Shermer;Fred P. Popowich
Affiliations:
Simon Fraser University, Surrey, BC, Canada;Simon Fraser University, Surrey, BC, Canada;Simon Fraser University, Surrey, BC, Canada;Simon Fraser University, Surrey, BC, Canada;Simon Fraser University, Surrey, BC, Canada;Simon Fraser University, Surrey, BC, Canada
Venue:
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part II
Year:
2011

Citing 5
Cited 1

XML screamer: an integrated approach to high performance XML parsing, validation and deserialization

Proceedings of the 15th international conference on World Wide Web
A case study in SIMD text processing with parallel bit streams: UTF-8 to UTF-16 transcoding

Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
High performance XML parsing using parallel bit stream technology

CASCON '08 Proceedings of the 2008 conference of the center for advanced studies on collaborative research: meeting of minds
A Data Parallel Algorithm for XML DOM Parsing

XSym '09 Proceedings of the 6th International XML Database Symposium on Database and XML Technologies
A 1 cycle-per-byte XML parsing accelerator

Proceedings of the 18th annual ACM/SIGDA international symposium on Field programmable gate arrays

Data-parallel finite-state machines

Proceedings of the 19th international conference on Architectural support for programming languages and operating systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A parallel scanning method using the concept of bitstream addition is introduced and studied in application to the problem of XML parsing and well-formedness checking. On processors supporting W-bit addition operations, the method can perform up to W finite state transitions per instruction. The method is based on the concept of parallel bitstream technology, in which parallel streams of bits are formed such that each stream comprises bits in one-to-one correspondence with the character code units of a source data stream. Parsing routines are initially prototyped in Python using its native support for unbounded integers to represent arbitrary-length bitstreams. A compiler then translates the Python code into low-level C-based implementations. These low-level implementations take advantage of the SIMD (single-instruction multipledata) capabilities of commodity processors to yield a dramatic speed-up over traditional alternatives employing byte-at-a-time parsing.