Data Sharing Mechanisms for Parallel Graph Algorithms on the Intel SCC

Abstract : On many-core processors that do not provide hard-ware cache coherence, using shared memory in parallel computations is challenging. Reverting to pure message passing would avoid consistency issues, but replicating large shared datasets by messages is less efficient than accessing them directly through shared memory. The TACO-MESH framework provides lightweight remote method calls and shared objects with software-managed consistency. This paper presents experience from porting a graph partitioning algorithm to the framework. A performance evaluation on the experimental Intel SCC processor, which has no hardware cache coherence, shows that parallelization can be efficient despite the overhead of software-level consistency management.
Keywords : Many-Core Intel SCC
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download
Contributor : Simon Vernhes <>
Submitted on : Wednesday, July 18, 2012 - 4:31:44 PM
Last modification on : Saturday, April 13, 2019 - 4:24:06 PM
Long-term archiving on : Friday, October 19, 2012 - 3:00:49 AM


Explicit agreement for this submission


  • HAL Id : hal-00718993, version 1



Randolf Rotta, Thomas Prescher, Jana Traue, Jörg Nolte. Data Sharing Mechanisms for Parallel Graph Algorithms on the Intel SCC. The 6th Many-core Applications Research Community (MARC) Symposium, Jul 2012, Toulouse, France. pp.13-18. ⟨hal-00718993⟩



Record views


Files downloads