• Title/Summary/Keyword: Parallel data processing

Search Result 751, Processing Time 0.027 seconds

Development of Monitoring System for Biotelemetry Diagnosis of Multichannel ECG Data (다중채널 심전도 데이터의 원격진단을 위한 모니터링 시스템의 개발)

  • Jang, Won-Yeong;Jang, Won-Seok;Hong, Seung-Hong
    • Journal of Biomedical Engineering Research
    • /
    • v.12 no.2
    • /
    • pp.113-120
    • /
    • 1991
  • This paper describes the implementation of a 3 channel ECG monitoring system. This system consists of an IBM-PC and simple accessory only. A PDTS (parallel data transmission system ) was designed to do monitor the data being operated with no effect and no exchange of software and hardware on the main transmission system in LOCAL mode. And it receives patient's ECG data from EPTS ( ECG processing and transmission system) of distant region. It provides on-line ECG waveform display, waveform storage, recall and editing the waveform. We have implemented the monitoring system by tw methods, and with system, we could directly monitor the EPTS and also receive the data from the remote ㅁe잉ion. This system was tested by experiments and examined its practical use.

  • PDF

A Design of the Preprocess Module for the Distributed Process of the ECG signals (ECG 신호의 분산처리를 위한 Preprocess Module에 관한 연구)

  • Song, H.B.;Lee, K.J.;Yoon, H.R.;Lee, M.H.
    • Proceedings of the KIEE Conference
    • /
    • 1987.07b
    • /
    • pp.1338-1340
    • /
    • 1987
  • This paper describes the design of ECG data preprocess module for the ECG signals. This module process the data obtained from two channels. It is composed of the AID converter, QRS detector, one chip micro-computer and memory. This module performs the following functions;digital filtering, R wave detection and determination of reference point for the ST segment. The measured points are transfered to the next data module by the interrupt process. This preprocessor data module is available to the basis for the parallel data processing for the real time automatic diagnosis.

  • PDF

BoxBroker: A Policy-Driven Framework for Optimizing Storage Service Federation

  • Heinsen, Rene;Lopez, Cindy;Huh, Eui-Nam
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.1
    • /
    • pp.340-367
    • /
    • 2018
  • Storage services integration can be done for achieving high availability, improving data access performance and scalability while preventing vendor lock-in. However, multiple services environment management and interoperability have become a critical issue as a result of service architectures and communication interfaces heterogeneity. Storage federation model provides the integration of multiple heterogeneous and self-sufficient storage systems with a single control point and automated decision making about data distribution. In order to integrate diverse heterogeneous storage services into a single storage pool, we are proposing a storage service federation framework named BoxBroker. Moreover, an automated decision model based on a policy-driven data distribution algorithm and a service evaluation method is proposed enabling BoxBroker to make optimal decisions. Finally, a demonstration of our proposal capabilities is presented and discussed.

Fast Data Assimilation using Kernel Tridiagonal Sparse Matrix for Performance Improvement of Air Quality Forecasting (대기질 예보의 성능 향상을 위한 커널 삼중대각 희소행렬을 이용한 고속 자료동화)

  • Bae, Hyo Sik;Yu, Suk Hyun;Kwon, Hee Yong
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.2
    • /
    • pp.363-370
    • /
    • 2017
  • Data assimilation is an initializing method for air quality forecasting such as PM10. It is very important to enhance the forecasting accuracy. Optimal interpolation is one of the data assimilation techniques. It is very effective and widely used in air quality forecasting fields. The technique, however, requires too much memory space and long execution time. It makes the PM10 air quality forecasting difficult in real time. We propose a fast optimal interpolation data assimilation method for PM10 air quality forecasting using a new kernel tridiagonal sparse matrix and CUDA massively parallel processing architecture. Experimental results show the proposed method is 5~56 times faster than conventional ones.

Development of PCM Data Recorder for Telemetry System (원격측정용 PCM 데이터 저장장치 개발)

  • Koh, Kwang-Ryul;Lee, Sang-Bum;Lee, Hyun-Kyu;Kim, Whan-Woo
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.14 no.4
    • /
    • pp.607-614
    • /
    • 2011
  • This paper describes the development of pulse code modulation(PCM) data recorder with design, implementation and environmental test. PCM serial data that diverged from telemetry encoder output is used as the input and is reformed to parallel signal through FPGA processing. Controllers construct the packet by the sector and record it into non-volatile memory. Compact flash(CF) memory for data storage media, USB interface for data downloading, and a software for operating status diagnosis and file format conversion are used.

Scalable Prediction Models for Airbnb Listing in Spark Big Data Cluster using GPU-accelerated RAPIDS

  • Muralidharan, Samyuktha;Yadav, Savita;Huh, Jungwoo;Lee, Sanghoon;Woo, Jongwook
    • Journal of information and communication convergence engineering
    • /
    • v.20 no.2
    • /
    • pp.96-102
    • /
    • 2022
  • We aim to build predictive models for Airbnb's prices using a GPU-accelerated RAPIDS in a big data cluster. The Airbnb Listings datasets are used for the predictive analysis. Several machine-learning algorithms have been adopted to build models that predict the price of Airbnb listings. We compare the results of traditional and big data approaches to machine learning for price prediction and discuss the performance of the models. We built big data models using Databricks Spark Cluster, a distributed parallel computing system. Furthermore, we implemented models using multiple GPUs using RAPIDS in the spark cluster. The model was developed using the XGBoost algorithm, whereas other models were developed using traditional central processing unit (CPU)-based algorithms. This study compared all models in terms of accuracy metrics and computing time. We observed that the XGBoost model with RAPIDS using GPUs had the highest accuracy and computing time.

