What is the best way to simulate an equilibrium classical spin model?

Several cluster algorithms for simulating classical spin models are reviewed and their advantages near critical points discussed. These algorithms are then examined from the general perspective of computational complexity theory. Several extant definitions of the "dynamic exponent" of an algorithm are discussed from this perspective and a robust definition based on an idealized model of parallel computation is proposed.