• Title/Summary/Keyword: Computation Efficiency

Search Result 792, Processing Time 0.028 seconds

IMAGE SYNTHESIS FOR DYNAMIC SCENES

  • Feng, Chen-Chin;Chang, Su-Yuan;Yang, Shi-Nine
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 1999.06a
    • /
    • pp.15.1-21
    • /
    • 1999
  • Radiosity method is a global illumination model for image synthesis. It computes all energy interactions among diffuse elements in a virtual environment. One of the major drawbacks if its time consuming computation. Existing radiosity algorithms for static scene is difficult to be applicable to dynamic environments. In this paper we proposed an hierarchical scene partition scheme to speedup the link update computations in the dynamic environments. Since the proposed spatial data structure is global, it not only can be used to speedup the culling of non-affected links after geometry change, but also can be used to accelerate the subsequent visibility computation. Several empirical tests are given to show the efficiency of our improved algorithm.

A Software Implementation of The Elliptic Curve Digital Signature Algorithm on a Embedded System (임베디드 시스템에서의 ECDSA(Elliptic Curve Digital Signature Algorithm) 구현)

  • Kim, Hyeon-Ik;Kim, Yong-Min;Jeong, Seok-Won;Lee, Sang-Jin;Jeong, Chang-Hun
    • Proceedings of the KIEE Conference
    • /
    • 2003.11c
    • /
    • pp.1014-1017
    • /
    • 2003
  • In this paper, after the crypto acceleration board of the server-termination type is designed, we implement the Elliptic Curve Digital Signature Algorithm on the board that serves data integrity and user authentication. For implementing ECDSA, we use crypto co-processor, MPC180, to reduce the computation burden of main Processor (MPC860) on the board. By using crypto co-processor, the computation efficiency in case prime field is improved more between 90 and 100 times than the software library and between 20 and 90 times in case binary field. Our result is expect to apply for SSL acceleration board.

  • PDF

Computation of Dynamic Stress in Flexible Multi-body Dynamics Using Absolute Nodal Coordinate Formulation (절대절점좌표를 이용한 탄성 다물체동역학 해석에서의 동응력 이력 계산에 관한 연구)

  • 서종휘;정일호;박태원
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.21 no.5
    • /
    • pp.114-121
    • /
    • 2004
  • Recently, the finite element absolute nodal coordinate formulation (ANCF) was developed for the large deformation analysis of flexible bodies in multi-body dynamics. This formulation is based on the finite element procedures and the general continuum mechanics theory to represent the elastic forces. In this paper, a computation method of dynamic stress in flexible multi-body dynamics using absolute nodal coordinate formulation is proposed. Numerical examples, based on an Euler-Bernoulli beam theory, are shown to verify the efficiency of the proposed method. This method can be applied for predicting the fatigue life of a mechanical system. Moreover, this study demonstrates that structural and multi-body dynamic models can be unified in one numerical system.

Fast 3D reconstruction method based on UAV photography

  • Wang, Jiang-An;Ma, Huang-Te;Wang, Chun-Mei;He, Yong-Jie
    • ETRI Journal
    • /
    • v.40 no.6
    • /
    • pp.788-793
    • /
    • 2018
  • 3D reconstruction of urban architecture, land, and roads is an important part of building a "digital city." Unmanned aerial vehicles (UAVs) are gradually replacing other platforms, such as satellites and aircraft, in geographical image collection; the reason for this is not only lower cost and higher efficiency, but also higher data accuracy and a larger amount of obtained information. Recent 3D reconstruction algorithms have a high degree of automation, but their computation time is long and the reconstruction models may have many voids. This paper decomposes the object into multiple regional parallel reconstructions using the clustering principle, to reduce the computation time and improve the model quality. It is proposed to detect the planar area under low resolution, and then reduce the number of point clouds in the complex area.

A Simplified Model to Extract GPS based Trajectory Traces (간소화된 GPS 기반 궤적 추적 모델)

  • Saleem, Muhammad Aamir;Go, Byunggill;Lee, Y.K;Lee, S.Y.
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2013.05a
    • /
    • pp.472-473
    • /
    • 2013
  • The growth in number and efficiency of smart devices such as GPS enabled smart phones and PDAs present an unparalleled opportunity for diverse areas of life. However extraction of GPS traces for provision of services demand a huge storage space as well as computation overhead. This is a challenging task especially for the applications which provide runtime services. In this paper we provide a simplified model to extract GPS traces of moving objects at runtime. Road segment partitioning and measure of deviation in angle of trajectory path is incorporated to identify the significant data points. The number of these data points is minimized by our proposed approach in an efficient manner to overwhelm the storage and computation overhead. Further, the competent reconstruction of complete itinerary based on gathered data, is also ensured by proposed method.

Design Optimization on Wastewater Treatment Pump of Satisfaction for High Head and Low Flow Rate (고양정 및 저유량을 만족하는 폐수처리용 펌프 설계 최적화)

  • KIM, SUNG;KIM, JIN-HYUK
    • Transactions of the Korean hydrogen and new energy society
    • /
    • v.33 no.5
    • /
    • pp.583-590
    • /
    • 2022
  • In this paper, the performance characteristics of the 2 vane pump for wastewater treatment were investigated using response surface method(RSM) with commercial computation fluid dynamics(CFD) software. Design variables of wastewater treatment pump were defined with the meridional plane of the 2 vane pump impeller. The objective functions were defined as the total head and the efficiency at the design flow rate. The hydraulic performance of optimum model was verified by numerical analysis and the reliability of the model was retained by comparison of numerical analysis and comparative analysis with the reference model.

