• Proceedings of the Korean Society of Marine Engineers Conference
• /
• 2012.06a
• /
• pp.104-104
• /
• 2012

이 프로그램의 중요한점은 기존 모든 선박이 가지고 있는 각종 에너지 손실 및 온실가스 배출관련 육상의 ECO-DRIVER에 준하는 해상의 ECO-SAILING 방식의 알고리즘으로 접근하여 IT융합을 기반으로 SW만으로 에너지 효율 최적화와 온실가스 저감을 구현한다고 할수 있다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.6
• /
• pp.378-387
• /
• 2007

To enhancing the exercise effect, exercise management systems are introduced and generally used. They create the proper exercise program through exercise prescription after determining the personal body status. When the exercise programs are created, they will consider $2weeks{\sim}3months$ period. And, existing exercise programs cannot respect with personal exercise habits or exercise period which are changing variedly. If exercise period is long, it can be caused inappropriate exercise about user current status. To solve these problems in legacy systems, this paper proposes a Context Aware Exercise Model (CAEM) to provide the exercise program considering the user context. Also, we implemented that as Intelligent Fitness Guide (IFG) System. The IFG system is selectively received necessary measurement values as input values according to user's context. If exercise kinds, frequency and strength of user are changing, that system creates the exercise program through exercise optimization algorithm and exercise knowledge base. As IFG is providing the exercise program in a real time, it can be managed the effective exercise according to user context.

• Proceedings of the Acoustical Society of Korea Conference
• /
• spring
• /
• pp.367-372
• /
• 2004

디지탈 보청기의 DSP 칩 파라미터들은 보청기 사용자에게 가장 최적의 파라미터들로 구성되어져야 한다. Gennum GB3211과 같은 디지탈 보청기용 DSP 칩은 전용 전자 칩으로써 약 90 여개의 제한된 파라미터들을 조합하여 약 47억여개 이상의 거의 무한한 정도의 다양한 경우 수를 대응하도록 제작되었다. 보청기 사용자의 전기-음향 효과를 극대화하기 위해 가장 최적화된 파라미터 피팅 프로그램을 개발하였다. 컴퓨터 입력이 가능한 오디오그램 청력 역치로부터 여러 다른 Formula를 사용할 뿐 만 아니라, 마이크로폰과 리시버의 보정 효과를 모두 포함하는 최적 보청기 피팅 프로그램을 개발하였으며 몇 가지 사례를 적용해 보였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.338-341
• /
• 2011

프로그램 코드 사이즈는 내장형시스템 구성에 있어서 고려해야 할 핵심 요소중의 하나이다. 프로그램 사이즈는 해당 시스템의 메모리 크기, 전력소모, 성능, 가격 등에 영향을 미치기 때문이다. 프로그램 코드 사이즈를 최적화하기 위하여 활용할 수 있는 시스템 자원 중에서 효과적인 것 중 하나가 복수 로드/스토어 명령어(Multiple Load/Store Instruction, MLS)이다. MLS 명령어는 하나의 명령어로 하나이상의 메모리 값을 레지스터로 블록 전송 (block transfer)하는 것이 가능하기 때문이다. 본 연구에서는 MLS명령어를 기존보다 효과적으로 생성함으로써 코드 크기를 감소시키는 최적화 기법에 대해 논의한다. 실험을 통하여 Mediabench와 DSPStone 벤치마크에서 본 연구에서 제안하는 기법을 통하여 평균 메모리 접근 코드사이즈가 10.3% 감소하였다.

• Annual Conference of KIPS
• /
• 2012.04a
• /
• pp.514-517
• /
• 2012

최근 인터넷 사용자 증가와 네트워크를 기반의 응용 프로그램이 다양하게 개발되고 있다. 또한 스마트 폰과 매블릿 PC 의 대중화로 누구나 쉽게 인터넷을 통해 정보검색 서비스를 이용할 수 있다. 따라서 갈수록 증가하는 패킷에 대한 제]어와 이동, 삭제 등과 같은 처리를 빠르게 하기 위해 네트워크 프로세서 (Network Processor)가 개발되었다. 네트워크 프로세서는 패킷 제어와 이동, 삭제를 수행하는데 최적화되어 있다. 하지만 네트워크 프로세서를 개발한 회사마다 교차개발환경 툴과 개발언어가 서로 다르기 때문에 소스코드 재사용 및 확장이 어렵다. 또한 네트워크 프로세서에서 동작하는 프로그램을 매스트 하기 위해 하드웨어 장비가 필요하고 네트워크 프로세서에 종속적인 개발환경과 언어를 배우는 것은 프로그래머에게 큰 부담을 준다. 본 논문에서는 네트워크 프로세서에 최적화된 기능을 언어 레벨에서 정의한 eFlowC 언어를 사용하고 범용 컴퓨터에서 매스트 및 실행을 할 수 있는 가상머신을 제안한다. 그리고 가상머신 중간언어를 사용하여 가상머신이 설치된 범용 컴퓨터에서 소스코드 재사용 및 확장을 가능하게 한다. 따라서 범용 컴퓨터에서 프로그램 테스트를 통해 신뢰성 높은 프로그램을 작성할 수 있다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.10
• /
• pp.221-230
• /
• 2020

