• Title/Summary/Keyword: Parallel programming model

Search Result 87, Processing Time 0.033 seconds

A Study on Dynamic Vibration Absorber Using Zener's Model (Zener 모델을 사용한 동흡진기 특성 연구)

  • Oh, Il-Kwon;Lim, Seung-Hyun
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2005.11a
    • /
    • pp.159-163
    • /
    • 2005
  • A dynamic vibration absorber using the Zener's model has been taken into account with respect to frequency response characteristics. The concept of the tuned mass damper with a single degree of freedom has been well applied for many industrial fields, because many researchers have extensively studied various basic characteristics, performance and optimization methods for long time. The Zener's model has an additional spring, which is connected between a damper and a mass, while the tuned mass damper with a single degree of freedom consists of a mass, a spring and a damper connected in parallel. In previous works, the basic performance and characteristics of the Zoner's model as a dynamic vibration absorber have not been investigated. In this study, the frequency response characteristics according to the parameter change of the Zener's model have been described. In order to find the optimum value of several parameters, we use iterative scheme with three dimensional frequency response diagram by MATLAB programming. Present results shows the Zener's model can give more good damping performance than the simple tuned mass damper, and the numerical of optimization method should be developed for the efficient vibration absorbtion.

  • PDF

Optimal Disassembly Sequencing with Sequence-Dependent Operation Times Based on the Directed Graph of Assembly States (작업시간이 순서 의존적인 경우 조립상태를 나타내는 유방향그래프를 이용한 최적 제품 분해순서 결정)

  • Kang, Jun-Gyu;Lee, Dong-Ho;Xirouchakis, Paul;Lambert, A.J.D.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.28 no.3
    • /
    • pp.264-273
    • /
    • 2002
  • This paper focuses on disassembly sequencing, which is the problem of determining the optimum disassembly level and the corresponding disassembly sequence for a product at its end-of-life with the objective of maximizing the overall profit. In particular, sequence-dependent operation times, which frequently occur in practice due to tool-changeover, part reorientation, etc, are considered in the parallel disassembly environment. To represent the problem, a modified directed graph of assembly states is suggested as an extension of the existing extended process graph. Based on the directed graph, the problem is transformed into the shortest path problem and formulated as a linear programming model that can be solved straightforwardly with standard techniques. A case study on a photocopier was done and the results are reported.

A Communication and Computation Overlapping Model through Loop Sub-partitioning and Dynamic Scheduling in Data Parallel Programs (데이타 병렬 프로그램에서 루프 세부 분할 및 동적 스케쥴링을 통한 통신과 계산의 중첩 모델)

  • Kim, Jung-Hwan;Han, Sang-Yong;Cho, Seung-Ho;Kim, Heung-Hwan
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.1
    • /
    • pp.23-33
    • /
    • 2000
  • We propose a model which overlaps communication with computation for efficient communication in the data-parallel programming paradigm. The overlapping model divides a given loop partition into several sub-partitions to obtain computation which can be overlapped with communication. A loop partition sometimes refers to other data partitions, but not all iterations in the loop partition require non-local data. So, a loop partition may be divided into a set of loop iterations which require non-local data, and a set of loop iterations which do not. Each loop sub-partition is dynamically scheduled depending on associated message arrival, The experimental results for a few benchmarks in IBM SP2 show enhanced performance in our overlapping model.

  • PDF

Research on Big Data Integration Method

  • Kim, Jee-Hyun;Cho, Young-Im
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.1
    • /
    • pp.49-56
    • /
    • 2017
  • In this paper we propose the approach for big data integration so as to analyze, visualize and predict the future of the trend of the market, and that is to get the integration data model using the R language which is the future of the statistics and the Hadoop which is a parallel processing for the data. As four approaching methods using R and Hadoop, ff package in R, R and Streaming as Hadoop utility, and Rhipe and RHadoop as R and Hadoop interface packages are used, and the strength and weakness of four methods are described and analyzed, so Rhipe and RHadoop are proposed as a complete set of data integration model. The integration of R, which is popular for processing statistical algorithm and Hadoop contains Distributed File System and resource management platform and can implement the MapReduce programming model gives us a new environment where in R code can be written and deployed in Hadoop without any data movement. This model allows us to predictive analysis with high performance and deep understand over the big data.

