• 제목/요약/키워드: Distributed memory

검색결과 397건 처리시간 0.031초

표본화 벡터 개념을 이용한 분산 표본 혼화기의 간단한 구현 (Simple Realizations of Distributed Sample Scramblers Using the Concept of Sampling Vectors)

  • Seok Chang Kim
    • 전자공학회논문지A
    • /
    • 제30A권12호
    • /
    • pp.18-27
    • /
    • 1993
  • In this paper, the concept of sampling vectors is introduced, and used for a simple realization of DSSs(distributed sample scramblers). In DSSs, if the sampling times of the scrambler state samples are not identical to their transmission times, samples are delayedtransmitted to the descrambler. and in this case the DSSs need additional memory elements storing the samples and additional clocks for informing their transmission times. The concept of sampling vectors helps move the sampling times of delayed samples to their transmission times, thus eliminating the additional memory elements and clocks in the DSSs. In the paper, the conditions on the synchronization of the scrambler and descrambler are derived for the DSS employing sampling vectors,and demonstrations are given on their applicaitons to cell-based ATM DSSs.

  • PDF

ParaC 언어의 설계 및 구현 (The Design and Implementation of the ParaC Language)

  • 이경석;우영춘;김진미;지동해
    • 한국정보처리학회논문지
    • /
    • 제4권11호
    • /
    • pp.2903-2913
    • /
    • 1997
  • 본 논문은 공유 및 분산 메모리 구조를 가진 병렬 컴퓨터의 프로그래밍 환경을 지원하기 위하여 ParaC 언어를 설계하고 구현한 내용을 기술한다. ParaC 언어는 확장성 높은 병렬 컴퓨터의 시스템 자원을 사용자가 효과적으로 이용할 수 있도록 설계되었다. 이것은 C 언어에 공유 메모리 환경을 위한 병렬 구문과 동기화 구문, 그리고 분산 메모리 환경을 위한 원격 태스크 구문을 추가함으로써 이루어졌다. 언어의 구현을 위하여 C 언어로의 번역 방법을 기술하였으며, 이 방법을 사용한 번역기와 확장 구문을 위한 실행시간 라이브러리를 구현하였다.

  • PDF

분산 메모리 시스템에서의 MPMD 방식의 비동기 반복 알고리즘을 위한 비대칭 전송의 구현 (Implementation Of Asymmetric Communication For Asynchronous Iteration By the MPMD Method On Distributed Memory Systems)

  • 박필성
    • 인터넷정보학회논문지
    • /
    • 제4권5호
    • /
    • pp.51-60
    • /
    • 2003
  • 비동기 반복 알고리즘은 부하 불균형 및 컴퓨터 노드 간의 전송 지연에 의한 병렬 알고리즘의 성능 저하를 완화하는 하나의 방법인데, 이는 노드들 간의 비대칭적 데이터 전송을 필요로 한다 본 논문에서는 분산 메모리 시스템 상에서 MPMD 방식으로 노드당 별도의 서버 프로세스를 추가로 생성하여 비대칭적 전송을 구현하고, 노드당 하나의 프로세스를 생성하는 SPMD 방식과 비교하며 그 장단점에 대해 논의한다.

  • PDF

Semi-analytical solution for buckling of SMA thin plates with linearly distributed loads

  • Parizi, Fatemeh Salemizadeh;Mohammadi, Meisam
    • Structural Engineering and Mechanics
    • /
    • 제70권6호
    • /
    • pp.661-669
    • /
    • 2019
  • Buckling analysis of shape memory alloy (SMA) rectangular plates subjected to uniform and linearly distributed inplane loads is the main objective in the present paper. Brinson's model is developed to express the constitutive characteristics of SMA plate. Using the classical plate theory and variational approach, stability equations are derived. In addition to external inplane mechanical loads, the plate is subjected to the pre-stresses caused by the recovery stresses that are generated during martensitic phase transformation. Ritz method is used for solving the governing stability equations. Finally, the effects of conditions on the edges, thickness, aspect ratio, temperature and pre-strains on the critical buckling loads of SMA plate are investigated in details.

Effect of Hot-forging on NiTi Shape Memory Alloy Fibers Reinforced Mg Alloy Composite

  • Guo, Qi;Li, Gang;Tang, Renjian;Yan, Biao
    • 한국분말야금학회:학술대회논문집
    • /
    • 한국분말야금학회 2006년도 Extended Abstracts of 2006 POWDER METALLURGY World Congress Part2
    • /
    • pp.846-847
    • /
    • 2006
  • The composite used in this paper was prepared by hot-pressing ball-milled Mg alloy powders, in which NiTi shape memory alloy fibers in a row were sandwiched. The microstructure and property were examined. It is shown that the composite consisted of a homogenous matrix with uniformly distributed NiTi shape memory alloy fibers, recrystallization took place in the Mg alloy matrix which was subjected to plastic deformation an adequate bonding formed between the matrix and fibers; the density and tensile strength of the composite increased after the hot-forging; the hot-forging process is capable of improving properties of the composite.

  • PDF

