• Title/Summary/Keyword: 코드 최적화

Search Result 480, Processing Time 0.024 seconds

An Optimal ILP Algorithm of Memory Access Variable Storage for DSP in Embedded System (임베디드 시스템에서 DSP를 위한 메모리 접근 변수 저장의 최적화 ILP 알고리즘)

  • Chang, Jeong-Uk;Lin, Chi-Ho
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.2 no.2
    • /
    • pp.59-66
    • /
    • 2013
  • In this paper, we proposed an optimal ILP algorithm on memory address code generation for DSP in embedded system. This paper using 0-1 ILP formulations DSP address generation units should minimize the memory variable data layout. We identify the possibility of the memory assignment of variable based on the constraints condition, and register the address code which a variable instructs in the program pointer. If the process sequence of the program is declared to the program pointer, then we apply the auto-in/decrement mode about the address code of the relevant variable. And we minimize the loads on the address registers to optimize the data layout of the variable. In this paper, in order to prove the effectiveness of the proposed algorithm, FICO Xpress-MP Modeling Tools were applied to the benchmark. The result that we apply a benchmark, an optimal memory layout of the proposed algorithm then the general declarative order memory on the address/modify register to reduce the number of loads, and reduced access to the address code. Therefor, we proved to reduce the execution time of programs.

The Design of A Machine-independent Global Optimizer for RISC Compilers (RISC 컴파일러의 기계독립적 Global Optimizer 설계)

  • Park, Jong-Deuk;Lim, In-Chil
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.3
    • /
    • pp.40-46
    • /
    • 1990
  • This paper describes a design and an implementation of a machine-independent global optimizer which is a required module of RISC compiler system designs. It receives a triple as input and performs data flow analysis, common subexpression elimination and code motion and finally generates the optimized code. Since the implemented optimizer operates on the machine-independent intermediate code, its portability is good for many high level languages and target machines. It performs the effective optimizations to improve the execution time of programs.

  • PDF

Multidisciplinary Aircraft Wing Design Using the MDO Framework (MDO 프레임워크 개발을 통한 항공기 날개 통합최적화 설계)

  • Lee, Jae-Woo;Kim, Jong-Hwan;Jeang, Ju-Young;Jeon, Kwon-Su;Byun, Yung-Hwan
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.32 no.6
    • /
    • pp.23-33
    • /
    • 2004
  • MDO framework, which provides multidisciplinary system design and optimization environment, requires integration of the analyses codes developed at various computer languages and operating systems, integration of CAD and DBMS, and development of complex GUI. Emphases must be given to the software modification and upgrades in conjunction with the analysis code addition and MDO method implementation. In this study, techniques about system integration and analysis code interface have been studied extensively, and the database design and communication methods which can handle the MDO methods like MDF and CO have been studied. Using the dedicated MDO framework developed for the air vehicle design, the multidisciplinary fighter aircraft wing design has been performed to demonstrate the efficiency and usefulness of the software. Optimum wing configuration is derived using the gradient-based optimization methods within thirty design iterations.

Scleral Diagnostic System Implementation with Color and Blood Vessel Sign Pattern Code Generations (컬러와 혈관징후패턴 코드 생성에 의한 공막진단시스템 구현)

  • Ryu, Kwang Ryol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.12
    • /
    • pp.3029-3034
    • /
    • 2014
  • The paper describes the scleral diagnostic system implementation for human eyes by using the scleral color code and vessels sign pattern code generations. The system is based on the high performance DSP image signal processor, programmable gain control for preprocessing and RISC SD frames storage. RGB image signals are optimized by PGC, the edge image is detected form the gray image converted. The processing algorithms are executed by scleral color code generation and scleral vessels sign pattern code creation for discriminating and matching. The scleral symptomatic color code is generated by YCbCr values at memory map tolerated and the vessel sign pattern code is created by digitizing the 24 clock and 13 ring zones, overlay matching and tolerances. The experimental results for performance are that the system runs 40ms, and the color and pattern for diagnostic errors are around 20% and 24% on average. The system and technique enable a scleral diagnosis with subdividing the patterns and patient database.

Optimization of the Execution of the Loop for the TraceMonkey Interpreter (TraceMonkey 자바스크립트 엔진의 인터프리터에서 루프 수행 최적화 방안)

  • Park, Hyuk-Woo;Moon, Soo-Mook
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2011.06b
    • /
    • pp.398-400
    • /
    • 2011
  • 자바스크립트는 현재 웹 사이트에서 클라이언트 사이드 프로그래밍의 언어로 널리 쓰이고 있다. 최근 들어 RIA(Rich Internet Application)의 등장과 함께 모바일 환경에서의 인터넷 접속이 증가하면서 자바스크립트 언어의 수행 성능이 중요한 이슈가 되고 있다. 본 논문에서는 자바스크립트 엔진 중 하나인 TraceMonkey에서 인터프리터로 루프(Loop) 수행 시 타입 체크 오버헤드 제거와 슈퍼바이트 코드 최적화를 적용하여 성능 향상을 꾀하고 이를 평가하고자 한다.