Large-scale 3D fast Fourier transform computation on a GPU

  • Jaehong Lee;Duksu Kim
    • ETRI Journal
    • /
    • v.45 no.6
    • /
    • pp.1035-1045
    • /
    • 2023
  • We propose a novel graphics processing unit (GPU) algorithm that can handle a large-scale 3D fast Fourier transform (i.e., 3D-FFT) problem whose data size is larger than the GPU's memory. A 1D FFT-based 3D-FFT computational approach is used to solve the limited device memory issue. Moreover, to reduce the communication overhead between the CPU and GPU, we propose a 3D data-transposition method that converts the target 1D vector into a contiguous memory layout and improves data transfer efficiency. The transposed data are communicated between the host and device memories efficiently through the pinned buffer and multiple streams. We apply our method to various large-scale benchmarks and compare its performance with the state-of-the-art multicore CPU FFT library (i.e., fastest Fourier transform in the West [FFTW]) and a prior GPU-based 3D-FFT algorithm. Our method achieves a higher performance (up to 2.89 times) than FFTW; it yields more performance gaps as the data size increases. The performance of the prior GPU algorithm decreases considerably in massive-scale problems, whereas our method's performance is stable.

Developing a Simulator of the Capture Process in Towed Fishing Gears by Chaotic Fish Behavior Model and Parallel Computing

  • Kim Yong-Hae;Ha Seok-Wun;Jun Yong-Kee
    • Fisheries and Aquatic Sciences
    • /
    • v.7 no.3
    • /
    • pp.163-170
    • /
    • 2004
  • A fishing simulator for towed fishing gear was investigated in order to mimic the fish behavior in capture process and investigate fishing selectivity. A fish behavior model using a psycho-hydraulic wheel activated by stimuli is established to introduce Lorenz chaos equations and a neural network system and to generate the components of realistic fish capture processes. The fish positions within the specified gear geometry are calculated from normalized intensities of the stimuli of the fishing gear components or neighboring fish and then these are related to the sensitivities and the abilities of the fish. This study is applied to four different towed gears i.e. a bottom trawl, a midwater trawl, a two-boat seine, and an anchovy boat seine and for 17 fish species as mainly caught. The Alpha cluster computer system and Fortran MPI (Message-Passing Interface) parallel programming were used for rapid calculation and mass data processing in this chaotic behavior model. The results of the simulation can be represented as animation of fish movements in relation to fishing gear using Open-GL and C graphic programming and catch data as well as selectivity analysis. The results of this simulator mimicked closely the field studies of the same gears and can therefore be used in further study of fishing gear design, predicting selectivity and indoor training systems.

High-Performance Variable-Length Reed-Solomon Decoder Architecture for Gigabit WPAN Applications (기가비트 WPAN용 고성능 가변길이 리드-솔로몬 복호기 구조)

  • Choi, Chang-Seok;Lee, Han-Ho
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.49 no.1
    • /
    • pp.25-34
    • /
    • 2012
  • This paper presents a universal architecture for variable-length eight-parallel Reed-Solomon (RS) decoder for high-rate WPAN systems. The proposed architecture can support not only RS(255,239) code but various shortened RS codes. Moreover, variable-length architecture provides variable low latency for various shortened RS codes and the eight-parallel design also provides high data processing rate. Using 90-$nm$ CMOS standard cell technology, the proposed RS decoder has been synthesized and measured for performance. The proposed RS decoder can provide a maximum 19-$Gbps$ data rate at clock frequency 300 $MHz$.

Design of a systolic array for forward-backward propagation of back-propagation algorithm (역전파 알고리즘의 전방향, 역방향 동시 수행을 위한 스스톨릭 배열의 설계)

  • 장명숙;유기영
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.9
    • /
    • pp.49-61
    • /
    • 1996
  • Back-propagation(BP) algorithm needs a lot of time to train the artificial neural network (ANN) to get high accuracy level in classification tasks. So there have been extensive researches to process back-propagation algorithm on parallel processors. This paper prsents a linear systolic array which calculates forward-backward propagation of BP algorithm at the same time using effective space-time transformation and PE structure. First, we analyze data flow of forwared and backward propagations and then, represent the BP algorithm into data dapendency graph (DG) which shows parallelism inherent in the BP algorithm. Next, apply space-time transformation on the DG of ANN is turn with orthogonal direction projection. By doing so, we can get a snakelike systolic array. Also we calculate the interval of input for parallel processing, calculate the indices to make the right datas be used at the right PE when forward and bvackward propagations are processed in the same PE. And then verify the correctness of output when forward and backward propagations are executed at the same time. By doing so, the proposed system maximizes parallelism of BP algorithm, minimizes th enumber of PEs. And it reduces the execution time by 2 times through making idle PEs participate in forward-backward propagation at the same time.

  • PDF