• Title/Summary/Keyword: Code Optimization

Search Result 589, Processing Time 0.033 seconds

3-D Topology Optimization by a Nodal Density Method Based on a SIMP Algorithm (SIMP 기반 절점밀도법에 의한 3 차원 위상최적화)

  • Kim, Cheol;Fang, Nan
    • Proceedings of the KSME Conference
    • /
    • 2008.11a
    • /
    • pp.412-417
    • /
    • 2008
  • In a traditional topology optimization method, material properties are usually distributed by finite element density and visualized by a gray level image. The distribution method based on element density is adequate for a great mass of 2-D topology optimization problems. However, when it is used for 3-D topology optimization, it is always difficult to obtain a smooth model representation, and easily appears a virtualconnect phenomenon especially in a low-density domain. The 3-D structural topology optimization method has been developed using the node density instead of the element density that is based on SIMP (solid isotropic microstructure with penalization) algorithm. A computer code based on Matlab was written to validate the proposed method. When it was compared to the element density as design variable, this method could get a more uniform density distribution. To show the usefulness of this method, several typical examples of structure topology optimization are presented.

  • PDF

Optimizing Constant Value Generation in Just-in-time Compiler for 64-bit JavaScript Engine (64-bit 자바스크립트 적시 컴파일러를 위한 상수 값 생성 최적화)

  • Choi, Hyung-Kyu;Lee, Jehyung
    • Journal of KIISE
    • /
    • v.43 no.1
    • /
    • pp.34-39
    • /
    • 2016
  • JavaScript is widely used in web pages with HTML. Many JavaScript engines adopt Just-in-time compilers to accelerate the execution of JavaScript programs. Recently, many newly introduced devices are adopting 64-bit CPUs instead of 32-bit and Just-in-time compilers for 64-bit CPU are slowly being introduced in JavaScript engines. However, there are many inefficiencies in the currently available Just-in-time compilers for 64-bit devices. Especially, the size of code is significantly increased compared to 32-bit devices, mainly due to 64-bit wide addresses in 64-bit devices. In this paper, we are going to address the inefficiencies introduced by 64-bit wide addresses and values in the Just-in-time compiler for the V8 JavaScript engine and propose more efficient ways of generating constant values and addresses to reduce the size of code. We implemented the proposed optimization in the V8 JavaScript engine and measured the size of code as well as performance improvements with Octane and SunSpider benchmarks. We observed a 3.6% performance gain and 0.7% code size reduction in Octane and a 0.32% performance gain and 2.8% code size reduction in SunSpider.

Lightweight Loop Invariant Code Motion for Java Just-In-Time Compiler on Itanium (Itanium상의 자바 적시 컴파일러를 위한 가벼운 루프 불변 코드 이동)

  • Yu Jun-Min;Choi Hyung-Kyu;Moon Soo-Mook
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.3
    • /
    • pp.215-226
    • /
    • 2005
  • Loop invariant code motion (LICM) optimization includes relatively heavy code analyses, thus being not readily applicable to Java Just-In-Time (JIT) compilation where the JIT compilation time is part of the whole running time. 'Classical' LICM optimization first analyzes the code and constructs both the def-use chains and the use-def chains. which are then used for performing code motions. This paper proposes a light-weight LICM algorithm, which requires only the def-use chains of loop invariant code (without use-def chains) by exploiting the fact that the Java virtual machine is based on a stack machine, hence generating code with simpler patterns. We also propose two techniques that allow more code motions than classical LICM techniques. First, unlike previous JIT techniques that uses LICM only in single-path loops for simplicity, we apply LICM to multi-path loops (natural loops) safely for partially redundant code. Secondly, we move loop-invariant, partially-redundant null pointer check code via predication support in Itanium. The proposed techniques were implemented in a JIT compiler for Itanium processor on ORP (Open Runtime Platform) Java virtual machine of Intel. On SPECjvrn98 benchmarks, the proposed technique increases the JIT compilation overhead by the geometric mean of 1.3%, yet it improves the total running time by the geometric mean of 2.2%.

