• Title/Summary/Keyword: 분산 결정 방식

검색결과 176건 처리시간 0.036초

A Study on the Load Balancing Strategy (부하 균등화 기법 연구)

  • Kim, Kyang-Hyu;Jung, Gu-Young
    • Journal of the Korea Computer Industry Society
    • /
    • 제5권9호
    • /
    • pp.841-850
    • /
    • 2004
  • In this paper under the distributed system for efficient distribution resource to system's each node must be designed to get right decision making. Thus we considered computing time to estimate fault such as delay on communication network, communication period and other decision making. Aiso, using direct communitation mode improve the availity of total system.

  • PDF

A Frame-based Coding Mode Decision for Temporally Active Video Sequence in Distributed Video Coding (분산비디오부호화에서 동적비디오에 적합한 프레임별 모드 결정)

  • Hoangvan, Xiem;Park, Jong-Bin;Shim, Hiuk-Jae;Jeon, Byeung-Woo
    • Journal of Broadcast Engineering
    • /
    • 제16권3호
    • /
    • pp.510-519
    • /
    • 2011
  • Intra mode decision is a useful coding tool in Distributed Video Coding (DVC) for improving DVC coding efficiency for video sequences having fast motion. A major limitation associated with the existing intra mode decision methods, however, is that its efficiency highly depends on user-specified thresholds or modeling parameters. This paper proposes an entropy-based method to address this problem. The probabilities of intra and Wyner?Ziv (WZ) modes are determined firstly by examining correlation of pixels in spatial and temporal directions. Based on these probabilities, entropy of the intra and the WZ modes are computed. A comparison based on the entropy values decides a coding mode between intra coding and WZ coding without relying on any user-specified thresholds or modeling parameters. Experimental results show its superior rate-distortion performance of improvements of PSNR up to 2 dB against a conventional Wyner?Ziv coding without intra mode decision. Furthermore, since the proposed method does not require any thresholds or modeling parameters from users, it is very attractive for real life applications.

Performance Improvement of Parallel Processing System through Runtime Adaptation (실행시간 적응에 의한 병렬처리시스템의 성능개선)

  • Park, Dae-Yeon;Han, Jae-Seon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • 제26권7호
    • /
    • pp.752-765
    • /
    • 1999
  • 대부분 병렬처리 시스템에서 성능 파라미터는 복잡하고 프로그램의 수행 시 예견할 수 없게 변하기 때문에 컴파일러가 프로그램 수행에 대한 최적의 성능 파라미터들을 컴파일 시에 결정하기가 힘들다. 본 논문은 병렬 처리 시스템의 프로그램 수행 시, 변화하는 시스템 성능 상태에 따라 전체 성능이 최적화로 적응하는 적응 수행 방식을 제안한다. 본 논문에서는 이 적응 수행 방식 중에 적응 프로그램 수행을 위한 이론적인 방법론 및 구현 방법에 대해 제안하고 적응 제어 수행을 위해 프로그램의 데이타 공유 단위에 대한 적응방식(적응 입도 방식)을 사용한다. 적응 프로그램 수행 방식은 프로그램 수행 시 하드웨어와 컴파일러의 도움으로 프로그램 자신이 최적의 성능을 얻을 수 있도록 적응하는 방식이다. 적응 제어 수행을 위해 수행 시에 병렬 분산 공유 메모리 시스템에서 프로세서 간 공유될 수 있은 데이타의 공유 상태에 따라 공유 데이타의 크기를 변화시키는 적응 입도 방식을 적용했다. 적응 입도 방식은 기존의 공유 메모리 시스템의 공유 데이타 단위의 통신 방식에 대단위 데이타의 전송 방식을 사용자의 입장에 투명하게 통합한 방식이다. 시뮬레이션 결과에 의하면 적응 입도 방식에 의해서 하드웨어 분산 공유 메모리 시스템보다 43%까지 성능이 개선되었다. Abstract On parallel machines, in which performance parameters change dynamically in complex and unpredictable ways, it is difficult for compilers to predict the optimal values of the parameters at compile time. Furthermore, these optimal values may change as the program executes. This paper addresses this problem by proposing adaptive execution that makes the program or control execution adapt in response to changes in machine conditions. Adaptive program execution makes it possible for programs to adapt themselves through the collaboration of the hardware and the compiler. For adaptive control execution, we applied the adaptive scheme to the granularity of sharing adaptive granularity. Adaptive granularity is a communication scheme that effectively and transparently integrates bulk transfer into the shared memory paradigm, with a varying granularity depending on the sharing behavior. Simulation results show that adaptive granularity improves performance up to 43% over the hardware implementation of distributed shared memory systems.

