• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.256-258
• /
• 2003

본 논문에서 우리는 높은 채널 이용을 목적으로 하는 블루투스 무선네트웍 환경에서의 새로운 스케쥴링 기법을 제안하였다. 현재 블루투스 무선 환경에서는 다양한 사이즈의 패킷 크기를 가지는 멀티미디어 데이터를 전송하는데 RR(Round Robin) 을 많이 사용하고 있다. 그러나 이러한 스케쥴링 기법은 많은 자원의 낭비를 불러 일으킴으로서 블루투스에는 적합하지 않게 된다. 스케쥴링 기법은 QoS 서비스 그리고 시간과 슬랏과 같은 자원관리 와 같은 것을 제공하는데 있어서 매우 중요한 연구이고 우리는 본 논문에서 RR 의 자원낭비 문제점을 해결하기 위해서 DRR(Deficit Round Robin) 을 개선한 스케쥴링 기법을 제안 함으로 인해서 블루투스와 같은 환경에서 다양한 크기의 패킷사이즈를 가지는 멀티미디어 데이터를 자원낭비 없이 효율적으로 전송하는 기법에 대해서 다루게 될것이다.

• Journal of the Korea Society for Simulation
• /
• v.12 no.4
• /
• pp.51-59
• /
• 2003

Real-Time applications on Grid environment have several problems in terms of resource management addressed as follows; (1) dynamic resource allocation to provide QoS objectives, (2) heterogeneous resources that is different scale, or capacity in same unit, and (3) resource availability, and resource needs. This paper describes the techniques of resource manager (RM) handling above problems to support QoS of dynamic real-time applications on Grid. The contributions of this paper to solve problems are as follows: unification of dynamic resource requirements among heterogeneous hosts, control of resources in heterogeneous environments, and dynamic load balancing/sharing. Our heuristic allocation scheme works not only 257% better than random, 142% better than round robin, and 36.4% better than least load in QoS sensitivity, but also 38.6% better than random, 28.5% better than round robin, and 31.6% better than least load in QoS.

• Journal of the Korea Society for Simulation
• /
• v.2 no.1
• /
• pp.13-22
• /
• 1993

In a multiple-bus multiprocessor system in which processors and memory modulus are interconnected through system buses, time delay due to bus contention degrades system performance. In order to reduce such a problem , and optimal bus arbitration scheme and its hardware are neccessary. In this study, performaces of four arbitration schemes are analyzed and compared : fixed-priority, equal-priority, rotating-priority and round-robin priority schemes. For the study, the software simulator of a multiple-bus multiprocessor system is developed by using SLAM II. Simulation results show that, when memory sccesses are evenly distributed to all memory modulus, round-robin priority scheme provides the best performance. But when a hot spot exists, the use of the fixed priority scheme results in the shortest access time.

• Journal of the Korean Ceramic Society
• /
• v.29 no.8
• /
• pp.651-659
• /
• 1992

Fracture toughness of alumina was determined by IF, IS, DT, SEPB methods, and the data were inter-compared. Round robin test on IF and IS methods was also conducted under the participitation of 4∼5 domestic institutes. Fracture toughness data determined by IF, IS, DT methods were similar, while those by SEPB method were smaller. Variation of toughness data determined by IS method using 98N of indentation load was significantly small compared to those determined by any other methods. Round robin test results showed that toughness data determined by IF method at various institutes do not coincide each other, while those by IS method do well coincide. Thus, it was concluded that inter-confidence on fracture toughness data, if determined by IS method at all institute, can be established between institutes.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.4
• /
• pp.1-9
• /
• 2019

LRR(Loose Round Robin) warp scheduling policy for GPU architecture results in high warp-level parallelism and balanced loads across multiple warps. However, traditional LRR policy makes multiple warps execute long latency operations at the same time. In cases that no more warps to be issued under long latency, the throughput of GPUs may be degraded significantly. In this paper, we propose a new warp scheduling policy which utilizes latency hiding, leading to more utilized memory resources in high performance GPUs. The proposed warp scheduler prioritizes memory instruction based on GTO(Greedy Then Oldest) policy in order to provide reduced memory stalls. When no warps can execute memory instruction any more, the warp scheduler selects a warp for computation instruction by round robin manner. Furthermore, our proposed technique achieves high performance by using additional information about recently committed warps. According to our experimental results, our proposed technique improves GPU performance by 12.7% and 5.6% over LRR and GTO on average, respectively.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.11a
• /
• pp.257-259
• /
• 2023

양자 컴퓨터의 발전과 쇼어 알고리즘을 통한 ECC(Eliptic Curve Cryptography)에 대한 다항 시간의 솔루션을 제공함으로써 블록체인의 안정성이 위협받고 있다. 본 논문에서는 Round-Robin을 기반으로 하는 알고리즘을 제안함으로써 블록 생성에 대한 공정성을 제공하며 양자 내성 전자 서명인 CRYSTALS-DIlithium을 적용함으로써 근미래에 다가올 양자 위험성에 대비하였다. TPS 측면에서는 DIlithium의 큰 키 크기와 큰 서명 크기에 의해 ECDSA에 비해 낮은 성능을 보여주었지만, Latency 측면에서는 더욱 높은 성능을 보여주며, 이는 실시간성이 중요한 IoT와 같은 분야에서 더욱 높은 효용성을 보여줌을 알 수 있다.

• Polymer Science and Technology
• /
• v.13 no.3
• /
• pp.384-392
• /
• 2002

• Proceedings of the Korean Nuclear Society Conference
• /
• 2002.10a
• /
• pp.246-246
• /
• 2002

• Proceedings of the Korean Vacuum Society Conference
• /
• 2002.06a
• /
• pp.187-187
• /
• 2002

• Proceedings of the Korean Nuclear Society Conference
• /
• 2005.10a
• /
• pp.364-365
• /
• 2005