Posts Tagged ‘ permutations ’

Parallel computation [permutations]

February 19, 2011
By
Parallel computation [permutations]

François Perron is visiting me for two months from Montréal and, following a discussion about the parallel implementation of MCMC algorithms—to which he also contributed with Yves Atchadé in 2005—, he remarked that a deterministic choice of permutations with the maximal contrast should do better than random or even half-random permutations. Assuming p processors or

Read more »