An Adaptive Gradient-Projection Image Restoration Algorithm with Spatial Local Constraints (공간 영역 제약 정보를 이용한 적응 Gradient-Projection 영상 복원 방식)

  • 송원선;홍민철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제28권3C호
    • /
    • pp.232-238
    • /
    • 2003
  • In this paper, we propose a spatially adaptive image restoration algorithm using local statistics. The local mean, variance, and maximum values are utilized to constrain the solution space, and these parameters are computed at each iteration step using partially restored image. A parameter defined by the user determines the degree of local smoothness imposed on the solution. The resulting iterative algorithm exhibits increased convergence speed when compared to the non-adaptive algorithm. In addition, a smooth solution with a controlled degree of smoothness is obtained. Experimental results demonstrate the capability of the proposed algorithm.

End Edge Cogging Force Minimization according to the Distance between Armatures of Stationary Discontinuous Armature PMLSM with Concentrated Winding (전기자 분산배치 집중권 PMLSM의 전기자 간격에 따른 단부 코깅력 최소화)

  • Kim, Yong-Jae
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • 제8권8호
    • /
    • pp.1241-1246
    • /
    • 2013
  • Currently, The general transportation system arranges the armature on the full length of transportation lines. However, when this method is applied to the long distance transportation system, it causes an increase of material cost and manufacturing time. Thus, in order to resolve this problem, discontinuous arrangement method of the armature has been proposed. However, in the method of using stationary discontinuous armatures, mover can stop in the freewheeling section which is non-installations section when disturbance is generated and the mover can not be moved because armature control is impossible. Thus, the distance determination of armature is very important. Also, when the armature is arranged discontinuously the edge always exists due to the structure. Due to this edge, the cogging force is greatly generated during the entry and ejection of the mover to the armature. This cogging force causes thrust force ripple generating noise, vibration and decline of performance, it must be reduced. Therefore, in this paper, we examined the end edge cogging force generated by the stationary discontinuous armatures through 2-D numerical analysis using finite element method (FEM) and we figured out distance of armature for end edge cogging force minimization.

Application of Bucket Brigade in Manufacturing and Logistics Systems (생산 및 물류 시스템에서의 Bucket Brigade 활용 및 시뮬레이션 분석)

  • Gu Pyeong-Hoi;Gang Hui-Yeong
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
    • /
    • pp.148-152
    • /
    • 2006
  • 제품(또는 서비스)을 생산하기 위하여 여러 순차적인 작업이 수행되어야 하는 환경에서 생산자원(기계 또는 작업자)에게 얼마만큼의 요소작업을 배정하는가를 결정하는 작업배정(Work Assignment) 문제는 중요한 의사결정 문제이다. 일반적으로 이용하는 작업배정 방식은 각 생산자원에게 가급적 균등한 작업량을 배정하는 라인밸런싱(LB: Line Balancing) 전략이다. 그러나 LB 방식은 작업자의 작업속도 차이나 시스템의 여러 가지 변동 상황(기계고장, 품질문제 등)의 고려 없이 작업을 배정하기 때문에 실제로는 계획된 밸런싱효율을 달성하기 어렵다. Bucket Brigade (BB)는 이러한 문제에 대응하기 위한 새로운 작업배정 방법으로 제시되고 있다. BB는 개미의 협력작업 개념을 바탕으로 하는 분산 자율적인 작업배정 방법이다. 본 발표에서는 생산 및 물류시스템에서 BB의 적용 가능성과 문제점을 논의하고, 시뮬레이션을 통하여 여러 작업 환경에서 BB의 수행도를 분석한다.

  • PDF

