Algorithm of Static Deadlock Detection in MPI Synchronization Communication Sequential Model

Details Algorithm of Static Deadlock Detection in MPI Synchronization Communication Sequential Model Algorithm of Static Deadlock Detection in MPI Synchronization Communication Sequential Model

2007-09-24

arxiv.org/abs/0709.3693v1

Computer Science

Distributed, Parallel, and Cluster Computing

This paper has been accepted by Computer Engineering (in Chinese)

Scientific paper

Detecting deadlocks in MPI synchronization communication programs is very difficult and need building program models. All complex models are based on sequential models. The sequential model is mapped into a set of character strings and its deadlock detection problem is translated into an equivalent multi-queue string matching problem. An algorithm is devised and implemented to statically detect deadlocks in sequential models of MPI synchronization communication programs. The time and space complexity of the algorithm is O(n) where n is the amount of message in model. The algorithm is better than usual circle-detection methods and can adapt well to dynamic message stream.

Affiliated with

Also associated with

No associations

Rating

Algorithm of Static Deadlock Detection in MPI Synchronization Communication Sequential Model 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 Algorithm of Static Deadlock Detection in MPI Synchronization Communication Sequential Model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithm of Static Deadlock Detection in MPI Synchronization Communication Sequential Model will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-276484