Predicting potential deadlocks in multithreaded programs

Abstract

SummaryIn a multithreaded program, competition of threads for shared resources raises the deadlock possibility, which narrows the system liveness. Because such errors appear in specific schedules of concurrent executions of threads, runtime verification of threads behavior is a significant concern. In this study, we extended our previous approach for prediction of runtime behavior of threads may lead to an impasse. Such a prediction is of importance because of the nondeterministic manner of competing threads. The prediction process tries to forecast future behavior of threads based on their observed behavior. To this end, we map observed behavior of threads into time‐series data sets and use statistical and artificial intelligence methods for forecasting subsequent members of the sets as future behavior of the threads. The deadlock prediction is carried out based on probing the allocation graph obtained from actual and predicted allocation of resources to threads. In our approach, we use an artificial neural network (ANN) because ANNs enjoy the applicable performance and flexibility in predicting complex behavior. Using three case studies, we contrasted results of the current and our previous approaches to demonstrate results. Copyright © 2015 John Wiley & Sons, Ltd.