An Adaptive Virtual Machine Location Selection Mechanism in Distributed Cloud

  • Liu, Shukun;Jia, Weijia
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권12호
    • /
    • pp.4776-4798
    • /
    • 2015
  • The location selection of virtual machines in distributed cloud is difficult because of the physical resource distribution, allocation of multi-dimensional resources, and resource unit cost. In this study, we propose a multi-object virtual machine location selection algorithm (MOVMLSA) based on group information, doubly linked list structure and genetic algorithm. On the basis of the collaboration of multi-dimensional resources, a fitness function is designed using fuzzy logic control parameters, which can be used to optimize search space solutions. In the location selection process, an orderly information code based on group and resource information can be generated by adopting the memory mechanism of biological immune systems. This approach, along with the dominant elite strategy, enables the updating of the population. The tournament selection method is used to optimize the operator mechanisms of the single-point crossover and X-point mutation during the population selection. Such a method can be used to obtain an optimal solution for the rapid location selection of virtual machines. Experimental results show that the proposed algorithm is effective in reducing the number of used physical machines and in improving the resource utilization of physical machines. The algorithm improves the utilization degree of multi-dimensional resource synergy and reduces the comprehensive unit cost of resources.

객체지향 종속 추적 및 체크포인팅(checkpointing)을 이용한 복구 가능한 분산 공유 메모리 시스템 (Recoverable Distributed shared Memory Systems Using Object-Oriented Dependency Tracking and Checkpointing)

  • 김재훈
    • 한국정보처리학회논문지
    • /
    • 제6권2호
    • /
    • pp.476-484
    • /
    • 1999
  • 메시지 전달 방식으로 노드간 통신을 하는 분산 시스템의 고장허용을 위하여 메시지 저장과 체크 포인팅에 관한 많은 연구가 이루어졌다. 복구 가능한 분산 공유메모리 시스템에 대한 대부분의 연구 또한 메시지 전달 방식에서 사용되었던 방법을 채택하였다. 그러나, 메시지 전송시스템과 분산공유메모리 시스템의 근본적인 차이(함수전달(function shipping)과 데이터전달(data shipping)의 차이) 때문에 메시지 전달 시스템에서 사용되었던 방식이 분산공유메모리 시스템에 항상 적합하게 사용될 수 없다. 본 논문에서는 복구 가능한 분산공유메모리 시스템을 위하여 객체지향방법을 제안하였다. 프로세스간 종속 추적대신 페이지간 종속 추적을 이용한 체크 포인팅 및 복구 가능한 전략을 분산 공유 메모리 시스템에 적용하였다.

  • PDF

분산 메모리 다중 프로세서 상에서의 병렬 음성인식 (Parallel Speech Recognition on Distributed Memory Multiprocessors)

  • 윤지현;홍성태;정상화;김형순
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 1998년도 가을 학술발표논문집 Vol.25 No.2 (3)
    • /
    • pp.747-749
    • /
    • 1998
  • 본 논문에서는 음성과 자연언어의 통합처리를 위한 효과적인 병렬 계산 모델을 제안한다. 음소모델은 continuous HMM에 기반을 둔 문맥종속형 음소를 사용하며, 언어모델은 knowledge-based approach를 사용한다. 또한 계층구조의 지식베이스상에서 다수의 가설을 처리하기 위해 memory-based parsing기술을 사용하였다. 본 연구의 병렬 음성인식 알고리즘은 분산메모리 MIMD 구조의 다중 Transputer 시스템을 이용하여 구현되었다. 실험을 통하여 음성인식 과정에서 발생하는 speech-specific problem의 해를 제공하고 음성인식 시스템의 병렬화를 통하여 실시간 음성인식의 가능성을 보여준다.

  • PDF

Strengthened connections between engrams encode specific memories

  • Kim, Ji-il;Choi, Dong Il;Kaang, Bong-Kiun
    • BMB Reports
    • /
    • 제51권8호
    • /
    • pp.369-370
    • /
    • 2018
  • In previous studies, memory storage was localized to engram cells distributed across the brain. While these studies have provided an individual cellular profile of engram cells, their synaptic connectivity, or whether they follow Hebbian mechanisms, remains uncertain. Therefore, our recent study investigated whether synapses between engram cells exhibit selectively enhanced structural and functional properties following memory formation. This was accomplished using a newly developed technique called "dual-eGRASP". We found that the number and size of spines on CA1 engram cells that receive inputs from CA3 engram cells were larger than at other synapses. We further observed that this enhanced connectivity correlated with induced memory strength. CA3 engram synapses exhibited increased release probability, while CA1 engram synapses produced enhanced postsynaptic responses. CA3 engram to CA1 engram projections showed strong occlusion of long-term potentiation. We demonstrated that the synaptic connectivity of CA3 to CA1 engram cells was strengthened following memory formation. Our results suggest that Hebbian plasticity occurs during memory formation among engram cells at the synapse level.

A Walsh-Based Distributed Associative Memory with Genetic Algorithm Maximization of Storage Capacity for Face Recognition

  • Kim, Kyung-A;Oh, Se-Young
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2003년도 ISIS 2003
    • /
    • pp.640-643
    • /
    • 2003
  • A Walsh function based associative memory is capable of storing m patterns in a single pattern storage space with Walsh encoding of each pattern. Furthermore, each stored pattern can be matched against the stored patterns extremely fast using algorithmic parallel processing. As such, this special type of memory is ideal for real-time processing of large scale information. However this incredible efficiency generates large amount of crosstalk between stored patterns that incurs mis-recognition. This crosstalk is a function of the set of different sequencies [number of zero crossings] of the Walsh function associated with each pattern to be stored. This sequency set is thus optimized in this paper to minimize mis-recognition, as well as to maximize memory saying. In this paper, this Walsh memory has been applied to the problem of face recognition, where PCA is applied to dimensionality reduction. The maximum Walsh spectral component and genetic algorithm (GA) are applied to determine the optimal Walsh function set to be associated with the data to be stored. The experimental results indicate that the proposed methods provide a novel and robust technology to achieve an error-free, real-time, and memory-saving recognition of large scale patterns.

  • PDF