O(log*n) algorithms on a Sum-CRCW PRAM
暂无分享，去创建一个
We present work- and cost-optimal O(log*n) algorithms for prefix sums and linear integer sorting on a Sum-CRCW PRAM.
[1] Richard Cole,et al. Faster Optimal Parallel Prefix Sums and List Ranking , 2011, Inf. Comput..
[2] Selim G. Akl,et al. On the Power of some Pram Models , 1999, Parallel Algorithms Appl..
[3] Selim G. Akl. Parallel computation: models and methods , 1997 .