• Title/Summary/Keyword: conditional code

Search Result 35, Processing Time 0.023 seconds

Eulerian 및 Lagrangian CMC 모델을 사용한 디젤분무연소 모델링에 관한 연구 (A Study on Diesel Spray Combustion Modeling by Eulerian and Lagrangian Conditional Moment Closure Models)

  • 김우태;조현수;허강열
    • 한국연소학회:학술대회논문집
    • /
    • 한국연소학회 2012년도 제45회 KOSCO SYMPOSIUM 초록집
    • /
    • pp.195-198
    • /
    • 2012
  • Numerical simulation is performed to evaluate the conditional moment closure (CMC) models for spray development, ignition, and turbulent combustion for the Engine Combustion Network (ECN) test cases. The CMC model is implemented in the open source code, OpenFOAM, to provide conditional flame structures through the solution of Eulerian as well as Lagrangian conditional transport equations. In spite of more accurate treatment of the convective term, Eulerian CMC provides similar ignition delays and lift-off lengths with Lagrangian CMC.

  • PDF

백트란 코드화를 위한 프로그램 변환과 단순화 (On the Program Conversion and Conditional Simplification for VECTRAN Code)

  • 황선명;김행곤
    • 한국정보처리학회논문지
    • /
    • 제1권1호
    • /
    • pp.38-49
    • /
    • 1994
  • 기존 포트란 프로그램을 벡터 처리 가능한 코드인 벡트란으로 변환시키는데 있어 서 가장 문제가 되는 것은 루프내에서 제어의 분기가 발생하는 경우 조건적 전달이 일어난다는 것이다. 조건적 전단이란 어떤 문장의 실행이 다른 문장내의 변수 값에 의 해 이루어지는 제어 의존성으로, 본 논문은 루프내부의 조건적 제어를 제거하기 위한 알고리즘과 조건적 할당문을 이용하였을 때 그 내부의 복잡한 조건에 대한 단순화 알 고리즘을 제시한다. 이 때 조건적 할당문의 조건은 부울 변수(2-상태)뿐 아니라 3가지 이상의 상태를 나타내는 n-상태변수를 통하여 나타낸다.

  • PDF

HSDI 디젤엔진의 연료분사계와 연소현상을 연계한 수치해석 (Coupled Simulation of Common Rail Fuel Injection and Combustion Characteristics in a HSDI Diesel Engine)

  • 이석영;허강열
    • 한국연소학회지
    • /
    • 제15권1호
    • /
    • pp.1-11
    • /
    • 2010
  • In this study, the coupled simulation of fuel injection model and three-dimensional KIVA-3V code was tried to develop an algorism for predicting the effects of varying fuel injection parameter on the characteristics of fuel injection and emissions. The numerical simulations were performed using STAR-CD code in order to calculate the intake air flow, and the combustion characteristics is examined by KIVA-3V code linked with the conditional moment closure(CMC) model to predict mean turbulent reaction rate. Parametric investigation with respect to twelve relevant injection parameters shows that appropriate modification of control chamber orifice diameter, needle valve spring constant and nozzle chamber orifice diameter can significantly reduce NOx and soot emissions. Consequently, it is needed to optimize the fuel injection system to reduce the specific emissions such as NOx and soot.

CONDITIONAL MOMENT CLOSURE MODELING OF TURBULENT SPRAY COMBUSTION IN A DIRECT INJECTION DIESEL ENGINE

  • HAN I. S.;HUH K. Y.
    • International Journal of Automotive Technology
    • /
    • 제6권6호
    • /
    • pp.571-577
    • /
    • 2005
  • Combustion of turbulent sprays in a direct injection diesel engine is modeled by the conditional moment closure (CMC) model. The CMC routines are combined with the KIVA code to provide conditional flame structures to determine mean state variables, instead of mean reaction rates. An independent transport equation is solved for each flame group with equal mass of sequentially evaporating fuel vapor. CMC calculation begins as the fuel mass for each flame group begins to evaporate with corresponding initialization conditions. Comparison is made with measured pressure traces for four operating conditions at different rpm's and injection conditions. Results show that the CMC model with multiple flame histories can successfully be applied to ignition and mixing-controlled combustion phases of a diesel engine.

수퍼스칼라 프로세서를 위한 컴파일러에서 조건부 분기의 최적화 (Conditional Branch Optimization in the Compilers for Superscalar Processors)

  • 김명호;최완
    • 한국정보처리학회논문지
    • /
    • 제2권2호
    • /
    • pp.264-276
    • /
    • 1995
  • 본 논문에서는 수퍼스칼라 프로세서를 위한 컴파일러에서 조건부 분기 명령을 제 거하는 최적화 기법을 제시하였다. 분기를 제거하는 단계적 방법으로 먼저 대수적 규 칙을 사용하여 분기를 산술식의 형태로 변형하고, 그 식에 대응하는 명령 수순을 Granlund/Kenner의 GSO를 사용하여 완전 탐색한 후 목적 프로세서에서 실행시 최소의 동적 계수를 갖는 명령 수순을 선택하였다. 제안한 분기 최적화 기법을 SuperSPARC 프로세서와 GNU C 컴파일러를 사용하여 실험한 결과 입력 프로그램에서 최적화 패턴 과 대응하는 조건부 분기의 경우 원래의 컴파일러가 생성하는 최적 코드 수순에 비하 여 25% 이상의 추가적인 수행시간 개선 효과를 얻을 수 있었다.

  • PDF

