• 제목/요약/키워드: parallel machines

검색결과 208건 처리시간 0.022초

Rotor Loss Analysis of Permanent Magnet High-Speed Machine According to Magnetization Pattern

  • Cho, Han-Wook;Jang, Seok-Myeong;Lee, Sung-Ho;Yang, Hyun-Sup;Jeong, Yeon-Ho
    • KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
    • /
    • 제4B권3호
    • /
    • pp.103-107
    • /
    • 2004
  • Recently, greater attention has been paid to the high-speed generator for its many merits, such as ease of installation, high efficiency and high power density. However, due to their high fundamental frequency, careful consideration needs to be given to both electromagnetic and mechanical design issues. This paper deals with the comparison of two types of permanent magnet high-speed machines. Specifically, the effect of the permanent magnet magnetization pattern on the rotor losses is investigated. On the basis of analytical field analysis and the 2-D finite element method, this paper predicts the flux harmonics and rotor losses under the no-load condition. It is shown that the Halbach magnetization is superior to parallel magnetization in terms of producing rotor losses.

Development of Automatic Rearing System of Silkworm

  • Osamu Ninagi
    • 한국잠사학회:학술대회논문집
    • /
    • 한국잠사학회 1997년도 Progress and Future Development of Sericultural Science and Technology 40th Anniversary Commemoration Symposium
    • /
    • pp.103-117
    • /
    • 1997
  • Decrease in the cocoon production of Japan is drastic because of low price of cocoon, scarcity of successors and so on. To tide over the difficulty, the automation system in the sericulture was discussed and some trials have been conducted by the Ministry of Agriculture, Forestry and Fisheries of Japan. The attempts are based on a low cost artificial diet which does not rely on mulberry leaves. Automatic machines developed until now are a rearing machine constituted with repeated belt conveyor, an reformation type of former rearing machine "Bombyx" and a mounting machine. Running parallel with them, utilization of 20-hydroxyecdysone extracted from a plant to the mounting was also studied to use their machines efficiently in the fields. In conclusion, 10 tons of law cocoon will come to be produced by two persons labor. At present, an automatic rearing system on low cost artificial diet has been developing for the future sericulture.

클러스터 컴퓨팅 환경에서 병렬루프 처리를 위한 재구성 가능한 부하 및 성능 균형 방법 (A Reconfigurable Load and Performance Balancing Scheme for Parallel Loops in a Clustered Computing Environment)

  • 김태형
    • 한국정보과학회논문지:컴퓨팅의 실제 및 레터
    • /
    • 제10권1호
    • /
    • pp.49-56
    • /
    • 2004
  • 부하 불균형은 병렬처리에 있어서 좋은 성능을 얻기 위한 주요한 방해 요소 중의 하나이다. 전역(全域) 부하균형 기법은 하나의 응용에서 발생된 병렬 태스크를 취급하는데 적절하지 않다. 동적 루프 스케줄링 기법은 공유 메모리 멀티프로세서 병렬구조에서 병렬 루프의 부하균형에 효과적인 것으로 알려져있다. 하지만 이 기법의 중앙집중적 특성은 워크스테이션 클러스터 환경에서 프로세서 수가 상대적으로 많지 않은 경우에도 병목현상을 일으킬 수 있는 요인이 된다. 워크스테이션 클러스터 환경에서의 통신 오버헤드는 공유 메모리 멀티프로세서 병렬 구조와 비교할 때 수십배의 차이가 생기기 때문이다. 더구나 병렬 루프에서 발생하는 단위 태스크가 불규칙적인 작업량을 갖는 경우에는 기본 루프 스케줄링 기법의 단점을 보완한 개선된 방법들을 적용할 수가 없다. 본 논문에서는 이러한 불규칙적인 작업량을 갖는 병렬루프를 서로 다른 성능을 갖는 워크스테이션들의 네트워크 환경에서 효율적으로 부하를 분배하기 위한 재구성 가능한 분산 부하 균형 기법을 제시한다. 이러한 재구성 가능한 기법은 전통적인 부하균형 방법과 함께 성능균형을 가능하게 함으로써 전체수행시간을 최소화할 수 있음을 보였다.

A Hardware-Based String Matching Using State Transition Compression for Deep Packet Inspection

  • Kim, HyunJin;Lee, Seung-Woo
    • ETRI Journal
    • /
    • 제35권1호
    • /
    • pp.154-157
    • /
    • 2013
  • This letter proposes a memory-based parallel string matching engine using the compressed state transitions. In the finite-state machines of each string matcher, the pointers for representing the existence of state transitions are compressed. In addition, the bit fields for storing state transitions can be shared. Therefore, the total memory requirement can be minimized by reducing the memory size for storing state transitions.

