Detecting And Resolving Deadlocks In Mobile Agent Systems

Keywords

Concurrent execution; Deadlock detection; Deadlock resolution; Lazy reaction; Mobile agent system; Priority-based

Abstract

Mobile agents environment is a new application paradigm with unique features such as mobility and autonomy. Traditional deadlock detection algorithms in distributed computing systems do not work well in mobile agent systems due to the unique feature property of the mobile agent. Existing deadlock detection and resolution algorithms in mobile agent systems have limitations such as performance inefficiency and duplicate detection/resolution when multiple mobile agents simultaneously detect/resolve the same deadlock. To address these problems, we propose an improved deadlock detection and resolution algorithm that adopts priority-based technique and lazy reaction strategy. The priority-based technique aims to ensure that there is only one instance of deadlock detection and resolution, and it also helps reduce mobile agent movement and data traffic together with the lazy reaction strategy. The liveness and safety properties of the proposed algorithm are proved in this paper. Theoretical analysis and experimental results show that the proposed algorithm provides better performance in terms of agent movement, data traffic, and execution time.

Publication Date

10-1-2017

Publication Title

Journal of Visual Languages and Computing

Volume

42

Number of Pages

23-30

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1016/j.jvlc.2017.08.002

Socpus ID

85027886332 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/85027886332

This document is currently not available here.

Share

COinS