J.-H. Chow and V. Sarkar. False sharing elimination by selection of runtime scheduling parameters. In Proceedings of the 26th International Conference on Parallel Processing, pages 396--403, Aug 1997.  Home/Search   Document Details and Download   Summary   Related Articles

....line is shared between processors, the individual data elements are not actually shared by the processors [7] False sharing results in unnecessary coherence traffic and longer latency to data in the shared line. Researchers have proposed methods to reduce false sharing in multiprocessor systems [6, 5, 2, 9]. However, false sharing cannot be completely eliminated, as different programs have different sharing granularities, that cannot always match the cache line size. In this report, we propose sharing speculation, a mechanism to load falsely shared data from cache speculatively while initiating the ....

....sharing. A number of researchers have looked at the coherence overhead due to false sharing [3, 4] Researchers have also focused on program restructuring techniques to reduce false sharing [5] Chow et al. propose a runtime scheduling technique for eliminating false sharing in parallel loops [2]. More recently, modified sectored caches have been proposed to reduce false sharing in multiprocessors [9] All these methods focus on increasing performance by reducing cache misses due to false sharing. However, due to the different 4 sharing patterns of applications, false sharing cannot be ....

J.-H. Chow and V. Sarkar. False sharing elimination by selection of runtime scheduling parameters. In Proceedings of the 26th International Conference on Parallel Processing, pages 396--403, Aug 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC