• Title/Summary/Keyword: Distributed Memory System

Search Result 211, Processing Time 0.025 seconds

A Communication Method Between Distributed Control System and Function Test Facility Using TCP/IP and Shared Memory

  • Kim, Jung-Soo;Jung, Chul-Hwan;Kim, Jung-Taek;Lee, Dong-Young;Ham, Chang-Sik
    • Nuclear Engineering and Technology
    • /
    • v.30 no.4
    • /
    • pp.298-307
    • /
    • 1998
  • In order to design mutual communication between a distributed control system and a function test facility, we used the Inter-Process Communication(IPC) in two systems and Transmission Control Protocol/Internet Protocol(TCP/IP) protocol. The data from the function test facility are put in the shared memory using an IPC, which is then accessed by the distributed control system through an Application Program Interface(API). The server in the function test facility includes two processes(one for sending and one for receiving), which are generated by the fork function from the client signal. The client in the distributed control system includes two separate programs(one for receiving and one for sending).

  • PDF

Compound Backup Technique using Hot-Cold Data Classification in the Distributed Memory System (분산메모리시스템에서의 핫콜드 데이터 분류를 이용한 복합 백업 기법)

  • Kim, Woo Chur;Min, Dong Hee;Hong, Ji Man
    • Smart Media Journal
    • /
    • v.4 no.3
    • /
    • pp.16-23
    • /
    • 2015
  • As the IT technology advances, data processing system is required to handle and process large amounts of data. However, the existing On-Disk system has limit to process data which increase rapidly. For that reason, the In-Memory system is being used which saves and manages data on the fast memory not saving data into hard disk. Although it has fast processing capability, it is necessary to use the fault tolerance techniques in the In-Memory system because it has a risk of data loss due to volatility which is one of the memory characteristics. These fault tolerance techniques lead to performance degradation of In-Memory system. In this paper, we classify the data into Hot and Cold data in consideration of the data usage characteristics in the In-Memory system and propose compound backup technique to ensure data persistence. The proposed technique increases the persistence and improves performance degradation.

Distributed Shared Memory Scheme for Multi-thread programming (다중쓰레드 프로그래밍을 위한 분산공유메모리 관리 기법)

  • Seo, Dae-Wha
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.4
    • /
    • pp.791-802
    • /
    • 1996
  • In this paper, we discuss a distributed shared memory management scheme based on multi-threaded programming model for a large-scale loosely coupled multiprocessor system. The scheme covers three major issues in the distribued shared memory;the address translation table management, the block coherence maintenance, and the block placement policy. The scheme efficiently resolves the general problems occurred in the distributed shared memory such as a false sharing, an unnecessary replication, a block bouncing, and an address aliasing phenomenon. It also provides the application transparency, good scalability, easy implementation, and multithreaded programming model to users.

  • PDF

Parallel Topology Optimization on Distributed Memory System (분산 메모리 시스템에서의 병렬 위상 최적설계)

  • Lee Ki-Myung;Cho Seon-Ho
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2006.04a
    • /
    • pp.291-298
    • /
    • 2006
  • A parallelized topology design optimization method is developed on a distributed memory system. The parallelization is based on a domain decomposition method and a boundary communication scheme. For the finite element analysis of structural responses and design sensitivities, the PCG method based on a Krylov iterative scheme is employed. Also a parallelized optimization method of optimality criteria is used to solve large-scale topology optimization problems. Through several numerical examples, the developed method shows efficient and acceptable topology optimization results for the large-scale problems.

  • PDF

An Asynchronous Algorithm for Balancing Unpredictable Workload on Distributed-Memory Machines

  • Chung, Yong-Hwa;Park, Jin-Won;Yoon, Suk-Han
    • ETRI Journal
    • /
    • v.20 no.4
    • /
    • pp.346-360
    • /
    • 1998
  • It is challenging to parallelize problems with irregular computation and communication. In this paper, we propose an asynchronous algorithm for balancing unpredictable workload on distributed-memory machines. By using an initial workload estimate, we first partition the computations such that the workload is distributed evenly across the processors. In addition, we perform task migrations dynamically for adapting to the evolving workload. To demonstrate the usefulness of our load balancing strategy, we conducted experiments on an IBM SP2 and a Cray T3D. Experimental results show that our task migration strategy can balance unpredictable workload with little overhead. Our code using C and MPI is portable onto other distributed-memory machines.

  • PDF

A Study on a Conceptual Model for Distributed Problem Solving (분산 문제 해결을 위한 개념적 모델에 관한 연구)

  • Kim, Eun-Gyeong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.1
    • /
    • pp.107-117
    • /
    • 1996
  • This paper proposes a conceptual model for distributed problem solving(DPS), where cooperation and communication among agents are based on virtual shared memory (VSM) In this model, all agents in a DPS system view all the memory in a distributed computer system as a single shared memory in which data, tasks, and results can in a distributed computer system as a single shared memory, in which data, tasks, and results can / be accessed by any of the agents. Several agents cooperatively solve a complex problem, as agents write data, intermediate results of execution, and tasks requested to other agents to VSM and other agents read or execute them. Also, in order to develop DPS systems based on the proposed conceptual model, this paper designs a DPS system development environment(DPS-VSM)using Network Linda. Thi spaper shows utility ofthe proposed model by presenting an example of simulation a VSM-based DPS system, and analyzes the model by comparing the features of DPS- VSM with some other DAI programming shells.

  • PDF

SPARQL Query Processing in Distributed In-Memory System (분산 메모리 시스템에서의 SPARQL 질의 처리)

  • Jagvaral, Batselem;Lee, Wangon;Kim, Kang-Pil;Park, Young-Tack
    • Journal of KIISE
    • /
    • v.42 no.9
    • /
    • pp.1109-1116
    • /
    • 2015
  • In this paper, we propose a query processing approach that uses the Spark functional programming and distributed memory system to solve the computational overhead of SPARQL. In the semantic web, RDF ontology data is produced at large scale, and the main challenge for the semantic web is to query and manipulate such a large ontology with a high throughput. The most existing studies on SPARQL have focused on deploying the Hadoop MapReduce framework, and although approaches based on Hadoop MapReduce have shown promising results, they achieve a low level of throughput due to the underlying distributed file processes. Therefore, in order to speed up the query processes, we suggest query- processing methods that are based on memory caching in distributed memory system. Our approach is also integrated with a clause unification method for propagating between the clauses that exploits Spark join, map and filter methods along with caching. In our experiments, we have achieved a high level of performance relative to other approaches. In particular, our performance was nearly similar to that of Sempala, which has been considered to be the fastest query processing system.

Implementation and Performance Evaluation of Software Distributed Shared Memory for SMP Clusters (SMP 클러스터를 위한 소프트웨어 분산 공유메모리의 구현 및 성능 측정)

  • 이동현;이상권;박소연;맹승렬
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.7_8
    • /
    • pp.331-340
    • /
    • 2003
  • Low-cost commodity SMP(Symmetric Multiprocessor) is widely used as a node of cluster system. In this paper, we implement and evaluate the performance of SDSM system for SMP clusters. Our SDSM system provides HLRC(Home-based Lazy Release Consistency) memory consistency model. Our protocol utilize shared memory within same SMP node, so that page fetch and message passing through network can be reduced. It is implemented on 8 node of 2-way Pentium-III SMP interconnected with 100Mbps Fast Ethernet, and uses TCP/IP for transport/network layer protocol. The experiment with eight applications shows that our SMP protocol achieves maximum 33% speedup improvement and 13%-52% reduction of page fetch compared with uniprocessor protocol.

Concurrency Control Method to Provide Transactional Processing for Cloud Data Management System

  • Choi, Dojin;Song, Seokil
    • International Journal of Contents
    • /
    • v.12 no.1
    • /
    • pp.60-64
    • /
    • 2016
  • As new applications of cloud data management system (CDMS) such as online games, cooperation edit, social network, and so on, are increasing, transaction processing capabilities for CDMS are required. Several transaction processing methods for cloud data management system (CDMS) have been proposed. However, existing transaction processing methods have some problems. Some of them provide limited transaction processing capabilities. Some of them are hard to be integrated with existing CDMSs. In this paper, we proposed a new concurrency control method to support transaction processing capability for CDMS to solve these problems. The proposed method was designed and implemented based on Spark, an in-memory distributed processing framework. It uses RDD (Resilient Distributed Dataset) model to provide fault tolerant to data in the main memory. In our proposed method, database stored in CDMS is loaded to main memory managed by Spark. The loaded data set is then transformed to RDD. In addition, we proposed a multi-version concurrency control method through immutable characteristics of RDD. Finally, we performed experiments to show the feasibility of the proposed method.

Dynamic Limited Directory Scheme for Distributed Shared Memory Systems (분산공유 메모리 시스템을 위한 동적 제한 디렉터리 기법)

  • Lee, Dong-Gwang;Gwon, Hyeok-Seong;Choe, Seong-Min;An, Byeong-Cheol
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.4
    • /
    • pp.1098-1105
    • /
    • 1999
  • The caches in distributed shared memory systems enhance the performance by reducing memory access latency and communication overhead, but they must solve the cache coherence problem. This paper proposes a new directory protocol to solve the cache coherence problem and to improve the system performance in distributed shared memory systems. To maintain the cache coherence of shared data, processors within a limited distance reduce the communication overhead by using a bit-vector like the full directory scheme. Processors over a limited distance store pointers in a directory pool. Since the bit-vector and the directory pool remove the unnecessary cache invalidations, the proposed scheme reduces the communication traffic and improves the system performance. The dynamic limited directory scheme reduces the communication traffic up to 66 percents compared with the limited directory scheme and the number of directory access up to 27 percents compared with the dynamic pointer allocation scheme.

  • PDF