• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.43 no.4
• /
• pp.23-32
• /
• 2020

Many small and medium-sized manufacturing companies process various product types to respond different customer orders in a single production line. To improve their productivity, they often apply batch processing while considering various product types, constraints on batch sizes and setups, and due date of each order. This study introduces a batch scheduling heuristic for a production line with multiple product types and different due dates of each order. As the process times vary due to the different batch sizes and product types, a recursive equation is developed based on a flow line model to obtain the upper bound on the completion times with less computational complexity than full computation. The batch scheduling algorithm combines and schedules the orders with same product types into a batch to improve productivity, but within the constraints to match the due dates of the orders. The algorithm incorporates simple and intuitive principles for the purpose of being applied to small and medium companies. To test the algorithm, two case studies are introduced; a high pressure coolant (HPC) manufacturing line and a press process at a plate-type heat exchanger manufacturer. From the case studies, the developed algorithm provides significant improvements in setup frequency and thus convenience of workers and productivity, without violating due dates of each order.

• The Journal of Korean Institute of Next Generation Computing
• /
• v.14 no.5
• /
• pp.40-52
• /
• 2018

Solid state drive (SSD) cache technologies that are used as a second-tier cache between the main memory and hard disk drive (HDD) have been widely studied. The SSD cache requires a new prefetching scheme as well as cache replacement algorithms. This paper presents a prefetching scheme for a storage-class cache using SSD. This prefetching scheme is designed for the storage-class cache and based on a long-term scheduling in contrast to the short-term prefetching in the main memory. Traditional prefetching algorithms just consider only read, but the presented prefetching scheme considers both read and write. An experimental evaluation shows 2.3% to 17.8% of hit rate with a 64GB of SSD and the 4GiB of prefetching size using an I/O trace of 14 days. The proposed prefetching scheme showed significant improvement of cache hit rate and can be easily implemented in storage-class cache systems.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.4
• /
• pp.32-42
• /
• 2021

The printing process can have to print various colors with a limited capacity of printing facility such as ink containers that are needed cleaning to change color. In each container, cleaning time exists to assign corresponding inks, and it is considered as the setup cost required to reduce the increasing productivity. The existing manual method, which is based on the worker's experience or intuition, is difficult to respond to the diversification of color requirements, mathematical modeling and algorithms are suggested for efficient scheduling. In this study, we propose a new type of scheduling problem for the printing process. First, we suggest a mathematical model that optimizes the color assignment and scheduling. Although the suggested model guarantees global optimality, it needs a lot of computational time to solve. Thus, we decompose the original problem into sequencing orders and allocating ink problems. An approximate function is used to compute the job scheduling, and local search heuristic based on 2-opt algorithm is suggested for reducing computational time. In order to verify the effectiveness of our method, we compared the algorithms' performance. The results show that the suggested decomposition structure can find acceptable solutions within a reasonable time. Also, we present schematized results for field application.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.9
• /
• pp.1405-1411
• /
• 2022

Power management is still an important issue in embedded environments as hardware advances like high-performance processors. Power management methods such as DVFS control CPU frequencies in an adaptive manner for efficient power management in polling-based I/O programs such as network communication. This paper presents the problems of the existing power management method and proposes a new power management method. Through this, it is possible to reduce electric consumption by increasing the polling cycle in situations where the frequency of data reception is low, and on the contrary, in situations where data reception is frequent, it can operate at the maximum frequency without performance degradation. After implementing this as a code layer on the embedded board and observing it through Atmel's Power Debugger, the proposed method showed a performance improvement of up to 30% in energy consumption compared to the existing power management method.

• Journal of IKEEE
• /
• v.17 no.4
• /
• pp.550-558
• /
• 2013

In this paper, we propose an efficient hybrid lighting management system implementation on multiple protocol. The proposed hybrid lighting management system was implemented by configured as the data display part for management and control of lighting device and the data conversion-processing part the communication part of gateway. The data were designed the DB to enable to storage in real-time, and implemented able to manage by real time wireless remote control and schedule setting. The proposed an efficient hybrid lighting management system, it was possible the real-time monitoring and remote lighting control by peristalsis with smart devices and portable PC etc., and it could be obtained reduction effect of energy and electricity, communication cost.

• The Journal of the Korea Contents Association
• /
• v.18 no.9
• /
• pp.125-140
• /
• 2018