Early Null Pointer Check using Predication in Java Just-In-Time Compilation (자바 적시 컴파일에서의 조건 수행을 이용한 비어 있는 포인터의 조기검사)

  • Lee Sanggyu;Choi Hyug-Kyu;Moon Soo-Mook
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.7
    • /
    • pp.683-692
    • /
    • 2005
  • Java specification states that all accesses to an object must be checked at runtime if object refers to null. Since Java is an object-oriented language, object accesses are frequent enough to make null pointer checks affect the performance significantly. In order to reduce the performance degradation, there have been attempts to remove redundant null pointer checks. For example, in a Java environment where a just-in-time (JIT) compiler is used, the JIT compiler removes redundant null pointer check code via code analysis. This paper proposes a technique to remove additional null pointer check code that could not be removed by previous JIT compilation techniques, via early null pointer check using an architectural feature called predication. Generally, null point check code consists of two instructions: a compare and a branch. Our idea is moving the compare instruction that is usually located just before an use of an object, to the point right after the object is defined so that the total number of compare instructions is reduced. This results in reduction of dynamic and static compare instructions by 3.21$\%$ and 1.98$\%$. respectively, in SPECjvm98 bechmarks, compared to the code that has already been optimized by previous null pointer check elimination techniques. Its performance impact on an Itanium machine is an improvement of 0.32$\%$.

A Study of Multi-point Numerical Optimization Design for Transonic Airfoils (천음속 날개꼴의 Multi-point 수치최적화 설계에 관한 연구)

  • 손명환;권성재
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.1 no.1
    • /
    • pp.145-153
    • /
    • 1998
  • In the direct numerical optimization method, the aerodynamic coefficients of the airfoil designed by one-point design can be deteriorated at other operating points. Therefore, the capacity of the multi-point design is indispensable for actual airfoil design. In this paper, the two-point design of transonic airfoils is studied based on the Navier-Stokes equations flow solver and the feasible direction optimization algorithm, and the effects of weighting parameter were analyzed and compared. The results show that the airfoils designed by two-point design satisfy the performances at the peripheral regions of two operating points concurrently and have the favorable aerodynamic characteristics at the point which has larger weighting parameter than the other point.

  • PDF

Object-Oriented based Refactoring Process (객체지향 기반의 Refactoring 프로세스)

  • Lee, Jong-Ho;Park, Jin-Ho;Rhew, Sung-Yul
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.7 no.4
    • /
    • pp.299-308
    • /
    • 2001
  • The company invests its time and money for temporary maintenance to satisfy the fast change of the computer use environment and the user's demands. Therefore, various problems occur including low performance because of duplication of codes and unstable structures from the restructuring and redevelopment. Furthermore, if a developer, who did not participate in initial process of development, wrote additional program codes to upgrade or restructure, it would cause many problems such as lack or lose of development documentation, understanding of documentation and reuse of existing program language. This study, Object-oriented Refactoring Process, suggests that the developers can reuse object unit to overcome the limit of the reusing code. In addition, this paper shows case study to verify our process by adjusting the project called "D2D", which is a case tool for developing windows system from Company D. Our works get positive results such as improvement of system pelfonnance, decreased cost of development and maintenance and optimizing structure and class.

  • PDF

Implementation of Loop Peeling in CTOC (CTOC에서 루프 벗기기 구현)

  • Kim, Ki-Tae;Kim, Je-Min;Yoo, Weon-Hee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.5
    • /
    • pp.27-35
    • /
    • 2008
  • The CTOC framework was implemented to efficiently perform analysis and optimization of the Java bytecode that is often being used lately. In order to analyze and optimize the bytecode from the CTOC, the eCFG was first generated. Due to the bytecode characteristics of difficult analysis, the existing bytecode was expanded to be suitable for control flow analysis. and the control flow graph was drawn. We called eCFG(extended Control Flow Graph). Furthermore, the eCFG was converted into the SSA Form for a static analysis. Many loops were found in the conversion program. The previous CTOC performed conversion directly into the SSA Form without processing the loops. However, processing the loops prior to the SSA Form conversion allows more efficient generation of the SSA Form. This paper examines the process of finding the loops prior to converting the eCFG into the SSA Form In order to efficiently process the loops, and exhibits the procedures for generating the loop tree.

  • PDF

Performance improvement for marker-less object recognition through OpenCV mobile library (모바일 기반 OpenCV 라이브러리를 이용한 마커리스 객체 인식 성능 향상)

  • Jung, Hyeon-Sub;Yin, Xiyuan;Kim, Shin-Dug
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2013.07a
    • /
    • pp.61-64
    • /
    • 2013
  • 본 논문에서는 모바일 기반 OpenCV 라이브러리를 이용한 마커리스 객체 인석 성능 향상을 위한 소프트웨어적인 관점의 방법을 제안한다. 기존의 마커리스 기반 알고리즘을 이용하여 테스트를 수행한 후 성능에 저하를 발생시키는 요인들을 분석하고 그에 따른 상황별 적절한 해결책을 제시한다. 이에 따라 크게 프로그램 코드 개선, 마커리스 기반 알고리즘 코드 개선, 센서를 활용한 성능 향상을 도모한다. 프로그램 코드 개선은 테스트 결과를 분석 한 후 수행시간이 가장 많이 소요되는 함수를 최적화하고 또한 최적의 특징점의 수를 제한한다. 마커리스 기반 알고리즘 코드 개선은 병렬 처리가 제공되는 모바일에 한하여 병렬처리기법으로 코드를 수정한다. 마지막 센서를 활용한 성능향상은 실시간 작업 처리 단위를 묶음으로 처리하였을 때 발생하는 품질의 저하를 보정하는 역할을 수행한다. 본 논문에서는 이러한 마커리스 객체 인식 성능 향상 방법을 소프트웨어적인 관점에서 제안하고 이에 대한 결과 모바일 기반 실시간 증강현실 서비스를 위한 성능 향상 면에서 효과적이다.

  • PDF