• Journal of Welding and Joining
• /
• v.23 no.6
• /
• pp.18-28
• /
• 2005

본 일반 지침은 용접 이음부나 구조물의 피로강도 평가에 사용되는 기준응력 계산에 관한 내용으로 핫스팟 응력(Hot Spot Stress, 이하 HSS)이라고 칭하는 응력 평가용 해석 기술 및 관련 내용을 다룬다. 국제용접협회 (IIW: International Institute of Welding)발간 지침서의 주요내용에 대한 간략한 소개와 함께 대한용접학회 용접강도연구위원회의 Round-Robin 시험결과를 바탕으로 유한요소 응력해석 기반 용접 이음부의 HSS 평가 방법에 관한 내용을 정리하였다.

• International Journal of Computer Science & Network Security
• /
• v.23 no.7
• /
• pp.165-170
• /
• 2023

Scheduling algorithms plays a significant role in optimizing the CPU in operating system. Each scheduling algorithms schedules the processes in the ready queue with its own algorithm design and its properties. In this paper, the performance analysis of First come First serve scheduling, Non preemptive scheduling, Preemptive scheduling, Shortest Job scheduling and Round Robin algorithm has been discussed with an example and the results has been analyzed with the performance parameters such as minimum waiting time, minimum turnaround time and Response time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.4B
• /
• pp.675-682
• /
• 2000

In this paper, we propose a new scheduling algorithm called the Adaptive Weighted Round Robin with Delay Tolerance (AWRR/DT). The proposed scheme is based on the per-class queueing mechanism in which a number of connections of similar characteristics are multiplexed into one class-queue. Traffic classes of the proposed method are classified into a single non-real-time traffic class and other real-time traffic classes. The proposed scheme determines the weights of classes according to the input traffic and delay characteristics of each class at the beginning of every cycle. Furthermore, this scheme incorporates a cell discarding method to reduce the QoS degradation that may be incurred by congestion of networks. We have evaluated the proposed scheme through discrete-event simulation. Simulation results indicate that the proposed scheme can reduce the average delay of non-real-time class while maintaining the QoS of real-timeclasses. The proposed algorithm can be effectively applied to high-speed networks such as ATM networks.

• Polymer(Korea)
• /
• v.29 no.6
• /
• pp.536-542
• /
• 2005

The effect of lime-related parameters such as loading velocity, load application time, gauge reading time on Rockwell hardness measurement was investigated for PE, PP PVC, and PMMA. It was found that keeping the specific requirements in the same condition is very important to obtain reliable and repeatable darn in polymer hardness measurement. The optimum condition for hardness measurement was 4 sec for load application time,15 sec for test load application net time, and 15 sec for gauge reading time after unloading. Using thess conditions, round robin test was carried out for 6 laboratories and it was shown that the testing machine should be one in which time-related variables are controllable. Indirect verification of hardness tester using brass reference block was not enough to guarantee the test results for polymer.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5A
• /
• pp.417-425
• /
• 2005

KOINONIA is high-rate Wireless Personal Area Network (WPAN) technology, and is developed for multimedia traffic transmission in personal area. A KOINONIA piconet is a collection of one or more associated slaves under a single master. Efficient scheduling of a master for the traffic of slaves is essential to use channel effectively and to guarantee QoS of multimedia traffic. We propose a new scheduling algorithm to allocate channel time at desired intervals regardless of superframe length, and a Connection Admission Control(CAC) algorithm to regulate the number of traffics in a piconet. Our proposed algorithms have been shown to save channel time and to meet QoS requirements compared to the conventional weighted round-robin algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.11
• /
• pp.2433-2438
• /
• 2011

Bus system consists of several masters, slaves, arbiter and decoder in a bus. Master means the processor that performs data command like CPU, DMA, DSP and slave means the memory that responds the data command like SRAM, SDRAM and register. Furthermore, as multiple masters can't use a bus concurrently, arbiter plays an role in bus arbitration. In compliance with the selection of arbitration method, bus system performance can be changed definitely. Fixed priority and round-robin are used in general arbitration method and TDMA and Lottery bus methods are proposed currently as the improved arbitration schemes. In this study, we proposed the score arbitration method and synthesized it using Hynix 0.18um technology, after design of RTL. Also we analyze the performance compared with general arbitration methods through simulation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.1
• /
• pp.1-9
• /
• 2010

