• Journal of the Korean Wood Science and Technology
• /
• v.21 no.2
• /
• pp.23-30
• /
• 1993

As the demand of wood furniture becomes diverse and large-sized, artificial intelligence technique is required to design the expert system which can promote the efficiency of the operations management in wood furniture industry. This study was carried out to develop the expert scheduler, which was applied to the scheduling in chair-manufacturing process to evaluate its validity. The expert scheduler could show the results of scheduling must faster than Gantt chart method with ease. Maximum tardiness in the current chair-manufacturing process could be reduced from 29 seconds to 5 seconds by the addition of a spindle sander, a 12 spindle universal boring machine, and a moulding sander to sanding, boring, and moulding process, respectively.

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

In this paper, we propose a performance isolation of shared space for virtualized SSD based storage systems, to solve the weakness in a VSSD framework. The proposed scheme adopts a CFQ scheduler and a shared space-based FTL for the fairness and the performance isolation for multiple users on virtualized SSD based storage systems. Using the CFQ scheduler, we ensure SLOs for the storage systems such as a service time, a allocated space, and a IO latency for users on the virtualized storage systems. In addition, to improve a throughput and reduce a computational latency for garbage collection, a shared space-based FTL is adopted to maintain the information of SLOs for users and it manages shared spaces among the users. In our experiments, the proposal improved the throughput of garbage collection by 7.11%, on average, and reduced the computational latency for garbage collection by 9.63% on average, compared to the previous work.

• Journal of the Semiconductor & Display Technology
• /
• v.19 no.4
• /
• pp.105-111
• /
• 2020

In most multiple input/output systems, one input affects two or more different outputs. Therefore, there are many inconveniences in using the actual system. In order to solve this problem, a controller that makes an input signal and an output correspond 1:1 is called a decoupling controller. In this paper, I try to implement a relatively simple decoupling controller using a cross-compensator, that is, a compensator that takes an uncorresponding output as an input value. And this cross-compensator has a gain scheduler structure in order to increase the performance. In addition, this system is designed with a distributed control structure using CAN communication, so that it can be manufactured and operated in an easier way when implementing an actual experimental system. The proposed structure is applied to the modified new Arago's disk system and tested, and through this, the effectiveness is confirmed and reported.

• International Journal of Computer Science & Network Security
• /
• v.22 no.4
• /
• pp.351-357
• /
• 2022

LTE (Long-Term Evolution, sometimes known as 4G LTE) is a wireless high-speed data communication technology for mobile phones and data terminals. The Packet Scheduler (PS) is an important component in improving network performance. Physical Resource Blocks (PRBs) are assigned to associated User Equipment by the packet scheduler (UEs). The primary contribution of this study is a comparison of the eNodeB throughput between a suggested method and the Round Robin (RR) Algorithm. The RR Algorithm distributes PRBs among all associated UEs without taking channel circumstances into account. In this research, we present a new scheduling method that takes into account the number of PRBs and associated UEs and produces higher throughput than the RR algorithm.

• Annual Conference of KIPS
• /
• 2024.05a
• /
• pp.2-4
• /
• 2024

한국과학기술정보연구원(이하 KISTI)의 국가슈퍼컴퓨팅센터에서는 슈퍼컴퓨터 5호기인 Nurion과 Neuron 시스템을 구축하여 국내 연구자들에게 서비스하고 있다. 이 중에서 Neuron 시스템은 GPU 클러스터 시스템으로 SLURM Batch Scheduler를 이용하여 공동활용서비스를 제공하고 있다. 본 논문에서는 Neuron에서 사용 중인 SLURM Batch Scheduler와 리눅스의 crontab 기능을 이용하여 소프트웨어 장애가 발생한 계산노드를 자동으로 복구시키는 기능을 구현하여 장애처리 대기시간을 단축시키는 기법에 대해서 소개한다.

• 한국항공운항학회:학술대회논문집
• /
• 2005.05a
• /
• pp.124-127
• /
• 2005

• Journal of Internet Computing and Services
• /
• v.6 no.6
• /
• pp.127-137
• /
• 2005

