• Title/Summary/Keyword: Software Complexity

Search Result 739, Processing Time 0.027 seconds

The Design and Implementation of a Software Complexity Measurement System (소프트웨어 복잡성 측정 시스템의 설계 및 구현)

  • Lee, Ha-Yong;Rhee, Ryong-Geun;Park, Jung-Ho;Yang, Hae-Sool
    • The Transactions of the Korea Information Processing Society
    • /
    • v.2 no.3
    • /
    • pp.314-323
    • /
    • 1995
  • Recently, as users' understanding about software is raised, software developers devoted all their energy to satisfy users' needs. Accordingly, software is getting increase in volume and becoming complicated. As account of it, development and maintenance costs of software have been increased, and a large number of developers were projected in maintenance and development of new software. Software with good maintenability has a function in a module and is easy to read and simple. In this paper, for effective management of software complexity, I designed and implemented the system which accepts source program by input and measures product metrics and produce measurement value of factor items.

  • PDF

A Model to Estimate Software Development Effort Based on COSMIC-FFP Using System Complexity (시스템 복잡도를 적용한 COSMIC-FFP 기반 소프트웨어 개발노력 추정 모델)

  • Park, Sang-Ki;Park, Man-Gon
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.11
    • /
    • pp.1575-1585
    • /
    • 2010
  • It is very important to forecast a back resource of a software development effort at the early stage of development life cycle for successful project processing, and it is carried out through software size estimation. The recent trend of software size estimation method is focused on the user's value such as FPA. We measure the actual development effort through case study and calculate CFP directly according to the cosmic-ffp manual V.3.0. in this paper. We also propose the software development effort estimation model by using the produced data. COSMIC-FFP does not use weights of necessary function elements, and so it has disadvantage in estimating sizes. This paper proposes the estimation model to estimate the precision software size by using system complexity as weight.

The Application of Reconfigurable Software Systems (재구성 가능한 소프트웨어 시스템의 적용)

  • Choi, Hanyong
    • Journal of Digital Convergence
    • /
    • v.19 no.8
    • /
    • pp.219-224
    • /
    • 2021
  • The convergence of various industries has removed the boundaries of software application fields and reduced the restrictions on convergence fields. Software requirements are diversified and they want to reconfigure software requirements in a fast cycle. Since various changes in requirements have to be accepted technically, research on methodologies and standards to increase the efficiency of software productivity and methods for standardizing and producing software are needed. In this study, we studied how the reusability and complexity of the software asset reconfiguration system appeared according to the developer's characteristics and environment to utilize the assets optimized in previous studies. At this time, we measured how the change in complexity according to the usability and asset composition method that appears according to the developer's characteristics appears, but there is a limit to the collected data, so it is necessary to secure the quality of the measured value through continuous data collection. In addition, an intelligent system application plan is needed to supplement the problem of context classification in the use stage of complex assets.

Development of A System for Quality Assessment and Complexity Metrics of Java programs (Java프로그램에 대한 품질 및 복잡도 메트릭스 평가시스템 구현)

  • 이상범;김경환
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.4 no.4
    • /
    • pp.346-351
    • /
    • 2003
  • In spite of the size and complexity of software becomes large and complicated, the demand of rapid development, cost reduction, good productivity and good quality software is increasing in these days. Many methods were proposed for efficient software development such as various Case tools. Metrics, Process improvement model (CMM, SPICE, ISO9000) and etc. However, most of them we useful to manage the whole projects rather than an individual programming. In this paper, we introduced a system for quality assessment and complexity metrics for Java programs to assess the individual programmer's quality rather than team's quality. This system shows not only the metrics value for quality assessment but also the source code and the soucture of classes simultaneously.

  • PDF

The Complexity of the Static Structures of Object-Oriented Systems by Analyzing the Class Diagram of UML (UML 클래스 다이어그램의 분석에 의한 객체지향 시스템의 정적 구조 복잡도 연구)

  • Chung, Hong;Hong, Dong-Kwon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.14 no.6
    • /
    • pp.793-799
    • /
    • 2004
  • Many researches and validations for the complexity metrics of the object-oriented systems have been studied. Most of them are aimed for the measurement of the partial aspects of the systems, for example, the coupling between objects, the complexity of inheritance structures, the cohesion of methods, and so on. But the software practitioners want to measure the complexity of overall system, not partial. We studied the complexity of the overall structures of object-oriented systems by analyzing the class diagram of UML. The class diagram is composed of classes and their relations. There are three kinds of relations, association, generalization, and aggregation, which are making the structure of object-oriented systems to be difficult to understand. We proposed a heuristic metric to measure the complexity of object-oriented systems by putting together the three kinds of the relations. This metric will be helpful to the software developers for their designing tasks by evaluating the complexity of the structures of object-oriented system and redesigning tasks of the system.

