Communication-Efficient Bulk Synchronous Parallel Algorithm for Parentheses Matching.
Chun-Hsi Huang, Xin He · 2001
this paper, we present a Bulk Synchronous Parallel (BSP) algorithm for parentheses matching. BSP model is one of the first general-purpose parallel programming models that take communication issues into account and abstract the features of a parallel machine in a few parameters. In total, our algorithm uses a Computational resources and technical support provided by Center for Computational Research at SUNY-Buffalo (UB CCR)