On the Complexity of Buffer Allocation in Message Passing Systems

Details On the Complexity of Buffer Allocation in Message Passing Systems On the Complexity of Buffer Allocation in Message Passing Systems

2003-01-31

arxiv.org/abs/cs/0301035v1

Computer Science

Distributed, Parallel, and Cluster Computing

35 Pages, lots of figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the Complexity of Buffer Allocation in Message Passing Systems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Complexity of Buffer Allocation in Message Passing Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Complexity of Buffer Allocation in Message Passing Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-563882