Connectors synthesis for deadlock-free component based architectures

被引:7
|
作者
Inverardi, P [1 ]
Scriboni, S [1 ]
机构
[1] Univ Aquila, Dipartimento Informat, I-67100 Laquila, Italy
关键词
D O I
10.1109/ASE.2001.989803
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Nowadays component-based technologies offer straightforward ways of building applications out of existing components. Although these technologies might differ in terms of the level of heterogeneity among components they support, e.g. CORBA or COM versus J2EE, they all suffer the problem of dynamic integration. That is, once components are successfully integrated in a uniform context how is it possible to check, control and assess that the dynamic behavior of the resulting application will not deadlock? In this paper we propose an architectural, connector-based approach to this problem. We compose a system in such a way that it is possible to check whether and why the system deadlocks. Depending. on the kind of deadlock, we have a strategy that automatically operates on the connector part of the system architecture in order to obtain a suitably equivalent version of the system which is deadlock-free.
引用
收藏
页码:174 / 181
页数:8
相关论文
共 50 条
  • [21] DEADLOCK-FREE ABSORPTION OF BARRIER SYNCHRONISATIONS
    UTARD, G
    HAINS, G
    INFORMATION PROCESSING LETTERS, 1995, 56 (04) : 221 - 227
  • [22] Jthread, a deadlock-free mutex library
    Grande, Johan
    Boudol, Gerard
    Serrano, Manuel
    PROCEEDINGS OF THE 17TH INTERNATIONAL SYMPOSIUM ON PRINCIPLES AND PRACTICE OF DECLARATIVE PROGRAMMING (PPDP 2015), 2015, : 149 - 160
  • [23] Deadlock-free interval routing schemes
    Flammini, M
    STACS 97 - 14TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1997, 1200 : 351 - 362
  • [24] Deadlock-free interval routing schemes
    Flammini, M
    NETWORKS, 1999, 34 (01) : 47 - 60
  • [25] DEADLOCK-FREE SCHEDULING METHOD BASED ON PETRI NET AND GA
    Xu Gang Wu ZhimingSchool of Automation
    Chinese Journal of Mechanical Engineering, 2003, (04) : 371 - 375
  • [26] A kind of deadlock-free scheduling method based on Petri net
    Gang, X
    Wu, ZM
    7TH IEEE INTERNATIONAL SYMPOSIUM ON HIGH ASSURANCE SYSTEMS ENGINEERING, PROCEEDINGS, 2002, : 195 - 200
  • [27] A Composable Deadlock-Free Approach to Object-Based Isolation
    Imam, Shams
    Zhao, Jisheng
    Sarkar, Vivek
    EURO-PAR 2015: PARALLEL PROCESSING, 2015, 9233 : 426 - 437
  • [28] Deadlock-Free Adaptive Routing in Meshes Based on Cost-Effective Deadlock Avoidance Schemes
    Xiang, Dong
    Zhang, Yueli
    Pan, Yi
    Wu, Jie
    2007 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING WORKSHOPS (ICPP), 2007, : 342 - +
  • [29] Deadlock-Free Genetic Scheduling Algorithm for Automated Manufacturing Systems Based on Deadlock Control Policy
    Xing, Ke Yi
    Han, LiBin
    Zhou, MengChu
    Wang, Feng
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2012, 42 (03): : 603 - 615
  • [30] A partially deadlock-free typed process calculus
    Kobayashi, N
    12TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1997, : 128 - 139