Scenario based optimization of a container vessel with respect to its projected operating conditions

  • Wagner, Jonas;Binkowski, Eva;Bronsart, Robert
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.6 no.2
    • /
    • pp.496-506
    • /
    • 2014
  • In this paper the scenario based optimization of the bulbous bow of the KRISO Container Ship (KCS) is presented. The optimization of the parametrically modeled vessel is based on a statistically developed operational profile generated from noon-to-noon reports of a comparable 3600 TEU container vessel and specific development functions representing the growth of global economy during the vessels service time. In order to consider uncertainties, statistical fluctuations are added. An analysis of these data lead to a number of most probable upcoming operating conditions (OC) the vessel will stay in the future. According to their respective likeliness an objective function for the evaluation of the optimal design variant of the vessel is derived and implemented within the parametrical optimization workbench FRIENDSHIP Framework. In the following this evaluation is done with respect to vessel's calculated effective power based on the usage of potential flow code. The evaluation shows, that the usage of scenarios within the optimization process has a strong influence on the hull form.

Structure Optimization FEA Code Development Under Frequency Constraints by Using Feasible Direction Optimization Method (유용방향법 최적화 알고리즘을 사용한 고유진동수에 대한 구조 최적설계 FEA 모듈 개발)

  • Cho, Hee Keun
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.22 no.1
    • /
    • pp.63-69
    • /
    • 2013
  • In order to find the optimum design of structures that have characteristic natural frequency range, a numerical optimization method to solving eigenvalue problems is a widely used approach. However in the most cases, it is difficult to decide the accurate thickness and shape of structures that have allowable natural frequency in design constraints. Parallel analysis algorithm involving the feasible direction optimization method and Rayleigh-Ritz eigenvalue solving method is developed. The method is implemented by using finite element method. It calculates the optimal thickness and the thickness ratio of individual elements of the 2-D plane element through a parallel algorithm method which satisfy the design constraint of natural frequency. As a result this method of optimization for natural frequency by using finite element method can determine the optimal size or its ratio of geometrically complicated shape and large scale structure.

Performance Optimization of the Two-Stage Gas Gun Based on Experimental Result (2-단계 기포(氣砲)의 성능 최적화에 관한 연구)

  • 이진호;배기준;전권수;변영환;이재우;허철준
    • Proceedings of the Korean Society of Propulsion Engineers Conference
    • /
    • 2003.10a
    • /
    • pp.145-150
    • /
    • 2003
  • The present study aims to optimize the performance of the Two-Stage Gas Gun by using the experimentally obtained data. RSM(Response Surface Method) was adopted in the optimization process to find the operating parameter than can maximize the projectile speed with the minimum number of tests. To decide the test points which results can consist of the response surface, 3$^{k}$ full factorial method was used, and the design variables were chosen with piston mass and 2$^{nd}$ driver fill pressure. The response surface was composed by nine test results and consequently the optimization was done with GENOCOP III, inherently GA code, in order to seek the optimal test point. The optimal test condition from the response surface was verified by the experiment. Results showed that the optimization process with response surface can successfully predict the test results fairly well. This study shows the possibility of performance optimization for the experimental facilities using numerical optimization algorithm.

  • PDF

Two-Dimensional Trajectory Optimization for Soft Lunar Landing Considering a Landing Site

  • Park, Bong-Gyun;Ahn, Jong-Sun;Tahk, Min-Jea
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.12 no.3
    • /
    • pp.288-295
    • /
    • 2011
  • This paper addresses minimum-fuel, two-dimensional trajectory optimization for a soft lunar landing from a parking orbit to a desired landing site. The landing site is usually not considered when performing trajectory optimization so that the landing problem can be handled. However, for precise trajectories for landing at a desired site to be designed, the landing site has to be considered as the terminal constraint. To convert the trajectory optimization problem into a parameter optimization problem, a pseudospectral method was used, and C code for feasible sequential quadratic programming was used as a numerical solver. To check the reliability of the results obtained, a feasibility check was performed.

