• The Transactions of the Korea Information Processing Society
• /
• v.5 no.5
• /
• pp.1345-1356
• /
• 1998

Prolog tailoring technique, an optimization method to improve the execution speed of a procedure, is proposed in this paper. When a procedure is frequently and repeatedly called and the machine has a lot of callee-saved registers, optimizing prolog and epilog can become an important step of optimization. Epilg tailoring supported by IBM XL C Compiler has been known to improve procedure's execution speed by reducing register restore instructions on execution paths, but no algorithms for prolog tailoring has been proposed yet. The prolog generated by the prolog tailoring algorithm proposed in this paper executes considerably smaller number of register save instructions at run-time. This means the total number of instructions to be executed is decreased resulting in an improvement on the procedure's execution speed. To maintain the correctness of code, prolog code should not be inserted inside diamond structures of loop structures. This paper proposes a prolog tailoring technique which generates register save instructions at the best position in a control flow graph while not allowing the insertion of any prolog code inside diamond structures of loop structures.

• Composites Research
• /
• v.21 no.1
• /
• pp.1-7
• /
• 2008

Composite vessels for high pressure gas storage are commonly used these days because of their competitive weight reduction ability maintaining strong mechanical properties. To supplement permeability of composite under high pressure, it is usually lined by metal, which is called a Type 3 vessel. However, it has many difficulties to design the Type 3 vessel because of its complex geometry, fabrication process variables, etc. In this study, therefore, GUI (graphic user interface) optimal design code for Type 3 vessels was developed based on semi-geodesic algorithm in which various factors of geometry and fabrication variables are considered and genetic algorithm for optimization. In addition, hydrogen vessels for 350/700 bar that can be applied to FCVs(fuel cell vehicles) were designed using this code for verification.

• 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.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.107-117
• /
• 2006

Java language creates class files through Java compiler. Class files include informations involved with achievement of program. We can do analysis and optimization for efficient codes by analyzing class files. This paper analyzes bytecodes using informations of Java class files. We translate stack-based Java bytecodes into 3-address codes. Then we translate into static single assignment form using the 3-address codes. Static single assignment form provides a compact representation of a variable's definition-use information. Static single assignment form is often used as an intermediate representation during code optimization. Static sing1e assignment form renames each occurrence of a variable such that each variable is defined only once.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.2
• /
• pp.102-110
• /
• 2009

The memory wall is the growing disparity of speed between CPU and memory outside the CPU chip. An economical solution is a memory hierarchy organized into several levels, such as processor registers, cache, main memory, disk storage. We introduce a novel memory hierarchy optimization technique in Linux based embedded systems using on-chip SRAM for the first time. The optimization technique allocates On-Chip SRAM to the code/data that selected by programmers by using virtual memory systems. Experiments performed with nine applications indicate that the runtime improvements can be achieved by up to 35%, with an average of 14%, and the energy consumption can be reduced by up to 40%, with an average of 15%.

• International Journal of Aeronautical and Space Sciences
• /
• v.17 no.3
• /
• pp.409-422
• /
• 2016

A parametric study based on an unsteady mathematical model of a pyrotechnically actuated device was performed for design optimization. The model simulates time histories for the chamber pressure, temperature, mass transfer and pin motion. It is validated through a comparison with experimentally measured pressure and pin displacement. Parametric analyses were conducted to observe the detailed effects of the design parameters using a validated performance analysis code. The detailed effects of the design variables on the performance were evaluated using the one-at-a-time (OAT) method, while the scatter plot method was used to evaluate relative sensitivity. Finally, the design optimization was conducted by employing a genetic algorithm (GA). Six major design parameters for the GA were chosen based on the results of the sensitivity analysis. A fitness function was suggested, which included the following targets: minimum explosive mass for the uniform ignition (small deviation), light casing weight, short operational time, allowable pyrotechnic shock force and finally the designated pin kinetic energy. The propellant mass and cross-sectional area were the first and the second most sensitive parameters, which significantly affected the pin's kinetic energy. Even though the peak chamber pressure decreased, the pin kinetic energy maintained its designated value because the widened pin cross-sectional area induced enough force at low pressure.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.12 no.4
• /
• pp.114-122
• /
• 2013

This study introduces an optimization methodology for the determination of gate location that ensures the melt flow balance within a part cavity of injection mold. A new sequential direct-search scheme based on the recursive reduction of the designer-specified gate design area is developed, and it is integrated with a commercial flow simulation tool for optimization. To quantify the level of melt flow balance, we employ the maximum difference among the fill times for the melt fronts to reach the boundary elements of part cavity as objective function. The proposed methodology is successfully applied in the case study of melt flow balancing in molding of a bar code scanner model. The result shows that the melt flow balance at the optimized gate positions is significantly improved from that for the initial gate position.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.32 no.6
• /
• pp.34-48
• /
• 2004

In this paper an optimization algorithm is suggested to reduce the huge computation time in the optimum design of large structures, especially in spacecraft structures. It combines the coupled load analysis model using a constrained mode of component mode synthesis and the modal transient analysis. The computer simulation code is developed and evaluated in optimizing spacecraft platforms. The developed algorithm can alleviate the computational load with adequate accuracy. From the optimization of a spacecraft structural member, the characteristics of each structural member can be understood.

• Magazine of the Korea Concrete Institute
• /
• v.9 no.1
• /
• pp.133-141
• /
• 1997

This work presents a method of optimum design for reinforced concrete building frames with rectangular cross sections. To overcome difficulties arising from the presence of two materials in one element(concrete and steel) , the principle of divided parameters is adopted. The design variable parameters are divided into two groups - external and internal. The optimization is also divided into external and internal procedure. Several scarxh algorithms are tested to verify their accuracy for the external optimization. This work proposes a new search method, a modified pattern search, and sample problems prove its accuracy and uscf'ulness. The design obtained by this method is an optimum and in full accord with ACI Building Code Ftequirements(ACI'318-89).

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.36 no.2
• /
• pp.111-122
• /
• 1994

In this study, an algorithm which can be applied to the optimum design of simple steel plate girders was developed, and efficient optimization strategies for the solution of algorithm were found out. The optimum design algorithm consists of 3-levels of optimization. In the first and second levels of optimization, the absolute maximum bending moment and shearing force are extracted and in the third level of optimization, the optimum cross section of steel plate girder is determined. For the optimum design of cross section, the objective function is formulated as the total area of cross section and constraints are derived in consideration of the various stresses and the minimum dimension of flange and web based on the part of steel bridge in the Korea standard code of road bridge. Sequential unconstrained minimization technique using the exterior penalty function method(SUMT-EP), sequential linear programming(SLP) and sequential quadratic programming (SQP) are proved to be efficient and robust strategies for the optimum design of simple plate girder cross section. From the reliable point of view, SLP is the most efficient and robust strategy and SQP is the most efficient one from the viewpoint of converguency and computing time.