Performance enhancement with speculative execution based parallelism for processing large-scale xml-based application data Export

@inproceedings{citeulike:4921030, abstract = {We present the design and implementation of a toolkit for processing large-scale XML datasets that utilizes the capabilities for parallelism that are available in the emerging multi-core architectures. Multi-core processors are expected to be widely available in research clusters and scientific desktops, and it is critical to harness the opportunities for parallelism in the middleware, instead of passing on the task to application programmers. An emerging trend is the use of XML as the data format for many distributed/grid applications, with the size of these documents ranging from tens of megabytes to hundreds of megabytes. Our earlier benchmarking results revealed that most of the widely available XML processing toolkits do not scale well for large sized XML data. A significant transformation is necessary in the design of XML processing for distributed applications so that the overall application turn-around time is not negatively affected by XML processing. We discuss XML processing using PiXiMaL, a parallel processing library for large-scale XML datasets. The parallelization approach is to build a DFA-based parser that recognizes a useful subset of the XML specification, and convert the DFA into an NFA that can be applied to an arbitrary subset of the input. Speculative NFAs are scheduled on available cores in a node to effectively utilize the processing capabilities and achieve overall performance gains. We evaluate the efficacy of this approach in terms of potential speedup that can be achieved for representative XML datasets. We also evaluate the effect of two different memory allocation libraries to quantify the memory-bottleneck as different cores access shared data structures.}, address = {New York, NY, USA}, author = {Head, Michael R. and Govindaraju, Madhusudhan}, booktitle = {HPDC '09: Proceedings of the 18th ACM international symposium on High performance distributed computing}, citeulike-article-id = {4921030}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1551609.1551615}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1551609.1551615}, doi = {10.1145/1551609.1551615}, isbn = {978-1-60558-587-1}, keywords = {algorithms, concurrency, multicore, theory}, location = {Garching, Germany}, pages = {21--30}, posted-at = {2009-06-22 08:28:23}, priority = {4}, publisher = {ACM}, title = {Performance enhancement with speculative execution based parallelism for processing large-scale xml-based application data}, url = {http://dx.doi.org/10.1145/1551609.1551615}, year = {2009} }

TY - CONF ID - citeulike:4921030 L3 - citeulike-article-id:4921030 N2 - We present the design and implementation of a toolkit for processing large-scale XML datasets that utilizes the capabilities for parallelism that are available in the emerging multi-core architectures. Multi-core processors are expected to be widely available in research clusters and scientific desktops, and it is critical to harness the opportunities for parallelism in the middleware, instead of passing on the task to application programmers. An emerging trend is the use of XML as the data format for many distributed/grid applications, with the size of these documents ranging from tens of megabytes to hundreds of megabytes. Our earlier benchmarking results revealed that most of the widely available XML processing toolkits do not scale well for large sized XML data. A significant transformation is necessary in the design of XML processing for distributed applications so that the overall application turn-around time is not negatively affected by XML processing. We discuss XML processing using PiXiMaL, a parallel processing library for large-scale XML datasets. The parallelization approach is to build a DFA-based parser that recognizes a useful subset of the XML specification, and convert the DFA into an NFA that can be applied to an arbitrary subset of the input. Speculative NFAs are scheduled on available cores in a node to effectively utilize the processing capabilities and achieve overall performance gains. We evaluate the efficacy of this approach in terms of potential speedup that can be achieved for representative XML datasets. We also evaluate the effect of two different memory allocation libraries to quantify the memory-bottleneck as different cores access shared data structures. CY - Garching, Germany SN - 978-1-60558-587-1 AD - New York, NY, USA EP - 30 TI - Performance enhancement with speculative execution based parallelism for processing large-scale xml-based application data PB - ACM T2 - HPDC '09: Proceedings of the 18th ACM international symposium on High performance distributed computing SP - 21 KW - algorithms KW - concurrency KW - multicore KW - theory AU - Head, Michael AU - Govindaraju, Madhusudhan PY - 2009/// UR - http://dx.doi.org/10.1145/1551609.1551615 ER -