Pith. sign in

REVIEW

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2103.15024 v1 pith:ZF635GG2 submitted 2021-03-28 cs.DC cs.AR

MT-lib: A Topology-aware Message Transfer Library for Graph500 on Supercomputers

classification cs.DC cs.AR
keywords communicationmessagesmt-libgraph500librarymessagesupercomputersbuffer
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We present MT-lib, an efficient message transfer library for messages gather and scatter in benchmarks like Graph500 for Supercomputers. Our library includes MST version as well as new-MST version. The MT-lib is deliberately kept light-weight, efficient and friendly interfaces for massive graph traverse. MST provides (1) a novel non-blocking communication scheme with sending and receiving messages asynchronously to overlap calculation and communication;(2) merging messages according to the target process for reducing communication overhead;(3) a new communication mode of gathering intra-group messages before forwarding between groups for reducing communication traffic. In MT-lib, there are (1) one-sided message; (2) two-sided messages; and (3) two-sided messages with buffer, in which dynamic buffer expansion is built for messages delivery. We experimented with MST and then testing Graph500 with MST on Tianhe supercomputers. Experimental results show high communication efficiency and high throughputs for both BFS and SSSP communication operations.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.