Parallel Algorithms for Relational Coarsest Partition Problems TeX Export

@article{citeulike:5802687, abstract = {Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are \${\cal P}-{\rm complete}\$ and hence it may not be possible to design polylog time parallel algorithms for these problems. In this paper, we present two efficient parallel algorithms for RCPP in which its associated label transition system is assumed to have m transitions and n states. The first algorithm runs in \$O(n^{1+\epsilon})\$ time using \${\textstyle{m \over {n^\epsilon}}}\$ CREW PRAM processors, for any fixed \$\epsilon This algorithm is analogous to and optimal with respect to the sequential algorithm of Kanellakis and Smolka. The second algorithm runs in O(n log n) time using \${\textstyle{m \over n}}\$ CREW PRAM processors. This algorithm is analogous to and nearly optimal with respect to the sequential algorithm of Paige and Tarjan.}, address = {Los Alamitos, CA, USA}, author = {Rajasekaran, Sanguthevar and Lee, Insup}, citeulike-article-id = {5802687}, citeulike-linkout-0 = {http://doi.ieeecomputersociety.org/10.1109/71.707548}, citeulike-linkout-1 = {http://dx.doi.org/10.1109/71.707548}, doi = {10.1109/71.707548}, issn = {1045-9219}, journal = {IEEE Transactions on Parallel and Distributed Systems}, keywords = {role, role-detection, social-network-analysis, social-network-anaylsis, social-networking, social-networks, social-roles, socialnetworks}, number = {7}, pages = {687--699}, posted-at = {2009-09-18 16:15:56}, priority = {0}, publisher = {IEEE Computer Society}, title = {Parallel Algorithms for Relational Coarsest Partition Problems}, url = {http://dx.doi.org/10.1109/71.707548}, volume = {9}, year = {1998} }

TY - JOUR ID - citeulike:5802687 L3 - citeulike-article-id:5802687 N2 - Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are ${\cal P}-{\rm complete}$ and hence it may not be possible to design polylog time parallel algorithms for these problems. In this paper, we present two efficient parallel algorithms for RCPP in which its associated label transition system is assumed to have m transitions and n states. The first algorithm runs in $O(n^{1+\epsilon})$ time using ${\textstyle{m \over {n^\epsilon}}}$ CREW PRAM processors, for any fixed $\epsilon This algorithm is analogous to and optimal with respect to the sequential algorithm of Kanellakis and Smolka. The second algorithm runs in O(n log n) time using ${\textstyle{m \over n}}$ CREW PRAM processors. This algorithm is analogous to and nearly optimal with respect to the sequential algorithm of Paige and Tarjan. IS - 7 JF - IEEE Transactions on Parallel and Distributed Systems SN - 1045-9219 AD - Los Alamitos, CA, USA EP - 699 TI - Parallel Algorithms for Relational Coarsest Partition Problems PB - IEEE Computer Society VL - 9 SP - 687 KW - role KW - role-detection KW - social-network-analysis KW - social-network-anaylsis KW - social-networking KW - social-networks KW - social-roles KW - socialnetworks AU - Rajasekaran, Sanguthevar AU - Lee, Insup PY - 1998/// UR - http://dx.doi.org/10.1109/71.707548 ER -