• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10a
• /
• pp.603-607
• /
• 1988

On this paper, the application of Eiganstructure assignment to flight control system design is presents. Both output feedback and constrained output feedback are considered. The computer implimentation of the algorithm is discussed including the utilization of real arithmetic for complex conjugate eigenvalue. And the example include a stability augementation system, an autopilot decoupled mode control.

• Journal of The Korean Association of Information Education
• /
• v.18 no.1
• /
• pp.195-202
• /
• 2014

Computer education in Korea needs to be modified from IT utilization to principle-oriented form of computer science education. In this study the achievement, teaching-learning methods, and evaluation methods in the computer system education area of computer science education are suggested on the elementary and middle schools in Korea. For these purpose the curriculums of computer science in United Kingdom and United States are analyzed.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1305-1317
• /
• 1999

NUMA 구조는 원격 메모리에 대한 접근이 불가피한 구조적 특성 때문에 상호 연결망이 성능을 좌우하는 큰 변수가 된다. 기존에 대중적으로 사용되던 버스는 물리적 확장성 및 대역폭에서 대규모 시스템을 구성하는 데 한계를 보인다. 이를 대체하는 고속의 지점간 링크를 사용한 링 구조는 버스가 가지는 확장성 및 대역폭의 한계라는 단점을 개선하였으나, 많은 클러스터가 연결되는 경우에는 전송 지연시간이 증가하는 문제점을 가지고 있다. 본 논문에서는 스누핑 프로토콜이 적용된 링 구조에서 클러스터 개수 증가에 따른 지연시간 증가의 문제점을 보완하기 위해 계층적 링 구조로의 확장을 제안하고, 이 구조에 효과적인 캐쉬 일관성 프로토콜을 설계하였다. 전역 링과 지역 링을 연결하는 브리지는 캐쉬 프로토콜을 관리하며 이 프로토콜에 의해 지역 링의 부하를 줄일 수 있도록 트랜잭션을 필터링하는 역할도 담당함으로써 시스템의 성능을 향상시킨다. probability-driven 시뮬레이터를 통해 계층적 링 구조가 시스템의 성능 및 링 이용률에 미치는 영향을 알아본다. Abstract Since NUMA architecture has to access remote memory, interconnection network performance determines performance of NUMA architecture. Bus, which has been used as popular interconnection network of NUMA, has a limit to build a large-scale system because of limited physical scalability and bandwidth. Ring interconnection network, composed of high-speed point-to-point link, made up for bus's defects of scalability and bandwidth. But, it also has problem of increasing delay as the number of clusters is increased. In this paper, we propose a hierarchical expansion of snoop-based ring architecture in order to overcome ring's defects of increasing delay. And we also design an efficient cache coherence protocol adopted to this architecture. Bridge, which connects local ring and global ring, maintains cache coherence protocol and does snoop-filtering which reduces local ring and cluster bus utilization. Therefore bridge can improve performance of this system. We analyze effects of hierarchical architecture on the performance of system and utilization of point-to-point links using probability-driven simulator.

• Journal of Digital Contents Society
• /
• v.18 no.2
• /
• pp.411-422
• /
• 2017

Current policies for sharing bandwidth increase average throughput and improve utilization of the bandwidth in the local network. However, with these policies, a central administer, which is responsible for allocating bandwidth to each network flow, cannot allocate resources based on user characteristics. Thus, it leads to unfair bandwidth allocation because it does not guarantee services based on user characteristics. Therefore, we propose a novel negotiation method to share the bandwidth in a limited bandwidth network, in which, a user negotiates with other users to gain more resource. Ideally, we use a fuzzy system to infer and determine whether a device will request bandwidth or not based on the current usage of the given device. We conduct two experiments consisting of a video streaming simulation in OPNET and a real-time video streaming in WebRTC. The results of the experiment indicate that the proposed method can flexibly share the bandwidth utilization based on user's requirement in the network.

• International Journal of Computer Science & Network Security
• /
• v.21 no.1
• /
• pp.19-26
• /
• 2021