Due to rapid development of semiconductor technology, embedded systems have been developed from single-functional system to the multi-functional system. The system composed of software that has different criticality level is called Mixed-Criticality System. Currently, the project related to the Mixed-Criticality System is accelerating the efforts to seek the development direction and take technical initiatives led by EU and USA where the related industry has developed, but the movement in Korea is yet insignificant. Therefore, it is urgent to perform the research and project of various basic technologies to occupy the initiative for the related technology and market. In this paper, we analyze the trends of major project researches and developments related to the MCS. First, after defining the definition of the MCS and system model, we analyze the underlying technology constituting the MCS. In addition, we analyze the project trends of each country researching MCS and discuss the future research areas. Through this study, it is possible to grasp the research trends of the world in order to establish the research direction of the MCS and to lay the foundation for the integration into the military system.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.38 no.12
• /
• pp.58-66
• /
• 2001

Input queueing is useful for high bandwidth switches and routers because of lower complexity and fewer circuits than output queueing. The input queueing switch, however, suffers HOL-Blocking, which limits the throughput to 58%. To get around this low throughput, many input queueing switches have centralized scheduler, which centralized scheduler restrict the design of the switch architecture. To overcome this problem, we propose a simple scheduler called PRR(Pipelined Round Robin), which is intrinsically distributed and presents to show the effectiveness of the proposed scheduling.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.5_6
• /
• pp.268-278
• /
• 2004

In this paper, we describe our experience in the design and implementation of the SMART file system to handle multimedia workload. Our work has three design objectives: (ⅰ) efficient support for sequential workload, (ⅱ) avoiding disk fragmentation, (ⅲ) logical unit based file access. To achieve these three objectives, we develop a file system where a file consists of linked list of Data Unit Group. Instead of tree like structure of the legacy Unix file system, we use single level file structure. Our file system can also access the file based upon the logical unit which can be video frame or audio samples. Data Unit Group is a group of logical data units which is allocated continuous disk blocks. At the beginning of each Data Unit Group, there exists an index array. Each index points to the beginning of logical data units, e.g. frames in the Data Unit Group. This index array enables the random access and sequencial access of semantic data units. SMART file system is elaborately tailored to effectively support multimedia workload. We perform physical experiments and compare the performance of SMART file system with EXT2 file system and SGI XFS file system. In this experiment, SMART file system exhibits superior performance under streaming workload.

• The KIPS Transactions:PartA
• /
• v.14A no.6
• /
• pp.371-382
• /
• 2007

Modern server systems are usually composed in the form of cluster systems in order to serve not only as many users but also as many kinds of applications as possible. The progression of the cluster system architecture leads in a middleware approach based on the Java framework. The middleware approach alleviates the efforts for the construction and the management of a server system but still preserves its performance and applications on the server. In this research, we introduce a new clustering scheme for the easy construction and maintenance of a cluster server system with the Java Management Extensions. We first demonstrate the construction and configuration process. Our experiment sets can verify that it is easy to construct, expand and manage a middleware based cluster system as well as the applications which reside on it. In addition, we can achieve reasonable performance on our service oriented clustered system with the help of state-of-the-art middleware. The experimental results of performance demonstration contain the availability of a server, and the effectiveness of load balancing and scheduling mechanisms. Especially, our service oriented scheduling mechanism was shown to successfully manage load imbalance under the normal load and cope with the overloaded situations, compared with other known scheduling mechanisms.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2004.05b
• /
• pp.1316-1320
• /
• 2004

생활수준의 향상과 기술발전에 따라 상수도 관망시스템에 관할 관점 또한 기존의 설계 및 해석의 개념에서 안정적이고 효율적인 용수공급 운영의 측면으로 변화하고 있다. 본 연구에 서는 상수도 시스템을 효율적으로 운영하기 위한 방법을 관망운영의 측면에서 모색하였으며, 수도권 광역상수도를 대상으로 하여 시범 적용하였다. 본 연구는 현재 시점에서 안정적인 용수공급이 가능한 가능최소 에너지 비용을 구하는 것이 목적이다 용수수요량의 변화 등 운영여건이 바뀌게 되면, 수리적 안정성이 확보되는 범위내에서 가능한 최적의 펌프운영패턴을 도출하였다. 현재 용수공급량 변동시 또는 연계운영 방법의 변경시와 같은 운영여건 변동에 따른 경제적운영 방안 등에 대한 연구가 미비하여 가장 최적의 운영방안 도출이 어려운 실정이므로, 본 연구를 통하여 연계운영에 최적화 기법의 적용 및 운영방안의 도출을 수행하였다. 운영여건의 변경시 펌프장 등에서의 전력원단위 변화 등 각 단계별 수도시설의 종합적 고려를 통한 경제적 운영방안을 검토할 수 있는 상수관망 최적운영모형의 실제 탑재 모델을 개발하였으며, 이를 기반으로 하여 실제 현장에서 담당자가 쉽게 사용할 수 있는 사용자 편의 환경을 개발하였다.