db_connect: Could not connect to paper db at "wotug@dragon.kent.ac.uk"<br>
db_connect: Could not connect to paper db at "wotug@dragon.kent.ac.uk"<br>

%T On the Complexity of Buffer Allocation in Message Passing Systems
db_connect: Could not connect to paper db at "wotug@dragon.kent.ac.uk"<br>
%A  Alex Brodsky,  Jan Bækgaard Pedersen,  Alan Wagner
db_connect: Could not connect to paper db at "wotug@dragon.kent.ac.uk"<br>
%E  James S. Pascoe,  Roger J. Loader,  Vaidy S. Sunderam
%B Communicating Process Architectures 2002
%X In modern cluster systems message passing functionality is
   often off\-loaded to the network interface card for
   efficiency reasons. However, this limits the amount of
   memory available for message buffers. Unfortunately, buffer
   insufficiency can cause an otherwise correct program to
   deadlock, or at least slow down. Hence, given a program
   trace from an execution in an unrestricted environment,
   determining the minimum number of buffers needed for a safe
   execution is an important problem. We present three related
   problems, all concerned with buffer allocation for safe and
   efficient execution. We prove intractability results for the
   first two problems and present a polynomial time algorithm
   for the third.