2014 Sixth International Symposium on Parallel Architectures, Algorithms and Programming (PAAP) (2014)
July 13, 2014 to July 15, 2014
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PAAP.2014.46
We present new parallel algorithms for testing pattern involvement for all length 4 permutations. Our algorithmshave the complexity of O(log n) time with n/log nprocessors on the CREW PRAM model, O(logloglog n) timewith n/logloglog n processors or constant time and nlog3 nprocessors on a CRCW PRAM model. Parallel algorithms werenot designed before for some of these patterns and for otherpatters the previous best algorithms require O(log n) time and n processors on the CREW PRAM model.
Program processors, Arrays, Phase change random access memory, Silicon, Indexes, Parallel algorithms, Testing
Yijie Han, Sanjeev Saxena, "Parallel Algorithms for Testing Length Four Permutations", 2014 Sixth International Symposium on Parallel Architectures, Algorithms and Programming (PAAP), vol. 00, no. , pp. 81-86, 2014, doi:10.1109/PAAP.2014.46