Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the Complexity of Buffer Allocation in Message Passing Systems   Message passing programs commonly use buffers to avoid unnecessary
synchronizations and to improve performance by overlapping communication with
computation. Unfortunately, using buffers makes the program no longer portable,
potentially unable to complete on systems without a sufficient number of
buffers. Effective buffer use entails that the minimum number needed for a safe
execution be allocated.
  We explore a variety of problems related to buffer allocation for safe and
efficient execution of message passing programs. We show that determining the
minimum number of buffers or verifying a buffer assignment are intractable
problems. However, we give a polynomial time algorithm to determine the minimum
number of buffers needed to allow for asynchronous execution. We extend these
results to several different buffering schemes, which in some cases make the
problems tractable.

16
The categories of this paper are: stat
20
The categories of this paper are: acc-phys
32
The categories of this paper are: atom-ph
6
The categories of this paper are: astro-ph
21
The categories of this paper are: adap-org
36
The categories of this paper are: cmp-lg
17
The categories of this paper are: q-fin
35
The categories of this paper are: mtrl-th
26
The categories of this paper are: bayes-an
15
The categories of this paper are: nucl-ex
14
The categories of this paper are: math-ph
25
The categories of this paper are: patt-sol
24
The categories of this paper are: dg-ga
30
The categories of this paper are: q-alg
0
The categories of this paper are: hep-ph
3
The categories of this paper are: physics