• The Transactions of the Korean Institute of Electrical Engineers B
• /
• v.53 no.7
• /
• pp.437-443
• /
• 2004

In this work the AC loss measurement setup based on an iron core background magnet, not used in a conventional one, has been successfully developed. To prove its validity, a round-robin test for the same Bi-2223 tape sample among three institutes has been done. The results show that the self-field and magnetization losses from the developed setup well agree with the losses measured at two other institutes of Korea Basic Science Institute and Yokohama National University. The measured magnetization losses for parallel or perpendicular fields can be well predicted from the slab model or the strip model for a filamentary region. However the magnetization losses for longitudinal fields can be rather predicted by the slab model for a decoupled filament. The self-field losses are well explained by the Norris ellipse model.

• Proceedings of the KIEE Conference
• /
• 2003.07b
• /
• pp.780-782
• /
• 2003

60 Hz의 전력분야에 고온초전도체를 적용 하는데 있어 가장 큰 장애요소인 교류손실에 대한 연구의 일환으로서 한 일간의 상이한 시험방법 및 장치에 대한 신뢰성과 정밀도를 상호 확인하기 위해 동일한 샘플 및 동일 시험조건으로 양측에서 round-robin테스트를 하였다. 그 주요 결과는 양측에서 측정한 자화손실은 시험 방법 및 장치의 상이함에도 불구하고 비교적 잘 일치하였다. 이는 자화손실 측정 시, 금기사항으로 되어있는 철심자석의 사용이 문제가 되지 않음을 의미하며, 이는 다시 기존 자화손실 시험장치의 공심자석 및 자석용 전원 설비가 대단히 소형화될 수 있음을 의미한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.2
• /
• pp.73-78
• /
• 2023

The dining philosophers problem(DPP) is that five philosophers sit around a round table and eat spaghetti(or noodles) together, where they must have a pair of chopsticks(two) on both sides of them to eat, and if all philosophers have one chopstick on the right, no one can eat because the deadlock occurs. Deadlocks are a problem that frequently occur in parallel systems, and most current operating systems(OS) cannot prevent it. This paper proposes a silver bullet that causes no deadlock in an OS where all processors of 2≤n≤∞ have multiple parallel processing capabilities. The proposed method is a group round-robin method in which ⌊n/2⌋ odd processors form a group and perform simultaneously, and shift right to the next processor when execution ends. The proposed method is to perform two times for even processors, three times for odd processors per one round-robin. If the proposed method is performed n times, even-numbered processors perform n/2 times and odd-numbered processors perform (n-1)/2-times.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2001.05a
• /
• pp.1174-1179
• /
• 2001

차음성능 측정에 관한 국제간 신인도 향상을 위하여 home and away 테스트가 수행되었다. 동일 시편에 대한 비교 테스트 결과 대부분의 시편에서는 STC 1 ㏈ 이내의 차이를 보였다. 다만, 특정 시편의 경우 STC 5 ㏈의 차이가 발생하였다. 주원인으로는 잔향시간 측정 오차가 주원인으로 추정되며, 또한 부수적인 원인으로는 시편의 제작 및 설치의 차이 때문인 으로 사료된다.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.347-350
• /
• 2002

In the input buffer switch system, VOQ(Virtual Output Queue) archives 100% throughput. The VOQ with the systolic architecture maintains an uniform performance regardless of a number of Packet class and output port, so that it doesn't have a limitation of scalability. In spite of these advantages, the systolic architecture VOQ is difficult to change sorting order In this paper, we Proposed a systolic architecture VOQ which support weighted round robin(WRR) algorithm to provide with flow control service.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.56-56
• /
• 2004

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.227-230
• /
• 2011

본 논문에서는 유한한 자원인 네트워크를 보다 많은 이용자가 원활하게 사용하기 위해 고안된 전송 부하 분산 알고리즘인 Round Robin, Weighted Round Robin과 전송 부하 분산 알고리즘이 존재 하지 않는 네트워크를 Petri-net 이론을 기반으로 한 시뮬레이터(CPN-Tools)를 통해 실험 결과를 비교 분석하여 알고리즘의 필요성과 전송 부하 분산 알고리즘의 특징과 장단점을 실험을 통하여 보였다.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2004.04a
• /
• pp.43-48
• /
• 2004

RTP that is proposed supplement of real-time services on internet environment, as Real-time Transport Protocol, is the protocol that for the purpose of sending data of stream type. RTP and RTCP(Real-time Transport Control Protocol) basically work at the same time, RTCP serves with state information of network at present. RTP has important properties of a transport protocol that runs on end-to-end systems and provides demultiplexing. It also offer reliability and protocol-defined flow／congestion control that transport protocol like TCP can not provides. In this paper, we look around concept and construction of Differentiated sen1ice tint run on RTP and by setting parameters of packet transfer method be used CBQ(Class-Based Queuing) for packet transfer on Differentiated service, each service queue controls properly through packet scheduling method, such as WRR(Weighted Round Robin) and PRR(Packet-by-packet Round Robin) all service classes do not experience the starvation and confirm the performance through computer simulation to achieve fairly scheduling.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.47 no.5
• /
• pp.80-86
• /
• 2010

The conventional bus system architecture consists of masters, slaves, arbiter, decoder and so on in shared bus. As several masters can't use a bus concurrently, arbiter plays an role in arbitrating the bus. The efficiency of bus usage can be determined by the selection of arbitration method. Fixed Priority, Round-Robin, TDMA and Lottery arbitration policies are studied in the conventional arbitration method where the bus priority is primarily considered. In this paper, we propose the arbitration method that calculates the bus utilization of each master. Furthermore, we verify the performance compared with the other arbitration methods through TLM(Transaction Level Model). From the results of performance verification, the arbitration methods of Fixed Priority and Round-Robin can not set the bus utilization and those of TDMA and Lottery happen the error of 50% and 70% respectively compared with bus utilization set by user in more than 100,000 cycles. On the other hand, the bandwidth-award bus arbitration method remains the error of less than 1% since approximately 1000 cycles, compared with bus utilization set by user.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9A
• /
• pp.888-897
• /
• 2007

In this paper, we propose an uplink dynamic resource allocation algorithm to increase sector throughput and fairness among users in 802.16e OFDMA TDD system. In uplink, we address the difference between uplink and downlink channel state information in 802.16e OFDMA TDD system. The simulation results show that not only an increment of 10% of sector throughput but higher level of fairness is achieved by round-robin using the FLR and the rate / margin adaptive inner closed-loop power control algorithm. The FLR algorithm determines the number of sub-channels to be allocated to the user according to the user's position. Also, we get 31.8% more sector throughput compared with the round-robin using FLR by FASA algorithm using uplink channel state information. User selection, sub-channel allocation, power allocation algorithms and simulation methodology are mentioned in Part I.