• Title, Summary, Keyword: Parallel Computing

Search Result 692, Processing Time 0.04 seconds

Development of Virtual Parallel Processing System for Flexible Task Allocation on the Web (웹 환경에서 유연성 있는 작업 할당을 위한 가상 병렬 처리 시스템 개발)

  • 정권호;송은하;정영식
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.3
    • /
    • pp.320-332
    • /
    • 2000
  • Web consists of the grand virtual system which is made of all connected computers network. We can solve the huge problem which requires high quality in cost performance and powerful computing power to use a numerous idle state system on internet as process it parallel. However, we have to consider heterogeneous computing resources, accessibility, and reliability to carry out parallel system on global environment, not network but whole Internet. In this paper, We the WebImg system which has the power of web computing, and show the flexible task allocation strategy in heterogeneous hosts. Also, we evaluate its performance, moreover the proposed task allocation strategy supplies fault tolerance by controlling host situation at any time.

  • PDF

Developing a Bioinformatics Tool for Peptide Nucleic Acid (PNA) antisense Technique Utilizing Parallel Computing System (Peptide Nucleic Acid(PNA)를 이용한 antisense 기법에 적용할 병렬 컴퓨팅용 Bioinformatics tool 개발)

  • Kim Seong-Jo;Jeon Ho-Sang;Hong Seung-Pyo;Kim Hyon-Chang;Kim Han-Jip;Min Churl-K
    • Proceedings of the Korean Information Science Society Conference
    • /
    • /
    • pp.43-45
    • /
    • 2006
  • Unlike RNA interference, whose usage is limited to eukaryotic cells, Peptide Nucleic Acid (PNA) technique is applicable to both eukaryotic and prokaryotic cells. PNA has been proven to be an effective agent for blocking gene expressions and has several advantages over other antisense techniques. Here we developed a parallel computing software that provides the ideal sequences to design PNA oligos to prevent any off-target effects. We applied a new approach in our location-finding algorithm that finds a target gene from the whole genome sequence. Message Passing Interface (MPI) was used to perform parallel computing in order to reduce the calculation time. The software will help biologists design more accurate and effective antisense PNA by minimizing the chance of off-target effects.

  • PDF

Design and Analysis of User's Libraries for Parallel Computing based on the Internet (인터넷 기반의 병렬 컴퓨팅을 위한 사용자 라이브러리 설계 및 성능 분석)

  • Sin, Pil-Seop;Jeong, Jun-Mok;Maeng, Hye-Seon;Hong, Won-Gi;Kim, Sin-Deok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.11
    • /
    • pp.2932-2945
    • /
    • 1999
  • As the Internet and Java technology have been growing up, parallel processing approach to utilize those idle resources connected to the Internet has become quite attractive. In this paper, JICE(Java Internet Computing Environment) was implemented as a parallel computing platform based on the Internet using multithreading and RMI mechanisms provided by Java. The basic model of JICE is constructed as three components, such as a client, a set of workers, and a broker. A worker communicates with other workers via a globally shared memory system. It provides users with master-slave programming model and a collection of library functions. The basic model of JICE is also extended as a multimanaging system. This multimanaging system is evaluated by analysis to show its effectiveness. According to numerical analysis and experiments with several benchmarks, it is shown that the performance of basic model depends on the shared memory reference ratio and user's library is a quite promising.

  • PDF

The Parallel ANN(Artificial Neural Network) Simulator using Mobile Agent (이동 에이전트를 이용한 병렬 인공신경망 시뮬레이터)

  • Cho, Yong-Man;Kang, Tae-Won
    • The KIPS Transactions:PartB
    • /
    • v.13B no.6
    • /
    • pp.615-624
    • /
    • 2006
  • The objective of this paper is to implement parallel multi-layer ANN(Artificial Neural Network) simulator based on the mobile agent system which is executed in parallel in the virtual parallel distributed computing environment. The Multi-Layer Neural Network is classified by training session, training data layer, node, md weight in the parallelization-level. In this study, We have developed and evaluated the simulator with which it is feasible to parallel the ANN in the training session and training data parallelization because these have relatively few network traffic. In this results, we have verified that the performance of parallelization is high about 3.3 times in the training session and training data. The great significance of this paper is that the performance of ANN's execution on virtual parallel computer is similar to that of ANN's execution on existing super-computer. Therefore, we think that the virtual parallel computer can be considerably helpful in developing the neural network because it decreases the training time which needs extra-time.

A Distributed Electrical Impedance Tomography Algorithm for Real-Time Image Reconstruction (실시간 영상 복원을 위한 분산 전기단층촬영 알고리즘)

  • Junghoon Lee;Gyunglin Park
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.1
    • /
    • pp.25-36
    • /
    • 2004
  • This paper proposes and measures the performance of a distributed EIT (Electrical Impedance Tomography) image reconstruction algorithm which has a master-slave structure. The image construction is a computation based application of which the execute time is proportional to the cube of the unknowns. After receiving a specific frame from the master, each computing node extracts the basic elements by executing the first iteration of Kalman Filter in parallel. Then the master merges the basic element lists into one group and then performs the sequential iterations with the reduced number of unknowns. Every computing node has MATLAB functions as well as extended library implemented for the exchange of MATLAB data structure. The master implements another libraries such as threaded multiplication, partitioned inverse, and fast Jacobian to improve the speed of the serial execution part. The parallel library reduces the reconstruction time of image visualization about by half, while the distributed grouping scheme further reduces by about 12 times for the given target object when there are 4 computing nodes.

