Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: $k$-ported vs. $k$-lane Broadcast, Scatter, and Alltoall Algorithms   In $k$-ported message-passing systems, a processor can simultaneously receive
$k$ different messages from $k$ other processors, and send $k$ different
messages to $k$ other processors that may or may not be different from the
processors from which messages are received. Modern clustered systems may not
have such capabilities. Instead, compute nodes consisting of $n$ processors can
simultaneously send and receive $k$ messages from other nodes, by letting $k$
processors on the nodes concurrently send and receive at most one message. We
pose the question of how to design good algorithms for this $k$-lane model,
possibly by adapting algorithms devised for the traditional $k$-ported model.
We discuss and compare a number of (non-optimal) $k$-lane algorithms for the
broadcast, scatter and alltoall collective operations (as found in, e.g., MPI),
and experimentally evaluate these on a small $36\times 32$-node cluster with a
dual OmniPath network (corresponding to $k=2$). Results are preliminary.

27
The categories of this paper are: comp-gas
25
The categories of this paper are: patt-sol
32
The categories of this paper are: atom-ph
23
The categories of this paper are: solv-int
17
The categories of this paper are: q-fin
30
The categories of this paper are: q-alg
6
The categories of this paper are: astro-ph
22
The categories of this paper are: chao-dyn
24
The categories of this paper are: dg-ga
8
The categories of this paper are: hep-ex
16
The categories of this paper are: stat
4
The categories of this paper are: cond-mat
34
The categories of this paper are: chem-ph
21
The categories of this paper are: adap-org
33
The categories of this paper are: plasm-ph
18
The categories of this paper are: econ