Compiler triggered C level error check (컴파일러에 의한 C레벨 에러 체크)

  • Zheng, Zhiwen;Youn, Jong-Hee M.;Lee, Jong-Won;Paek, Yun-Heung
    • The KIPS Transactions:PartA
    • /
    • v.18A no.3
    • /
    • pp.109-114
    • /
    • 2011
  • We describe a technique for automatically proving compiler optimizations sound, meaning that their transformations are always semantics-preserving. As is well known, IR (Intermediate Representation) optimization is an important step in a compiler backend. But unfortunately, it is difficult to detect and debug the IR optimization errors for compiler developers. So, we introduce a C level error check system for detecting the correctness of these IR transformation techniques. In our system, we first create an IR-to-C converter to translate IR to C code before and after each compiler optimization phase, respectively, since our technique is based on the Memory Comparison-based Clone(MeCC) detector which is a tool of detecting semantic equivalency in C level. MeCC accepts only C codes as its input and it uses a path-sensitive semantic-based static analyzer to estimate the memory states at exit point of each procedure, and compares memory states to determine whether the procedures are equal or not. But MeCC cannot guarantee two semantic-equivalency codes always have 100% similarity or two codes with different semantics does not get the result of 100% similarity. To increase the reliability of the results, we describe a technique which comprises how to generate C codes in IR-to-C transformation phase and how to send the optimization information to MeCC to avoid the occurrence of these unexpected problems. Our methodology is illustrated by three familiar optimizations, dead code elimination, instruction scheduling and common sub-expression elimination and our experimental results show that the C level error check system is highly reliable.

Shape Optimization of Structural Members Based on Isogeometry Concept (등기하 개념에 기초한 구조부재의 형상 최적화)

  • Lee, Joo-Sung
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.24 no.1
    • /
    • pp.61-67
    • /
    • 2011
  • This study is concerned with the shape optimization of structural members frequently found in critical area in a structure system, that is, highly stressed zone. Isogeometry analysis is well known to be the very efficient way to integrate the geometric modeling(CAD) and computational analysis(CAE). This can be accomplished by directly using the geometric modeling by NURBS(Non-Uniform Rational Basis Spline). In this study, an efficient computer code adopting the isogeometry concept has been developed for the structural analysis, in which CAD information can be directly used in the finite element modeling. In order to show the validity of the present code, the present results are compared with those by using the commercial package, that is, MSC/NASTRAN. The present isogeometric analysis procedure has been integrated with the optimization procedure to deal with the optimization problem found in the context of structural mechanics. The present system has been successfully applied to the shape optimization of cantilever structure having bracket. From the present study, it can be seen the validity of the present approach and computer codes developed in this study. This paper ends with some discussions about the practical usefulness of the present approach which is based on isogeometry analysis, and extension of the present study.

A Study on the Integration of Analysis Modules and the Optimization Process in the MDO Framework (MDO 프레임워크 개발을 위한 해석 코드 및 최적화 과정 통합에 관한 연구)

  • Cho, Sang-Oh;Lee, Jae-Woo;Byun, Yung-Hwan
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.30 no.7
    • /
    • pp.1-10
    • /
    • 2002
  • Multidisciplinary Design Optimization (MDO) is a new design approach, which aims to reduce the design cycle and the development cost, while improving the performance of the product. In order to develop a framework software where the multidisciplinary design is possible, several methods about the analysis codes integration, the analysis and optimization process management, and the software architecture, are proposed in this study. Centralized DataBase Management System (DBMS) is adopted. Both the Dynamic Link Library(DLL) and the File Interface are suggested and implemented as analysis codes integration methods. To efficiently manage the optimization process and the data flow, the Graphic Programming approach is introduced. The proposed integration methods are verified by two test case examples: Simple house design example and the aircraft wing design problem using three dimensional Panel Code.