2019 · 18 citations · 18 references
ComputingComputer EngineeringComputer ScienceDistributed SystemsMessage PassingParallel ComputingCollective CommunicationDistributed ComputingDistributed Data ProcessingDistributed Systems PerformanceInterprocess CommunicationRoutingCollective Communication In Parallel ComputingCollective Communication PatternsCommunication PrimitivesMany-core ProcessorsMessage AggregationMessage Passing InterfaceMessage RoutingMessage-passing Algorithms
The Message Passing Interface (MPI) is the de facto standard for message handling in distributed computing. MPI collective communication schemes where many processors communicate with one another depend upon synchronous handshake agreements. This results in applications depending upon iterative collective communications moving at the speed of their slowest processors. We describe a methodology for bootstrapping asynchronous communication primitives to MPI, with an emphasis on irregular and imbalanced all-to-all communication patterns found in many data analytics applications. In such applications, the communication payload between a pair of processors is often small, requiring message aggregation on modern networks. In this work, we develop novel routing schemes that divide routing logically into local and remote routing. In these schemes, each core on a node is responsible for handing all local node sends and/or receives with a subset of remote cores. Collective communications route messages along their designated intermediaries, and are not influenced by the availability of cores not on their route. Unlike conventional synchronous collectives, cores participating in these schemes can enter the protocol when ready and exit once all of their sends and receives are processed. We demonstrate, using simple benchmarks, how this collective communication improves overall wall clock performance, as well as bandwidth and core utilization, for applications with a high demand for arbitrary core-core communication and unequal computational load between cores.
18
R-MAT: A Recursive Model for Graph Mining
Deepayan Chakrabarti, Yiping Zhan, Christos Faloutsos · 2004 · 1.3K citations · Full text
An O(logn) parallel connectivity algorithm
Yossi Shiloach, Uzi Vishkin · Journal of Algorithms · 1982 · 598 citations
CHALLENGES IN PARALLEL GRAPH PROCESSING
Andrew Lumsdaine, Douglas Gregor, Bruce Hendrickson et al. · Parallel Processing Letters · 2007 · 470 citations