FUZZY HYPERCUBES: A New Inference Machines

  • Kang, Hoon
    • 한국지능시스템학회논문지
    • /
    • 제2권2호
    • /
    • pp.34-41
    • /
    • 1992
  • A robust and reliable learning and reasoning mechanism is addressed based upon fuzzy set theory and fuzzy associative memories. The mechanism stores a priori an initial knowledge base via approximate learning and utilizes this information for decision-making systems via fuzzy inferencing. We called this fuzzy computer architecture a 'fuzzy hypercube' processing all the rules in one clock period in parallel. Fuzzy hypercubes can be applied to control of a class of complex and highly nonlinear systems which suffer from vagueness uncertainty. Moreover, evidential aspects of a fuzzy hypercube are treated to assess the degree of certainty or reliability together with parameter sensitivity.

  • PDF

해남-제주 HVDC 계통의 제어 계층 구조 분석 (Control Hierarchy Analysis of Haenam-Cheju HVDC system)

  • 곽주식
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1999년도 하계학술대회 논문집 C
    • /
    • pp.1327-1330
    • /
    • 1999
  • In this paper control hierarchy of Haenam-Cheju HVDC link are analyzed and their functional specifications are summarized related to their level. The control functions for the submarine DC transmission are implemented by software programs on 16-bit parallel processor-based machines which are composed of subunits hierarchically linked each other

  • PDF

고유치 솔버 Davidson Method 의 병렬화 (A Parallel Algorithm of Davidson Method for Eigenproblems)

  • 김형중
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1997년도 하계학술대회 논문집 A
    • /
    • pp.12-14
    • /
    • 1997
  • The analysis of eigenvalue and eigenvector is a crucial procedure for many electromagnetic computation problems. However, eigenpair computation is timing-consuming task. Thus, its parallelization is required for designing large-scale and precision three-dimensional electromagnetic machines. In this paper, the Davidson method is parallelized on a cluster of workstations. Performance of the parallelization scheme is reported. This scheme is applied to a ridged waveguide design problem.

  • PDF

스윗칭회로의 경로설정을 위한 신경 회로망 연구 (A Study on Neural Network for Path Searching in Switching Network)

  • 박승규;이노성;우광방
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1990년도 추계학술대회 논문집 학회본부
    • /
    • pp.432-435
    • /
    • 1990
  • Neural networks are a class of systems that have many simple processors (neurons) which are highly interconnected. The function of each neuron is simple, and the behavior is determined predominately by the set of interconnections. Thus, a neural network is a special form of parallel computer. Although major impetus for using neural networks is that they may be able to "learn" the solution to the problem that they are to solve, we argue that another, perhaps even stronger, impetus is that they provide a framework for designing massively parallel machines. The highly interconnected architecture of switching networks suggests similarities to neural networks. Here, we present switching applications in which neural networks can solve the problems efficiently. We also show that a computational advantage can be gained by using nonuniform time delays in the network.

  • PDF

소형 원심압축기의 성능평가에 대한 실험적 연구 (An Experimental Study on the Performance Evaluation of a Small-Sized Centrifugal Compressor)

  • 조성국;강신형
    • 대한기계학회논문집B
    • /
    • 제22권8호
    • /
    • pp.1052-1063
    • /
    • 1998
  • The performance database of small-sized centrifugal compressors is needed for the design of high performance machines and also for the verification of design tools and analysis software. An impeller is designed, manufactured and tested. The effects of several parameters on the evaluation of performance are investigated and the performance test of parallel diffuser is also carried out. The proper estimation of static pressure, total temperature and blockage at the impeller exit is important for performance evaluation. 4 method in cooperation with 3-D calculation is suggested. The measured performances are in a good agreement with the predicted results. However, there are some discrepancies in efficiency.

A Lagrangian Relaxation Method for Parallel Machine Scheduling with Resource Constraints

  • 김대철
    • 산업공학
    • /
    • 제11권3호
    • /
    • pp.65-75
    • /
    • 1998
  • This research considers the problem of scheduling jobs on parallel machines with non-common due dates and additional resource constraints. The objective is to minimize the total absolute deviation of job completion times about the due dates. Job processing times are assumed to be the same. This problem is motivated by restrictions that occur in the handling and processing of jobs in certain phases of semiconductor manufacturing and other production systems. We examine two problems. For the first of these, the number of different types of additional: resources and resource requirements per job are arbitrary. The problem is formulated as a zero-one integer linear programming and the Lagrangian relaxation approach is used. For the second case, there exists one single type of additional resource and the resource requirements per job are zero or one. We show how to formulate the problem as an assignment problem.

  • PDF