• Title/Summary/Keyword: computing speed

Search Result 898, Processing Time 0.027 seconds

High-speed simulation for fossil power plants uisng a parallel DSP system (병렬 DSP 시스템을 이용한 화력발전소 고속 시뮬레이션)

  • 박희준;김병국
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.4
    • /
    • pp.38-49
    • /
    • 1998
  • A fossil power plant can be modeled by a lot of algebraic equations and differential equations. When we simulate a large, complicated fossil power plant by a computer such as workstation or PC, it takes much time until overall equations are completely calculated. Therefore, new processing systems which have high computing speed is ultimately needed for real-time or high-speed(faster than real-time) simulators. This paper presents an enhanced strategy in which high computing power can be provided by parallel processing of DSP processors with communication links. DSP system is designed for general purpose. Parallel DSP system can be easily expanded by just connecting new DSP modules to the system. General urpose DSP modules and a VME interface module was developed. New model and techniques for the task allocation are also presented which take into account the special characteristics of parallel I/O and computation. As a realistic cost function of task allocation, we suggested 'simulation period' which represents the period of simulation output intervals. Based on the development of parallel DSP system and realistic task allocation techniques, we cound achieve good efficiency of parallel processing and faster simulation speed than real-time.

  • PDF

An integrated structural health monitoring system for the Xijiang high-speed railway arch bridge

  • He, Xu-hui;Shi, Kang;Wu, Teng
    • Smart Structures and Systems
    • /
    • v.21 no.5
    • /
    • pp.611-621
    • /
    • 2018
  • Compared with the highway bridges, the relatively higher requirement on the safety and comfort of vehicle makes the high-speed railway (HSR) bridges need to present enhanced dynamic performance. To this end, installing a health monitor system (HMS) on selected key HSR bridges has been widely applied. Typically, the HSR takes fully enclosed operation model and its skylight time is very short, which means that it is not easy to operate the acquisition devices and download data on site. However, current HMS usually involves manual operations, which makes it inconvenient to be used for the HSR. Hence, a HMS named DASP-MTS (Data Acquisition and Signal Processing - Monitoring Test System) that integrates the internet, cloud computing (CC) and virtual instrument (VI) techniques, is developed in this study. DASP-MTS can realize data acquisition and transmission automatically. Furthermore, the acquired data can be timely shared with experts from various locations to deal with the unexpected events. The system works in a Browser/Server frame so that users at any places can obtain real-time data and assess the health situation without installing any software. The developed integrated HMS has been applied to the Xijiang high-speed railway arch bridge. Preliminary analysis results are presented to demonstrate the efficacy of the DASP-MTS as applied to the HSR bridges. This study will provide a reference to design the HMS for other similar bridges.

Performance Improvement of Computing Time of 2 Dimensional Finite Volume Model using MPI (MPI를 이용한 2차원 유한체적모형의 계산 성능 개선)

  • Kim, Tae Hyung;Han, Kun Yeun;Kim, Byung Hyun
    • Journal of Korea Water Resources Association
    • /
    • v.47 no.7
    • /
    • pp.599-614
    • /
    • 2014
  • In this study, two dimensional finite volume model was parallelized to improve computing time, which has been developed to be able to apply for the mixed meshes of triangle and quadrilateral. MPI scheme which is free from limitation of the number of cores was applied, and non-blocking point-to-point communication was used for fluxes and time steps calculation domain. The developed model is applied to analyze dam break in a L-shaped experimental channel with $90^{\circ}$ bend and Malpasset dam breach event to calibrate the consistency between parallelized model and existing model and examine the speed-up and efficiency of computing time. Computational speed-up about the size of the input data was considered by simulating 4 cases classified by the number of meshes, Consequently, the simulation results reached a satisfactory accuracy compared to measured data and the results from existing model, and achieved more than 3 times benefit of computational speed-up against computing time of existing model. Simulation results of 3 cases classified by the size of input data lead us to the conclusion that it is important to use proper size of input data and the number of process in order to minimize the communication overhead.

Performance Improvement of BLAST using Grid Computing and Implementation of Genome Sequence Analysis System (그리드 컴퓨팅을 이용한 BLAST 성능개선 및 유전체 서열분석 시스템 구현)

  • Kim, Dong-Wook;Choi, Han-Suk
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.7
    • /
    • pp.81-87
    • /
    • 2010
  • This paper proposes a G-BLAST(BLAST using Grid Computing) system, an integrated software package for BLAST searches operated in heterogeneous distributed environment. G-BLAST employed 'database splicing' method to improve the performance of BLAST searches using exists computing resources. G-BLAST is a basic local alignment search tool of DNA Sequence using grid computing in heterogeneous distributed environment. The G-BLAST improved the existing BLAST search performance in gene sequence analysis. Also G-BLAST implemented the pipeline and data management method for users to easily manage and analyze the BLAST search results. The proposed G-BLAST system has been confirmed the speed and efficiency of BLAST search performance in heterogeneous distributed computing.

Technical Trends of Computing Infrastructure for Agent Based Modeling & Simulation (에이전트 기반 모델링 및 시뮬레이션을 위한 컴퓨팅 인프라 기술 동향)

  • Jung, Y.W.;Son, S.;Oh, B.T.;Lee, G.C.;Bae, S.J.;Kim, B.S.;Kang, D.J.;Jung, Y.J.
    • Electronics and Telecommunications Trends
    • /
    • v.33 no.5
    • /
    • pp.111-120
    • /
    • 2018
  • Agent-based modeling and simulation (ABMS) is a computational method for analyzing research targets through observations of agent-to-agent interactions, and can be applied to multidimensional policy experiments in various fields of social sciences to support policy and decision making. Recently, according to increasing complexity of society and the rapid growth of collected data, the need for high-speed processing is considered to be more important in this field. For this reason, in the ABMS research field, a scalable and large-scale computing infrastructure is becoming an essential element, and cloud computing has been considered a promising infrastructure of ABMS. This paper surveys the technology trends of ABMS tools, cloud computing-based modeling, and simulation studies, and forecasts the use of cloud-computing infrastructure for future modeling and simulation tools. Although fundamental studies are underway to apply and operate cloud computing in the areas of modeling and simulation, new and additional studies are required to devise an optimal cloud computing infrastructure to satisfy the needs of large-scale ABMS.