Computationally Efficient Implementation of a Hamming Code Decoder Using Graphics Processing Unit

  • Islam, Md Shohidul;Kim, Cheol-Hong;Kim, Jong-Myon
    • Journal of Communications and Networks
    • /
    • 제17권2호
    • /
    • pp.198-202
    • /
    • 2015
  • This paper presents a computationally efficient implementation of a Hamming code decoder on a graphics processing unit (GPU) to support real-time software-defined radio, which is a software alternative for realizing wireless communication. The Hamming code algorithm is challenging to parallelize effectively on a GPU because it works on sparsely located data items with several conditional statements, leading to non-coalesced, long latency, global memory access, and huge thread divergence. To address these issues, we propose an optimized implementation of the Hamming code on the GPU to exploit the higher parallelism inherent in the algorithm. Experimental results using a compute unified device architecture (CUDA)-enabled NVIDIA GeForce GTX 560, including 335 cores, revealed that the proposed approach achieved a 99x speedup versus the equivalent CPU-based implementation.

다중 안테나를 적용한 UWB 시스템의 PN 부호 포착 성능 분석 (Analysis of PN Code Acquisition Performance with Multiple Antennas in a UWB System)

  • 김은철;김진영
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2005년도 추계종합학술대회
    • /
    • pp.69-72
    • /
    • 2005
  • In this paper, pseudo noise (PN) code acquisition performance with multiple antennas in a UWB time hopping/code division multiple access system is analyzed. The closed form for the conditional probability is derived, using the Gauss-Hermite quadrature formula, when the signal with Gaussian distribution goes through the lognormal fading channel. The performance comparison of the above mentioned schemes shows that the code acquisition performance with a diversity combining technique, especially when increasing the number of antennas, is more robust than that using no diversity.

  • PDF

ER-Fuzz : Conditional Code Removed Fuzzing

  • Song, Xiaobin;Wu, Zehui;Cao, Yan;Wei, Qiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권7호
    • /
    • pp.3511-3532
    • /
    • 2019
  • Coverage-guided fuzzing is an efficient solution that has been widely used in software testing. By guiding fuzzers through the coverage information, seeds that generate new paths will be retained to continually increase the coverage. However, we observed that most samples follow the same few high-frequency paths. The seeds that exercise a high-frequency path are saved for the subsequent mutation process until the user terminates the test process, which directly affects the efficiency with which the low-frequency paths are tested. In this paper, we propose a fuzzing solution, ER-Fuzz, that truncates the recording of a high-frequency path to influence coverage. It utilizes a deep learning-based classifier to locate the high and low-frequency path transfer points; then, it instruments at the transfer position to promote the probability low-frequency transfer paths while eliminating subsequent variations of the high-frequency path seeds. We implemented a prototype of ER-Fuzz based on the popular fuzzer AFL and evaluated it on several applications. The experimental results show that ER-Fuzz improves the coverage of the original AFL method to different degrees. In terms of the number of crash discoveries, in the best case, ER-Fuzz found 115% more unique crashes than did AFL. In total, seven new bugs were found and new CVEs were assigned.

FIPS-OpenSSL 코드 분석을 통한 암호모듈 자가시험 보안요구사항 분석 (Study on Selftest Requirements in Cryptographic Module Validation Program with FIPS-OpenSSL Source Code Analysis)

  • 서석충
    • 정보보호학회논문지
    • /
    • 제29권5호
    • /
    • pp.985-996
    • /
    • 2019
  • 본 논문에서는 미국에서 암호모듈검증을 획득한 대표적인 소프트웨어 형태의 암호모듈인 FIPS-OpenSSL의 소스 코드를 분석하여 암호모듈 검증 및 시험기준에서 요구하는 보안요구사항이 소프트웨어적으로 어떻게 구현되어있는지 분석한다. 특히, 암호모듈이 반드시 탑재하고 있어야 하는 자가시험기능 (동작 전 자가시험, 조건부 자가시험) 관점으로 소스코드를 분석한다. 비록 미국 암호모듈 검증제도에서는 FIPS 140-2를 검증기준으로 삼고 있지만, FIPS 140-2는 국내 암호모듈 검증제도에서 암호모듈 검증 및 시험기준으로 삼고 있는 암호모듈 국제표준인 ISO/IEC 19790과 24759의 근간이 되었기 때문에 많은 유사함이 존재한다. 본 논문의 분석을 통하여 향후 암호모듈 개발업체에서 자가시험기능을 정확하고 안전하게 구현할 수 있을 것으로 기대한다.

Data Avaliability Scheduling for Synthesis Beyond Basic Block Scope

  • Kim, Jongsoo
    • Journal of Electrical Engineering and information Science
    • /
    • 제3권1호
    • /
    • pp.1-7
    • /
    • 1998
  • High-Level synthesis of digital circuits calls for automatic translation of a behavioral description to a structural design entity represented in terms of components and connection. One of the critical steps in high-level synthesis is to determine a particular scheduling algorithm that will assign behavioral operations to control states. A new scheduling algorithm called Data Availability Scheduling (DAS) for high-level synthesis is presented. It can determine an appropriate scheduling algorithm and minimize the number of states required using data availability and dependency conditions extracted from the behavioral code, taking into account of states required using data availability and dependency conditions extracted from the behavioral code, taking into account resource constraint in each control state. The DAS algorithm is efficient because data availability conditions, and conditional and wait statements break the behavioral code into manageable pieces which are analyzed independently. The output is the number of states in a finite state machine and shows better results than those of previous algorithms.

  • PDF