Numerical Ballistic Modeling in Game Engines

  • YoungBo Go;YunJeong Kang
    • International journal of advanced smart convergence
    • /
    • v.12 no.2
    • /
    • pp.117-126
    • /
    • 2023
  • To improve the overall performance and realism of your game, it is important to calculate the trajectory of a projectile accurately and quickly. One way to increase realism is to use a ballistic model that takes into account factors such as air resistance, density, and wind when calculating a projectile's trajectory. However, the more these factors are taken into account, the more computationally time-consuming and expensive it becomes, creating a trade-off between overall performance and efficiency. Therefore, we present an optimal solution to find a balance between ballistic model accuracy and computation time. We perform ballistic calculations using numerical methods such as Euler, Velocity Verlet, RK2, RK4, and Akima interpolation, and measure and compare the computation time, memory usage (RSS, Resident Set Size), and accuracy of each method. We show developers how to implement more accurate and efficient ballistic models and help them choose the right computational method for their numerical applications.

Design and analysis of RIF scheme to improve the CFD efficiency of rod-type PWR core

  • Chen, Guangliang;Qian, Hao;Li, Lei;Yu, Yang;Zhang, Zhijian;Tian, Zhaofei;Li, Xiaochang
    • Nuclear Engineering and Technology
    • /
    • v.53 no.10
    • /
    • pp.3171-3181
    • /
    • 2021
  • This research serves to advance the development of engineering computational fluid dynamics (CFD) computing efficiency for the analysis of pressurized water reactor (PWR) core using rod-type fuel assemblies with mixing vanes (one kind of typical PWR core). In this research, a CFD scheme based on the reconstruction of the initial fine flow field (RIF CFD scheme) is proposed and analyzed. The RIF scheme is based on the quantitative regulation of flow velocities in the rod-type PWR core and the principle that the CFD computing efficiency can be improved greatly by a perfect initialization. In this paper, it is discovered that the RIF scheme can significantly improve the computing efficiency of the CFD computation for the rod-type PWR core. Furthermore, the RIF scheme also can reduce the computing resources needed for effective data storage of the large fluid domain in a rod-type PWR core. Moreover, a flow-ranking RIF CFD scheme is also designed based on the ranking of the flow rate, which enhances the utilization of the flow field with a closed flow rate to reconstruct the fine flow field. The flow-ranking RIF CFD scheme also proved to be very effective in improving the CFD efficiency for the rod-type PWR core.

Analysis of GPU Performance and Memory Efficiency according to Task Processing Units (작업 처리 단위 변화에 따른 GPU 성능과 메모리 접근 시간의 관계 분석)

  • Son, Dong Oh;Sim, Gyu Yeon;Kim, Cheol Hong
    • Smart Media Journal
    • /
    • v.4 no.4
    • /
    • pp.56-63
    • /
    • 2015
  • Modern GPU can execute mass parallel computation by exploiting many GPU core. GPGPU architecture, which is one of approaches exploiting outstanding computational resources on GPU, executes general-purpose applications as well as graphics applications, effectively. In this paper, we investigate the impact of memory-efficiency and performance according to number of CTAs(Cooperative Thread Array) on a SM(Streaming Multiprocessors), since the analysis of relation between number of CTA on a SM and them provides inspiration for researchers who study the GPU to improve the performance. Our simulation results show that almost benchmarks increasing the number of CTAs on a SM improve the performance. On the other hand, some benchmarks cannot provide performance improvement. This is because the number of CTAs generated from same kernel is a little or the number of CTAs executed simultaneously is not enough. To precisely classify the analysis of performance according to number of CTA on a SM, we also analyze the relations between performance and memory stall, dram stall due to the interconnect congestion, pipeline stall at the memory stage. We expect that our analysis results help the study to improve the parallelism and memory-efficiency on GPGPU architecture.

Optimization Method on the Number of the Processing Elements in the Multi-Stage Motion Estimation Algorithm for High Efficiency Video Coding (HEVC 다단계 움직임 추정 기법에서 단위 연산기 개수의 최적화 방법)

  • Lee, Seongsoo
    • Journal of IKEEE
    • /
    • v.21 no.1
    • /
    • pp.100-103
    • /
    • 2017
  • Motion estimation occupies the largest computation in the video compression. Multiple processing elements are often exploited in parallel to meet processing speed. More processing elements increase processing speed, but they also increase hardware area. therefore, it is important to optimize the number of processing element. HEVC (high efficiency video coding) usually exploits multi-stage motion estimation algorithms for low computation and high performance. Since the number and position of search points are different in each stage, the utilization of the processing elements is not always 100% and the utilization is quite different with the number of processing elements. In this paper, the optimizing method is proposed on the number of processing elements. It finds out the optimal number of the processing elements for the given multi-stage motion estimation algorithm by calculating utilization and execution cycle of the processing elements.