Energy-efficient Data Collection Using Fair Load Balancing in Wireless Sensor Networks (무선센서네트워크에서 부하 균등 분산 기법을 적용한 에너지 효율적인 데이터 수집 방법)

  • Ahn, Minjoon;Bae, Dongju;Choo, Hyunseung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 한국정보처리학회 2010년도 추계학술발표대회
    • /
    • pp.1063-1064
    • /
    • 2010
  • 무선센서네트워크에서 각 센서노드는 한정된 배터리 자원을 갖기 때문에, 에너지 소비를 균등하게 하여 전체 네트워크의 라이프타임을 늘리는 것이 중요하다. 네트워크 라이프타임을 증가시키기 위한 여러 스케줄링 기법들이 제안되었지만, 여전히 특정 센서노드가 일찍 방전되는 문제점이 있다. 따라서, 본 논문에서는 각 센서노드의 사용률을 균등하게 분산하여, 모든 센서노드가 에너지를 골고루 소비하도록 하는 방법을 소개한다. 부모노드에 여러 자식노드들이 연결되어 있을 때, 리니어프로그래밍을 통해 링크의 흐름량을 결정함으로써 각 부모노드들의 이용률을 고르게 분산한다. 링크의 흐름률에 따라 각 주기별로 트리의 모양을 다르게 변경하는데, 라이프타임을 최대화하기 위한 트리 구성 방식을 제안한다.

CACH Distributed Clustering Protocol Based on Context-aware (CACH에 의한 상황인식 기반의 분산 클러스터링 기법)

  • Mun, Chang-Min;Lee, Kang-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • 제13권6호
    • /
    • pp.1222-1227
    • /
    • 2009
  • In this paper, we proposed a new method, the CACH(Context-aware Clustering Hierarchy) algorithm in Mobile Ad-hoc Network(MANET) systems. The proposed CACH algorithm based on hybrid and clustering protocol that provide the reliable monitoring and control of a variety of environments for remote place. To improve the routing protocol in MANET, energy efficient routing protocol would be required as well as considering the mobility would be needed. The proposed analysis could help in defining the optimum depth of hierarchy architecture CACH utilize. Also, the proposed CACH could be used localized condition to enable adaptation and robustness for dynamic network topology protocol and this provide that our hierarchy to be resilient. As a result, our simulation results would show that a new method for CACH could find energy efficient depth of hierarchy of a cluster.

Synthesis of Water-Dispersible Maghemite Nanocrystals using 6-Aminohexanoic Acid as a Capping Agent (6-Aminohexanoic Acid를 이용하여 물에 분산되는 Maghemite 나노입자의 합성)

  • Yu, Taekyung
    • Korean Chemical Engineering Research
    • /
    • 제51권3호
    • /
    • pp.403-406
    • /
    • 2013
  • This paper describes a simple route to synthesis of water-dispersible monodisperse maghemite (${\gamma}-Fe_2O_3$) nanocrystals using 6-aminohexanoic acid (AHA) as a stabilizer. The water-dispersible ${\gamma}-Fe_2O_3$ nanocrystals with an average size of 5 nm were obtained simply by addition of $Fe(CO)_5$ into an octyl ether solution containing AHA at $195^{\circ}C$ under argon condition. As-prepared AHA coated ${\gamma}-Fe_2O_3$ nanocrystals exhibited highly crystallinity and magnetic property while keeping a good dispersity in an aqueous phase. We also obtained water-dispersible AHA coated ${\gamma}-Fe_2O_3$ nanocrystals using ligand-exchange method, demonstrating that AHA can be a good candidate for preparing water-dispersible uniform metal oxide nanocrystals.

Timing Recovery Algorithm with Slop Compensated for Multi-level PAM Signals (Multi-level PAM신호에 적용 가능한 기울기 보상 심볼타이밍 알고리즘)

  • 전광호;임명섭
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제26권11A호
    • /
    • pp.1864-1871
    • /
    • 2001
  • In this paper, new symbol timing recovery algorithm is proposed, which is suitable for the digital communication system with Multi-level PAM signals. In the newly proposed symbol timing recovery algorithm, the timing error function is derived by compensating the several difference values between sampled symbol and neighboring symbol every symbol period with mid samples and decided symbol values. Conventional symbol timing recovery methods did not work well in Multi-level PAM signals, but the newly proposed method can be applied to Multi-level PAM signals as well as QPSK. For the performance analysis, the derived variance of the timing error function and the timing error characteristics of S-curve show that the proposed method has better performance than Gardner method and the modified Gardner method.

  • PDF