This paper presents implementation of client-based VOD service using multicast delivery, Conventional system provide server-based system in multicast delivery but implemented system provides on-demand client-based multicast system. The Multicast Agent Scheduler aggregates clients' request and it generate multicast group addresses and port numbers according to requested video items and service request time. Then it transmits immediately multicast address to VOD server and client who request service. And then VOD server transmits requested streams with a multicast group address and the client joins the group automatically. The Multicast Agent Scheduler assigns the same multicast group address when other clients request an identical video within the same scheduling duration. The proposed system can reduce load of server and support many clients at the same time and applies it to WMT(window media technology) of Microsoft.

• Journal of Positioning, Navigation, and Timing
• /
• v.5 no.4
• /
• pp.193-202
• /
• 2016

The Korea Augmentation Satellite System (KASS), which is under development in Korea as a Satellite Based Augmentation System (SBAS) is expected to broadcast SBAS messages to air space in Korea according to the international standards defined by the International Civil Aviation Organization (ICAO) and the Radio Technical Commission for Aeronautics (RTCA). Around 13 SBAS messages are broadcast in every second to transmit augmentation information which can be applicable to a wide area in common. Each of the messages requires a different update interval and time-out according to the characteristics, purpose, and importance of transmitted information, and users should receive and combine multiple SBAS messages to calculate SBAS augmented information. Thus, a time to take acquiring first SBAS position by users differs depending on broadcasting various SBAS messages with which order and intervals. The present paper analyzes the considerations on message scheduling for broadcasting of KASS augmentation information and proposes a design of KASS message scheduler using the considerations. Compared to existing SBAS systems, which have a wide range of service area, a service area of the KASS is limited to Korea only. Thus, the numbers of ionosphere grid points and satellites to be augmented are expected to be smaller than those of existing SBAS. By reflecting this characteristic to the proposed design, shortening of broadcast interval of KASS message is verified compared to existing SBAS and a measure to increase a speed of acquisition of user navigation solution is proposed utilizing remaining message slots. The simulation result according to the proposed measure showed that the maximum broadcast interval can be reduced by up to 20% compared to that of existing SBAS, and users can acquire KASS position solution faster than existing SBAS.

• KIISE Transactions on Computing Practices
• /
• v.24 no.1
• /
• pp.10-16
• /
• 2018

The task of consolidating server workloads is critical for the efficiency of a datacenter in terms of reducing costs. However, as a greater number of workloads are consolidated in a single server, the performance of workloads might be degraded due to their contention to the limited shared resources. To reduce the performance degradation, scheduling for mitigating the contention of shared resources is necessary. In this paper, we present the Dynamic Voltage Frequency Scaling (DVFS) based memory-contention aware scheduling method for multi-threaded workloads. The proposed method uses two approaches: running memory-intensive threads on the limited cores to avoid concurrent memory accesses, and reducing the frequencies of the cores that run memory-intensive threads. With the proposed algorithm, we increased performance by 43% and reduced power consumption by 38% compared to the Completely Fair Scheduler(CFS), the default scheduler of Linux.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.06a
• /
• pp.166-168
• /
• 2014

Coarse-grained reconfigurable architectures (CGRAs) present a potential of high compute throughput with energy efficiency. A CGRA consists of an array of functional units (FU), which communicate with each other through an interconnect network containing transmission nodes and register files. To achieve high performance from the software solutions mapped onto CGRAs, modulo scheduling of loops is generally employed. One of the key challenges in modulo scheduling for CGRAs is to explicitly handle routings of operands from a source to a destination operations through various routing resources. Existing modulo schedulers for CGRAs are slow because finding a valid routing is generally a searching problem over a large space, even with the guidance of well-defined cost metrics. Applications in traditional embedded multimedia domains are regarded relatively tolerant to a slow compile time in exchange of a high quality solution. However, many rapidly growing domains of applications, such as 3D graphics, require a fast compilation. Entrances of CGRAs to these domains have been blocked mainly due to its long compile time. We attack this problem by utilizing patternized routes, for which resources and time slots for a success can be estimated in advance when a source operation is placed. By conservatively reserving predefined resources at predefined time slots, future routings originated from the source operation are guaranteed. Experiments on a real-world 3D graphics benchmark suite show that our scheduler improves the compile time up to 6000 times while achieving average 70% throughputs of the state-of-art CGRA modulo scheduler, edge-centric modulo scheduler (EMS).