CPU is considered the main and most important resource in the computer system. The CPU scheduling is defined as a procedure that determines which process will enter the CPU to be executed, and another process will be waiting for its turn to be performed. CPU management scheduling algorithms are the major service in the operating systems that fulfill the maximum utilization of the CPU. This article aims to review the studies on the CPU scheduling algorithms towards comparing which is the best algorithm. After we conducted a review of the Round Robin, Shortest Job First, First Come First Served, and Priority algorithms, we found that several researchers have suggested various ways to improve CPU optimization criteria through different algorithms to improve the waiting time, response time, and turnaround time but there is no algorithm is better in all criteria.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1338-1341
• /
• 2004

In this paper, we have proposed a new approach of routing and wavelength assignment algorithms, called Possible Available Wavelength (PAW) algorithm. The weight of a link is used as the main factor for routing decision in PAW algorithm. The weight of a link is defined as a function of hop count and available wavelengths. This function includes a determination factor of the number of wavelengths that are being used currently and are supposed to be available after a certain time. The session requests from users will be routed on the links that has the greatest number of link weight by using Dijkstra's shortest path algorithm. This means that the selected lightpath will has the least hop count and the greatest number of possible available wavelengths. The impact of proposed link weight computing function on the blocking probability and link utilization is investigated by means of computer simulation and comparing with the traditional mechanism. The results show that the proposed PAW algorithm can achieve the better performance in terms of the blocking probability and link utilization.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1492-1509
• /
• 2017

The wireless sensor network (WSN) is a key technology to support the Internet of things (IoT) paradigm. The efficiency of the MAC protocol in WSN is very important to take scalability with restricted wireless resources. The DESYNC-TDMA has an advantage of simple distributed slot allocation inspired by nature, but there is a critical disadvantage of split slots by firing message. The basic split slot model has less efficiency for continuous packet transmitting because of wasting of the slots less than the packet size. In this paper, we propose a firing offset adjustment scheme to improve the efficiency of slot utilizations, which can manage the slot assigned to each node as a single large block, called the single slot model. The performance analysis models for both the existing and the proposed schemes are also derived. Experimental results show that the proposed method provide better efficiency of slot utilization than the existing schemes without any loss of the nature of the desynchronization.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2204-2218
• /
• 2000

This paper proposes a dynamic storage allocation algorithm, QHF(quick-half-fit) for real-time systems. The proposed algorithm manages a free block list per each worked size for memory requests of small size, and a free block list per each power of 2 size for memory requests of large size. This algorithms uses the exact-fit policy for small sie requests and provides high memory utilization. The proposed algorithm also has the time complexity O(I) and enables us to easily estimate the worst case execution time (WCET). In order to confirm efficiency of the proposed algorithm, we compare he memory utilization of proposed algorithm with that of half-fit and binary buddy system that have also time complexity O(I). The simulation result shows that the proposed algorithm guarantees the constant WCET regardless of the system memory size and provides lower fragmentation ratio and allocation failure ratio thant other two algorithms.

• Journal of the Korea Computer Industry Society
• /
• v.9 no.5
• /
• pp.207-216
• /
• 2008

Statistical analysis menus of MS Excel software, with powerful spreadsheet functions has not been modified since Excel 2000 Edition and its utilization is very low. To improve utilization of Excel menu for statistical analysis, this research compared outputs of Excel statistical menus and computed test statistics, and developed high-level macros. Outputs of Excel menus, both oneway layout and twoway layout, on real data are exactly same as the computed test statistics, and therefore, Excel menus for statistical analysis are reliable. Macros to provide results for Analysis of Variance with a block and multiple comparison of means are developed using Excel functions.

• The Journal of Korean Association of Computer Education
• /
• v.18 no.6
• /
• pp.63-69
• /
• 2015

The Interaction is an important factor in classroom. Existing interaction analysis method has been analysed between teacher and students only language-centered. In this paper, we developed an ICT based interaction analysis system to analyse interaction of ICT including language-centered and analysed interaction of class through FIACS and ICT-FIACS. This system consists of ten kinds of classification items and analysis indexes. In order to comparative analyse between ICT-FIACS and FIACS, we analysed interaction of ICT in six grade classroom at elementary school. In result of analysis, ICT utilization index (63.62%), teachers of ICT utilization index (57.71%) and students of ICT utilization (42.29%) were analysed. Through this system, interaction of ICT can be analysed as well as language-centered interaction in ICT based Classroom.