The Software Complexity Estimation Method in Algorithm Level by Analysis of Source code (소스코드의 분석을 통한 알고리즘 레벨에서의 소프트웨어 복잡도 측정 방법)

  • Lim, Woong;Nam, Jung-Hak;Sim, Dong-Gyu;Cho, Dae-Sung;Choi, Woong-Il
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.47 no.5
    • /
    • pp.153-164
    • /
    • 2010
  • A program consumes energy by executing its instructions. The amount of cosumed power is mainly proportional to algorithm complexity and it can be calculated by using complexity information. Generally, the complexity of a S/W is estimated by the microprocessor simulator. But, the simulation takes long time why the simulator is a software modeled the hardware and it only provides the information about computational complexity quantitatively. In this paper, we propose a complexity estimation method of analysis of S/W on source code level and produce the complexity metric mathematically. The function-wise complexity metrics give the detailed information about the calculation-concentrated location in function. The performance of the proposed method is compared with the result of the gate-level microprocessor simulator 'SimpleScalar'. The used softwares for performance test are $4{\times}4$ integer transform, intra-prediction and motion estimation in the latest video codec, H.264/AVC. The number of executed instructions are used to estimate quantitatively and it appears about 11.6%, 9.6% and 3.5% of error respectively in contradistinction to the result of SimpleScalar.

A Software/Hardware Codesign of the MLSE Equalizer for GSM/GPRS (GSM/GPRS용 MLSE 등화기의 소프트웨어/하드웨어 통합설계 구조제안)

  • 전영섭;박원흠;선우명훈;김경호
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.10
    • /
    • pp.11-20
    • /
    • 2002
  • This paper proposes a hardware/software codesign of the MLSE equalizer for GSM.GPRS systems. We analyze algorithms of the MLSE equalizer which consists of a channel estimator using the correlation method and the Viterbi processor. We estimate the computational complexity requirement based on the simulation of TI TMS320C5x DSP. We also estimate the gate count from the results of logic synthesis using the samsung 0.5㎛ standard cell library (STD80). Based on the results of the complexity estimation and gate count, we propose the efficient software/hardware codesign of the MLSE equalizer based on the results of the complexity estimation and gate count.

Derivation of State Transition Diagram from Class Using Tree Structure (트리 형태를 이용한 클래스의 단계별 상태 다이어그램 도출 기법에 대한 연구)

  • Choi, Soo Kyung;Park, Young Bom
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.1
    • /
    • pp.19-26
    • /
    • 2013
  • To improve the reliability and quality of software system, many studies of the testing based on state-transition diagram have been in progress. Existing studies tried to solve the complexity problem of state-transition diagram. But the development of test case demands the better way to derive and manage the state diagram with low complexity. In this paper, the STMT(State-Transition Mapping Tree) is proposed to decrease the complexity of state diagram without changing or loosing the original state or transition information. Comparing with other methods, the proposed method turns out to be less complex.

A Study on the Evaluation of MPEG-4 Video Decoding Complexity for HDTV (HDTV를 위한 MPEG-4 비디오 디코딩 복잡도의 평가에 관한 연구)

  • Ahn, Seong-Yeol;Park, Won-Woo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.595-598
    • /
    • 2005
  • MPEG-4 Visual is, and international standard for the object-based video compression, designed for supporting a wide range of applications from multimedia communication to HDTV. To control the minimum decoding complexity required at the decoder, the MPEG-4 Visual standard defines the co-called video buffering mechanism, which includes three video buffer models. Among them, the VCV(Video Complexity Verifier) defines the control of the processing speed for decoding of a macroblock, there are two models: VCV and B-VCV distinguishing the boundary and non-boundary MB. This paper presents the evaluation results of decoding complexity by measuring decoding time of a MB for rectangular, arbitrarily shaped video objects and the various types of objects supporting the resolution of HDTV using the optimized MPEG-4 Reference Software. The experimental results shows that decoding complexity varies depending on the coding type and more effective usage of decoding resources may be possible.

  • PDF

Adaptive Zoom Motion Estimation Method (적응적 신축 움직임 추정 방법)

  • Jang, Won-Seok;Kwon, Oh-Jun;Kwon, Soon-Kak
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.8
    • /
    • pp.915-922
    • /
    • 2014
  • We propose an adaptive zoom motion estimation method where a picture is divided into two areas based on the distance information with a depth camera : the one is object area and the other is background area. In the proposed method, the zoom motion is only applied to the object area except the background area. Further, the block size of motion estimation for the object area is set to smaller than that of background area. This adaptive zoom motion estimation method can be reduced at the complexity of motion estimation and can be improved at the motion estimation performance by reducing the block size of the object area in comparison with the conventional zoom motion estimation method. Based on the simulation results, the proposed method is compared with the conventional methods in terms of motion estimation accuracy and computational complexity.