Algorithm of Static Deadlock Detection in MPI Synchronization Communication Sequential Model

TL;DR

This paper presents a linear-time algorithm for static deadlock detection in MPI synchronization programs by transforming the problem into a multi-queue string matching task, improving efficiency over traditional circle-detection methods.

Contribution

It introduces a novel approach that maps MPI models into character strings and applies an efficient string matching algorithm for deadlock detection.

Findings

Algorithm operates in O(n) time and space complexity.

It outperforms traditional circle-detection methods.

Effective in dynamic message stream scenarios.

Abstract

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.