This paper presents a comparative evaluation of invalidation-based homeless and home-based software DSM protocols. We pay particular attention to those performance differences caused by symmetric and asymmetric features of the protocols.
We then show how the picture changes when update protocols are targeted. We show that a modified home-based protocol can significantly outperform more general protocols in this application domain because of reduced protocol complexity. We further optimize our protocol by completely eliminating such memory manipulation calls from the steady-state execution. Our re-sulting protocol improves average application performance by a further 34%, on top of the 19 0mprovement gained by our initial modification of the home-based protocol.