Research of accelerating method of video quality measurement program using GPGPU (GPGPU를 이용한 영상 품질 측정 프로그램의 가속화 연구)

  • Lee, Seonguk;Byeon, Gibeom;Kim, Kisu;Hong, Jiman
    • Smart Media Journal
    • /
    • v.5 no.4
    • /
    • pp.69-74
    • /
    • 2016
  • Recently, parallel computing using GPGPU(General-Purpose computing on Graphics Processing Units) according to the development of the graphics processing unit is expanding. This can be achieved through the processing speeds faster than traditional computing environments across many fields, including science, medicine, engineering, and analysis. However, in using the GPU technology to implement the a parallel program there are many constraints. In this paper, we port a CPU-based program(Video Quality Measurement Program) to use technology. The program ported to GPU-based show about 1.83 times the execution speed than CPU-based program. We study on the acceleration of the GPU-based program. Also we discuss the technical constraints and problems that occur when you modify the CPU to the GPU-based programs.

Interprocedural Transformations for Parallel Computing

  • Park, Doo-Soon;Choi, Min-Hyung
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.12
    • /
    • pp.1700-1708
    • /
    • 2006
  • Since the most program execution time is consumed in a loop structure, extracting parallelism from loop programs is critical for the taster program execution. In this paper, we proposed data dependency removal method for a single loop. The data dependency removal method can be applied to uniform and non-uniform data dependency distance in the single loop. Procedure calls parallelisms with only a single loop structure or procedure call most of other methods are concerned with the uniform code within the uniform data dependency distance. We also propose an algorithm, which can be applied to uniform, non-uniform, and complex data dependency distance among the multiple procedures. We compared our method with conventional methods using CRAY-T3E for the performance evaluation. The results show that the proposed algorithm is effective.

  • PDF

An Active Enactment Architecture for Enterprise Workflow Grid (액티브 엔터프라이즈 워크플로우 그리드 아키텍처)

  • Paik, Su-Ki
    • Journal of Information Technology Services
    • /
    • v.7 no.4
    • /
    • pp.167-178
    • /
    • 2008
  • This paper addresses the issue of workflow on Grid and P2P, and proposes a layered workflow architecture and its related workflow models that are used for not only distributing workflows' information onto Grid or P2P resources but also scheduling the enactment of workflows. Especially, the most critical rationale of this paper is on the fact that the nature of Grid computing environment is fitted very well into building a platform for the maximally parallel and very large scale workflows that are frequently found in very large scale enterprises. The layered architecture proposed in this paper, which we call Enterprise Workflow Grid Architecture, is targeting on maximizing the usability of computing facilities in the enterprise as well as the scalability of its underlined workflow management system in coping with massively parallel and very large scale workflow applications.

Application of Supercomputers(Cluster computers) to Railway Industry - Fire-Driven flow Simulation using Parallel Computational Method - (슈퍼컴퓨터(클러스터 컴퓨터)의 철도산업에서의 활용 - 병렬처리기법을 이용한 화재유동해석 -)

  • Kim, Hag-Beom;Jang, Yong-Jun;Lee, Chang-Hyun;Jung, Woo-Sung
    • Proceedings of the KSR Conference
    • /
    • /
    • pp.1040-1046
    • /
    • 2009
  • Thanks to the recent development of computing technology, the various forms of high-performance computers are available. Among them, the parallel-clustering CPU machines are realized for the high performance computing. These supercomputers (cluster computers) can be applied to various industries due to the advantages of lower price. Especially in the field of numerical flow simulation, use of supercomputers can produce results quickly, and various engineering problems can be reviewed effectively case by case. In this paper, an application of supercomputers (cluster computers) were examined for railroad industry of fire flow simulation by using parallel computational method. It make sure that the supercomputers are very useful tools for railroad engineering.

  • PDF

Application of computational technologies to R/C structural analysis

  • Hara, Takashi
    • Computers and Concrete
    • /
    • v.8 no.1
    • /
    • pp.97-110
    • /
    • 2011
  • In this paper, FEM procedure is applied to the static and dynamic analyses of R/C structures. Simple R/C shell structure is solved by using FEM procedures and the experimental evaluations are performed to represent the applicability of FEM procedure to R/C structures. Also, R/C columns are analyzed numerically and experimentally. On the basis of these results, FEM procedures are applied to the R/C cooling tower structures assembled by huge R/C shell structure and a lot of discrete R/C columns. In this analysis, the parallel computing procedures are introduced into these analyses to reduce the computational effort. The dynamic performances of R/C cooling tower are also solved by the application of parallel computations as well. From the numerical analyses, the conventional FEM procedures combined with computational technologies enables us to design the huge R/C structures statically and dynamically.