In this paper we propose a scheduling algorithm for supporting Quality of Service(QoS) in IEEE 802.11e HCCA referred to as ASR-DRR and ASD-DRR, which aims at providing improved performance for the support of multimedia traffic. Although We identify the problem of the current IEEE 802.11e HCCA (Hybrid Coordination Function Controlled Channel Access) scheduler and its numerous variations, that the queue information cannot be notified to the Hybrid Coordinator (HC) timely, therefore the uplink delay lengthens unnecessarily. We suggests a simple solution and a couple of implementation practices, namely the Adaptive Scheduler with RTS/CTS (ASR) and Adaptive Scheduler with Data/Ack (ASD). They are both further elaborated to emulate the Deficit Round Robin (DRR) scheduler. They are also compared with existing exemplary schedulers through simulation, and shown to perform well.

• The KIPS Transactions:PartC
• /
• v.12C no.5 s.101
• /
• pp.695-700
• /
• 2005

To provide the fair rate and achieve the fair bandwidth allocation, many per-flow scheduling algorithms have been proposed such as fair queueing algorithm for congestion control. But these algorithms need to maintain the state, manage buffer and schedule packets on a per-flow basis; the complexity of these functions may prevent them from being cost-effectively implemented. In this paper, therefore, to acquire cost-effectively for implementation, we propose a CS-FNE(Core Stateless FNE) algorithm that is based on FM(Flow Number Estimation), and evaluated CS-FNE scheme together with CSFQ(Core Stateless Fair Queueing), FRED(Fair Random Early Detection), RED(Random Early Detection), and DRR(Dynamic Round Robin) in several different configurations and traffic sources. Through the simulation results, we showed that CS-FNE algorithm can allocate fair bandwidth approximately than other algorithms, and CS-FNE is simpler than many per-flow basis queueing mechanisms and it can be easily implemented.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.3
• /
• pp.193-204
• /
• 2006

In most existing distributed Web systems, incoming requests are distributed to servers via Domain Name System (DNS). Although such systems are simple to implement, the address caching mechanism easily results in load unbalancing among servers. Moreover, modification of the DNS is necessary to load considering the server's state. In this paper, we propose a new dynamic load balancing method using dynamic DNS update and round-robin mechanism. The proposed method performs effective load balancing without modification of the DNS. In this method, a server can dynamically be added to or removed from the DNS list according to the server's load. By removing the overloaded server from the DNS list, the response time becomes faster. For dynamic scheduling, we propose a scheduling algorithm that considers the CPU, memory, and network usage. We can select a scheduling policy based on resources usage. The proposed system can easily be managed by a GUI-based management tool. Experiments show that modules implemented in this paper have low impact on the proposed system. Furthermore, experiments show that both the response time and the file transfer rate of the proposed system are faster than those of a pure Round-Robin DNS.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.29 no.2
• /
• pp.98-103
• /
• 2009

The nuclear power plants have been safely operated by plugging the steam generator tubes which have the crack indications. Tube rupture events can occur if analysts fail to detect crack indications during in-service inspection. There are various types of crack indication in steam generator tubes and they have been detected by the eddy current test. The integrity assessment should be performed using the crack-sizing results from eddy current data when the crack indication is detected. However, it is not easy to evaluate the crack-depth precisely and consistently due to the complexity of the methods. The current crack-sizing methods were reviewed in this paper and the suitable ones were selected through the laboratory tests. The retired steam generators of Kori Unit 1 were used for this study. The round robin tests by the domestic qualified analysts were carried out and the statistical models were introduced to establish the appropriate depth-sizing techniques. It is expected that the proposed techniques in this study can be utilized in the Steam Generator Management Program.