Supercomputer that shares limited resources to multiple users needs a way to optimize the execution of application. For this, it is useful for system administrators to get prior information and hint about the applications to be executed. In most high-performance computing system operations, system administrators strive to increase system productivity by receiving information about execution duration and resource requirements from users when executing tasks. They are also using profiling techniques that generates the necessary information using statistics such as system usage to increase system utilization. In a previous study, we have proposed a scheduling optimization technique by developing a hardware performance counter-based profiling technique that enables characterization of applications without further understanding of the source code. In this paper, we constructed a profiling testbed cluster to support optimal execution of the supercomputer and experimented with the scalability of the profiling method to analyze application characteristics in the built cluster environment. Also, we experimented that the profiling method can be utilized in actual scheduling optimization with scalability even if the application class is reduced or the number of nodes for profiling is minimized. Even though the number of nodes used for profiling was reduced to 1/4, the execution time of the application increased by 1.08% compared to profiling using all nodes, and the scheduling optimization performance improved by up to 37% compared to sequential execution. In addition, profiling by reducing the size of the problem resulted in a quarter of the cost of collecting profiling data and a performance improvement of up to 35%.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.31 no.8
• /
• pp.36-43
• /
• 2003

In this study, a satellite payload module was optimized by considering local stabilities. As design constraints in the satellite structure, local instabilities such as wrinkling, dimpling, crippling for honeycomb structures and crippling failure mode for beams were considered in addition to frequency and stress constraints. The constraints for the local instabilities (uncommon in general structures) were taken for the optimization of a satellite structures under severe launching environments. The analysis was performed combining the finite element analysis and optimization program. From the optimization results, it was found that frequency, crippling and wrinkling were the most critical constraints to achieve the design goals. Also, the importance of each design variable was estimated. Finally, the optimum design of the payload module was achieved for various design constraints and design parameters.

• Journal of KIISE
• /
• v.44 no.9
• /
• pp.986-991
• /
• 2017

In this paper, we present a method for synthesizing imperative programs from input-output examples. Given (1) a set of input-output examples, (2) an incomplete program, and (3) variables and integer constants to be used, the synthesizer outputs a complete program that satisfies all of the given examples. The basic synthesis algorithm enumerates all possible candidate programs until the solution program is found (enumerative search). However, it is too slow for practical use due to the huge search space. To accelerate the search speed, our approach uses code optimization and avoids unnecessary search for the programs that are syntactically different but semantically equivalent. We have evaluated our synthesis algorithm on 20 introductory programming problems, and the results show that our method improves the speed of the basic algorithm by 10x on average.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.8
• /
• pp.421-431
• /
• 2004

This paper presents adaptive execution techniques that determine whether parallelized loops are executed in parallel or sequentially in order to maximize performance. The adaptation and performance estimation algorithms are implemented in a compiler preprocessor. The preprocessor inserts code that automatically determines at compile-time or at run-time the way the parallelized loops are executed. Using a set of standard numerical applications written in Fortran77 and running them with our techniques on a distributed shared memory multiprocessor machine (SGI Origin2000), we obtain the performance of our techniques, on average, 26%, 20%, 16%, and 10% faster than the original parallel program on 32, 16, 8, and 4 processors, respectively. One of the applications runs even more than twice faster than its original parallel version on 32 processors.

• Journal of KIISE:Software and Applications
• /
• v.37 no.12
• /
• pp.882-891
• /
• 2010

Many automated dynamic test data generation technique have been proposed. The techniques evaluate fitness of test data through executing instrumented Software Under Test (SUT) and then generate new test data based on evaluated fitness values and optimization algorithms. Previous researches and experiments have been showed that these techniques generate effective test data. However, optimization algorithms in these techniques incur much time to generate test data, which results in huge test case generation cost. In this paper, we propose a technique for reducing the time of evaluating a fitness of test data among steps of dynamic test data generation methods. We introduce the concept of Fitness Evaluation Program (FEP), derived from a path constraint of SUT. We suggest a test data generation method based on FEP and implement a test generation tool, named ConGA. We also apply ConGA to generate test cases for C programs, and evaluate efficiency of the FEP-based test case generation technique. The experiments show that the proposed technique reduces 20% of test data generation time on average.