Dynamic Resource Ranking and Grouping Algorithm for Grid Computing (그리드 컴퓨팅을 위한 동적 자원 랭킹 및 그룹핑 알고리즘)

  • Yi Jinsung;Park Kiejin;Choi Changyeol;Kim Sungsoo
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.4
    • /
    • pp.471-482
    • /
    • 2005
  • The high-speed network permits Grid computing to handle large problem of management areas and share various computational resources. As there are many resources and changes of them in Grid computing, the resources should be detected effectively and matched correctly with tasks to provide high performance. In this paper, we propose a mechanism that maximizes the performance of Grid computing systems. According to a priority, grade and site of heterogeneous resources, we assign tasks to those resources. Initially, a volunteer's priority and ranking are determined by static information like as CPU speed, RAM size, storage size and network bandwidth. And then, the rank of resources is decided by considering dynamic information such as correctness, response time, and error rate. We find that overall Grid system performance is improved and high correctness using resource reallocation mechanism is achieved.

Design and Implementation of Workflow-based User Environment on Computational Grid (계산 그리드에서 워크플로우 기반의 사용자 환경 설계 및 구현)

  • Hwang, Sun-Tae;Sim, Gyu-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.4 s.36
    • /
    • pp.165-171
    • /
    • 2005
  • High speed computer, large scale storage device and high speed computer network are computing infrastructure which we can easily access to in these days. However, many computer simulations in natural or applied science such as molecular simulation require more computing power as well as larger scale of storage. Grid computing which is a next generation of distributed computing environment, is one of solution for the new requirements. Even though many researches have been going on Grid computing, those are oriented to communication interface and protocols, and middleware like globus tool kits[2, 3]. Therefore research on application level platform or application itself is yet premature and it makes real users be difficult to utilize Grid system for their research. In this paper, we suggest a new user environment and an abstract job model for simulation experiments on MGrid(Molecular Simulation Grid). It will make users be able to utilize Grid resources efficiently and reliably.

  • PDF

High-Speed Self-Organzing Map for Document Clustering

  • Rojanavasu, Ponthap;Pinngern, Ouen
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.1056-1059
    • /
    • 2003
  • Self-Oranizing Map(SOM) is an unsupervised neural network providing cluster analysis of high dimensional input data. The output from the SOM is represented in map that help us to explore data. The weak point of conventional SOM is when the map is large, it take a long time to train the data. The computing time is known to be O(MN) for trainning to find the winning node (M,N are the number of nodes in width and height of the map). This paper presents a new method to reduce the computing time by creating new map. Each node in a new map is the centroid of nodes' group that are in the original map. After create a new map, we find the winning node of this map, then find the winning node in original map only in nodes that are represented by the winning node from the new map. This new method is called "High Speed Self-Oranizing Map"(HS-SOM). Our experiment use HS-SOM to cluster documents and compare with SOM. The results from the experiment shows that HS-SOM can reduce computing time by 30%-50% over conventional SOM.

  • PDF

Logic circuit design for high-speed computing of dynamic response in real-time hybrid simulation using FPGA-based system

  • Igarashi, Akira
    • Smart Structures and Systems
    • /
    • v.14 no.6
    • /
    • pp.1131-1150
    • /
    • 2014
  • One of the issues in extending the range of applicable problems of real-time hybrid simulation is the computation speed of the simulator when large-scale computational models with a large number of DOF are used. In this study, functionality of real-time dynamic simulation of MDOF systems is achieved by creating a logic circuit that performs the step-by-step numerical time integration of the equations of motion of the system. The designed logic circuit can be implemented to an FPGA-based system; FPGA (Field Programmable Gate Array) allows large-scale parallel computing by implementing a number of arithmetic operators within the device. The operator splitting method is used as the numerical time integration scheme. The logic circuit consists of blocks of circuits that perform numerical arithmetic operations that appear in the integration scheme, including addition and multiplication of floating-point numbers, registers to store the intermediate data, and data busses connecting these elements to transmit various information including the floating-point numerical data among them. Case study on several types of linear and nonlinear MDOF system models shows that use of resource sharing in logic synthesis is crucial for effective application of FPGA to real-time dynamic simulation of structural response with time step interval of 1 ms.

Group Mutual Exclusion Algorithm Using RMS in Community Computing Environments (커퓨니티 컴퓨팅 환경에서 자원 관리 서비스를 이용한 그룹 상호 배제 알고리즘)

  • Park, Chang-Woo;Kim, Ki-Young;Jung, Hye-Dong;Kim, Seok-Yoon
    • Proceedings of the IEEK Conference
    • /
    • 2009.05a
    • /
    • pp.281-283
    • /
    • 2009
  • Forming Community is important to manage and provide the service in Ubiquitous Environments including embedded tiny computers. Community Computing is that members constitute the community and cooperate. A mutual exclusion problem occurs when many processors try to use one resource and race condition happens. In the expanded concept, a group mutual exclusion problem is that processors in the same group can share the resource but processors in different groups cannot share. As mutual exclusion problems might be in community computing environments, we propose algorithm which improves the execution speed using RMS (resource management service). In this paper describes proposed algorithm and proves its performance by experiments, comparing proposed algorithm with previous method using quorum-based algorithm.

  • PDF