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: CoRR (2016)
Keyphrases
- asynchronous communication
- synchronous communication
- domain specific
- random walk
- directed graph
- parallel processing
- shared memory
- graph model
- graph structure
- connected components
- structured data
- structural learning
- weighted graph
- tree decomposition
- parallel architectures
- address space
- graph theoretic
- computational power
- service composition
- knowledge base
- graph theory
- graph matching
- domain independent
- high level