An Artificial Neural Network for the Optimal Path Planning (최적경로탐색문제를 위한 인공신경회로망)

  • Kim, Wook;Park, Young-Moon
    • Proceedings of the KIEE Conference
    • /
    • 1991.07a
    • /
    • pp.333-336
    • /
    • 1991
  • In this paper, Hopfield & Tank model-like artificial neural network structure is proposed, which can be used for the optimal path planning problems such as the unit commitment problems or the maintenance scheduling problems which have been solved by the dynamic programming method or the branch and bound method. To construct the structure of the neural network, an energy function is defined, of which the global minimum means the optimal path of the problem. To avoid falling into one of the local minima during the optimization process, the simulated annealing method is applied via making the slope of the sigmoid transfer functions steeper gradually while the process progresses. As a result, computer(IBM 386-AT 34MHz) simulations can finish the optimal unit commitment problem with 10 power units and 24 hour periods (1 hour factor) in 5 minites. Furthermore, if the full parallel neural network hardware is contructed, the optimization time will be reduced remarkably.

  • PDF

A New Dispatch Scheduling Algorithm Applicable to Interconnected Regional Systems with Distributed Inter-temporal Optimal Power Flow (분산처리 최적조류계산 기반 연계계통 급전계획 알고리즘 개발)

  • Chung, Koo-Hyung;Kang, Dong-Joo;Kim, Bal-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.10
    • /
    • pp.1721-1730
    • /
    • 2007
  • SThis paper proposes a new dispatch scheduling algorithm in interconnected regional system operations. The dispatch scheduling formulated as mixed integer non-linear programming (MINLP) problem can efficiently be computed by generalized Benders decomposition (GBD) algorithm. GBD guarantees adequate computation speed and solution convergency since it decomposes a primal problem into a master problem and subproblems for simplicity. In addition, the inter-temporal optimal power flow (OPF) subproblem of the dispatch scheduling problem is comprised of various variables and constraints considering time-continuity and it makes the inter-temporal OPF complex due to increased dimensions of the optimization problem. In this paper, regional decomposition technique based on auxiliary problem principle (APP) algorithm is introduced to obtain efficient inter-temporal OPF solution through the parallel implementation. In addition, it can find the most economic dispatch schedule incorporating power transaction without private information open. Therefore, it can be expanded as an efficient dispatch scheduling model for interconnected system operation.

Model Coupling Technique for Level Access in Hierarchical Simulation Models and Its Applications (계층의 구조를 갖는 시뮬레이션 모델에 있어서 단계적 접근을 위한 모델연결 방법론과 그 적용 예)

  • 조대호
    • Journal of the Korea Society for Simulation
    • /
    • v.5 no.2
    • /
    • pp.25-40
    • /
    • 1996
  • Modeling of systems for intensive knowledge-based processing requires a modeling methodology that makes efficient access to the information in huge data base models. The proposed level access mothodology is a modeling approach applicable to systems where data is stored in a hierarchical and modular modules of active memory cells(processor/memory pairs). It significantly reduces the effort required to create discrete event simulation models constructed in hierarchical, modular fashion for above application. Level access mothodology achieves parallel access to models within the modular, hierarchical modules(clusters) by broadcasting the desired operations(e.g. querying information, storing data and so on) to all the cells below a certain desired hierarchical level. Level access methodology exploits the capabilities of object-oriented programming to provide a flexible communication paradigm that combines port-to-port coupling with name-directed massaging. Several examples are given to illustrate the utility of the methodology.

  • PDF

