SWIFT: Using Task-Based Parallelism, Fully Asynchronous Communication, and Graph Partition-Based Domain Decomposition for Strong Scaling on more than 100, 000 Cores.
Matthieu SchallerPedro GonnetAidan B. G. ChalkPeter W. DraperPublished in: PASC (2016)
Keyphrases
- asynchronous communication
- synchronous communication
- graph theory
- service composition
- domain independent
- directed graph
- parallel processing
- graph representation
- level parallelism
- weighted graph
- domain specific
- random walk
- multi core systems
- structured data
- decomposition methods
- massively parallel
- graph structure
- bipartite graph
- decomposition method
- computational power
- tree decomposition
- multi core processors
- graph based algorithm
- domain experts
- connected components