An efficient parallel algorithm for building the separating tree

We present an efficient parallel algorithm for building the separating tree for a separable permutation. Our algorithm runs in O(log2 n) time using O(n log n) operations on the CREW PRAM and O(log n log log n) time using O(n log n) operations on the CRCW PRAM.

• Type: Journal
• Year: 2010
• Where: JPDC
• Authors: Yijie Han, Sanjeev Saxena, Xiaojun Shen
• Keywords: CREW PRAM, Efficient Parallel Algorithm, JPDC 2010, Separable Permutation