Assessing the Complexity of Upgrading Software Modules

被引:0
|
作者
Schoenmakers, Bram [1 ]
van den Broek, Niels [1 ]
Nagy, Istvan [1 ]
Vasilescu, Bogdan [2 ]
Serebrenik, Alexander [2 ]
机构
[1] ASML Netherlands BV, De Run 6501, NL-5504 DR Veldhoven, Netherlands
[2] Tech Univ Eindhoven, NL-500MB Eindhoven, Netherlands
关键词
UPGRADEABILITY PROBLEMS; VISUALIZATION;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Modern software development frequently involves developing multiple codelines simultaneously. Improvements to one codeline should often be applied to other codelines as well, which is typically a time consuming and error-prone process. In order to reduce this (manual) effort, changes are applied to the system's modules and those affected modules are upgraded on the target system. This is a more coarse-grained approach than upgrading the affected files only. However, when a module is upgraded, one must make sure that all its dependencies are still satisfied. This paper proposes an approach to assess the ease of upgrading a software system. An algorithm was developed to compute the smallest set of upgrade dependencies, given the current version of a module and the version it has to be upgraded to. Furthermore, a visualization has been designed to explain why upgrading one module requires upgrading many additional modules. A case study has been performed at ASML to study the ease of upgrading the TwinScan software. The analysis shows that removing elements from interfaces leads to many additional upgrade dependencies. Moreover, based on our analysis we have formulated a number improvement suggestions such as a clear separation between the test code and the production code as well as an introduction of a structured process of symbols deprecation and removal.
引用
收藏
页码:433 / 440
页数:8
相关论文
共 50 条
  • [41] Assessing physiological complexity
    Burggren, WW
    Monticino, AG
    JOURNAL OF EXPERIMENTAL BIOLOGY, 2005, 208 (17): : 3221 - 3232
  • [42] On the Complexity of Acyclic Modules in Automata Networks
    Perrot, Kevin
    Perrotin, Pacome
    Sene, Sylvain
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2020, 2020, 12337 : 168 - 180
  • [43] THE DEPTH FORMULA FOR MODULES WITH REDUCIBLE COMPLEXITY
    Bergh, Petter Andreas
    Jorgensen, David A.
    ILLINOIS JOURNAL OF MATHEMATICS, 2011, 55 (02) : 465 - 478
  • [44] Dependability of complex software systems with component upgrading
    Li, JJ
    Mulcare, DB
    Wong, WE
    24TH ANNUAL INTERNATIONAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE (COSPSAC 2000), 2000, 24 : 413 - 418
  • [45] THE USE OF SOFTWARE COMPLEXITY METRICS IN SOFTWARE MAINTENANCE
    KAFURA, D
    REDDY, GR
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1987, 13 (03) : 335 - 343
  • [46] The Research on Software Metrics and Software Complexity Metrics
    Tu Honglei
    Sun Wei
    Zhang Yanan
    2009 INTERNATIONAL FORUM ON COMPUTER SCIENCE-TECHNOLOGY AND APPLICATIONS, VOL 1, PROCEEDINGS, 2009, : 131 - 136
  • [47] Upgrading the ATLAS Detector Control System Software
    Kochergin, I. A.
    PHYSICS OF ATOMIC NUCLEI, 2023, 86 (12) : 2665 - 2671
  • [48] Input/Output. Upgrading system software
    McCubbin, Neil
    Pulp & Paper Canada, 1994, 95 (06)
  • [49] Upgrading the ATLAS Detector Control System Software
    I. A. Kochergin
    Physics of Atomic Nuclei, 2023, 86 : 2665 - 2671
  • [50] Onboard guarded software upgrading: Motivation and framework
    Tai, AT
    Alkalai, L
    Chau, SN
    2001 IEEE AEROSPACE CONFERENCE PROCEEDINGS, VOLS 1-7, 2001, : 2421 - 2426