z-logo
Premium
Application of Deadlock Risk Evaluation of Architectural Models
Author(s) -
Monzón Antonio,
Fernández José L.,
de la Puente Juan A.
Publication year - 2012
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.1118
Subject(s) - computer science , concurrency , deadlock prevention algorithms , deadlock , architectural style , software engineering , architecture , distributed computing , systems engineering , engineering , art , visual arts
SUMMARY Software architectural evaluation is a key discipline used to identify, at early stages of a real‐time system (RTS) development, the problems that may arise during its operation. Typical mechanisms supporting concurrency, such as semaphores, mutexes or monitors, usually lead to concurrency problems in execution time that are difficult to be identified, reproduced and solved. For this reason, it is crucial to understand the root causes of these problems and to provide support to identify and mitigate them at early stages of the system lifecycle. This paper aims to present the results of a research work oriented to the development of the tool called ‘Deadlock Risk Evaluation of Architectural Models’ (DREAM) to assess deadlock risk in architectural models of an RTS. A particular architectural style, Pipelines of Processes in Object‐Oriented Architectures–UML (PPOOA) was used to represent platform‐independent models of an RTS architecture supported by the PPOOA –Visio tool. We validated the technique presented here by using several case studies related to RTS development and comparing our results with those from other deadlock detection approaches, supported by different tools. Here we present two of these case studies, one related to avionics and the other to planetary exploration robotics. Copyright © 2011 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here