Parallel Programming Model for Manycore (매니코어 병렬프로그래밍 모델)

  • Kim, J.M.;Byun, S.W.;Kim, K.H.;Koh, K.W.;Cha, S.J.;Jeong, Y.J.;Jung, S.I.
    • Electronics and Telecommunications Trends
    • /
    • v.30 no.4
    • /
    • pp.36-45
    • /
    • 2015
  • 매니코어는 단순한 기능을 가진 수백~수천 개 코어를 하나의 CPU에 집적하여 성능을 구현하는 것으로 근본적으로 이를 활용할 병렬프로그래밍이 필요하다. 단순히 속도를 높이는 방향으로 발전하던 하드웨어는 병렬성을 증대하는 방향으로 발전하고 있고 이에 따라 프로그래밍 패러다임 역시 변하고 있다. 병렬화를 위한 여러 기술이 하드웨어에 구현되고 프로그래머가 이를 보다 적극적으로 활용할 수 있게 하는 유용한 병렬프로그래밍 모델이 필요하다. 또한, 컴퓨팅 환경은 자원의 활용도를 중시하는 시스템 중심에서 응용 및 서비스 중심으로 변화하고 있으므로, 그 도메인에 적합하게 프로그래밍할 수 있는 환경이 요구된다. 매니코어에서 병렬시스템 구조를 활용하는 방법을 결정하는 병렬프로그래밍 모델은 그 목적에 유연하게 제공되고 또한 컴퓨팅 환경 변화에 따라 새로운 개념의 모델을 정립하는 데 있어 유용해야 한다.

  • PDF

VotingRank: A Case Study of e-Commerce Recommender Application Using MapReduce

  • Ren, Jian-Ji;Lee, Jae-Kee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.04a
    • /
    • pp.834-837
    • /
    • 2009
  • There is a growing need for ad-hoc analysis of extremely large data sets, especially at e-Commerce companies which depend on recommender application. Nowadays, as the number of e-Commerce web pages grow to a tremendous proportion; vertical recommender services can help customers to find what they need. Recommender application is one of the reasons for e-Commerce success in today's world. Compared with general e-Commerce recommender application, obviously, general e-Commerce recommender application's processing scope is greatly narrowed down. MapReduce is emerging as an important programming model for large-scale data-parallel applications such as web indexing, data mining, and scientific simulation. The objective of this paper is to explore MapReduce framework for the e-Commerce recommender application on major general and dedicated link analysis for e-Commerce recommender application, and thus the responding time has been decreased and the recommender application's accuracy has been improved.

Fundamental Function Design of Real-Time Unmanned Monitoring System Applying YOLOv5s on NVIDIA TX2TM AI Edge Computing Platform

  • LEE, SI HYUN
    • International journal of advanced smart convergence
    • /
    • v.11 no.2
    • /
    • pp.22-29
    • /
    • 2022
  • In this paper, for the purpose of designing an real-time unmanned monitoring system, the YOLOv5s (small) object detection model was applied on the NVIDIA TX2TM AI (Artificial Intelligence) edge computing platform in order to design the fundamental function of an unmanned monitoring system that can detect objects in real time. YOLOv5s was applied to the our real-time unmanned monitoring system based on the performance evaluation of object detection algorithms (for example, R-CNN, SSD, RetinaNet, and YOLOv5). In addition, the performance of the four YOLOv5 models (small, medium, large, and xlarge) was compared and evaluated. Furthermore, based on these results, the YOLOv5s model suitable for the design purpose of this paper was ported to the NVIDIA TX2TM AI edge computing system and it was confirmed that it operates normally. The real-time unmanned monitoring system designed as a result of the research can be applied to various application fields such as an security or monitoring system. Future research is to apply NMS (Non-Maximum Suppression) modification, model reconstruction, and parallel processing programming techniques using CUDA (Compute Unified Device Architecture) for the improvement of object detection speed and performance.