• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.113-115
• /
• 1998

다중프로세서 환경에서 타스크들을 할당해주는 중앙 프로세서를 두고 Laxity를 기반으로 긴급타스크를 선택하여 스케쥴링을 수행한다. 중앙프로세서는 프로세서들의 슬랙시간과 각 프로세서의 Local큐에 대기하고 있는 비주기적 타스크의 총 수행시간 등의 상태정보를 수집 분석하여, 타스크의 실행시간에 가장 적합한 프로세서를 선xor하여 할당한다. 또한 타스크 특성에 따라 주기적 타스크와 비주기적 타스크로 나누고 주지적 타스크는 마감시간을 지키는 범위 내에서 최대한 수행시간을 연기 시켰다. 시뮬레이션 결과 Overload(마감시간을 지키지 못하는 타스크)수의 감소와 빠른 응답시간을 제공함을 알 수 있었다.

• IE interfaces
• /
• v.15 no.1
• /
• pp.99-106
• /
• 2002

A recently developed alternative to traditional production planning and control systems such as material requirement planning(MRP) and just-in-time(JIT) is the drum-buffer-rope(DBR). The DBR now being implemented in growing number of manufacturing organizations enables better scheduling and decision making on the shop floor. In implementing the DBR, however, an information system is usually needed to transmit the signal that runs from the constraint to material release. In this paper we propose a different mechanism to transmit the signal in the case that the demand of product is stable, which uses the well-known Kanban system. To improve the reality, this paper shows and example of the Kanban format, its operation, and calculation of the number of Kanbans.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1991.10a
• /
• pp.77-89
• /
• 1991

One of the important problems concerning the efficient operation of an automated manufacturing system is the flow control problem. Most research papers about scheduling and control of a FMS consider fabrication, machining and assembly independently. In this paper an effective flow control strategy for a FMS with an assembly subsystem which may be called FMAS (Flexible Machining and Assembly System) is designed using the operation-oriented and, combined Push and Pull control method. The flow control system to be described here could meet production demands with a minimum makespan while satisfying assigned due-dates and keeping a low volume of work-in-process at the same time. The control mechanism also considers machine failures and rush jobs.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.7
• /
• pp.124-129
• /
• 2004

Recently, the demand for the optical cable is rapidly growing because the number of internee user increases and high speed internet data transmission is required. But the present optical cable winding systems has some serious problems such as pile-up and collapse of cable usually near the flange of the bobbin in the process of the cable winding. To reduce the pile-up collapse in a cable winding systems, a new guiding system is developed for a high-speed self-align cable winding. First of all, the winding mechanism was analyzed and synchronization logics for the motions of winding, traversing, and the guiding were created. A prototype cable winding systems was manufactured to validate the new guiding system and the suggested logic. Experiment results showed that the winding system with the developed guiding system outperformed the system without the guiding system in reducing pile-up and collapse in the high-speed winding.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.693-694
• /
• 2014

This paper proposes a new pipelined dynamic bandwidth allocation algorithm for XG-PON (10-Gbps-capable passive optical network) passive optical networks) system. The pipelined algorithm is used when a dynamic bandwidth allocation algorithm cannot finished in an unit time. In the proposed mechanism, the request is immediately transferred to each pipeline block to improve performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2434-2454
• /
• 2021

This paper developed the software testing factory-cloud testing platform (STF-CTP) to address the software compatible issues in various smart devices. Software developers who only require uploading the application under test (AUT) and test script can test plenty of smart devices in STF-CTP. The challenge for the cloud test platform is how to optimize the resource and increase the performance in the limited resource. This paper proposed a new scheduling mechanism and a new process of the system operation which is based on the OpenStack platform. We decrease about 40% memory usage of OpenStack server, increase 3% to 10% Android device usage of STF-CTP, enhance about 80% test job throughput and reduces about 40% test job average waiting time.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.7 no.5
• /
• pp.8-13
• /
• 1997

In multi-server environment there are many servers which are able to process job requests. So we bave to design a mechanism that selects appropriate servers for processing each job request while maximizing server throughput and minimizing average response time of requests. Conventional methods ac~ opt the load of each server as criteria of server selection. that is, they select a server whose load is not bigger than the others. In this work we propose an approach that uses the degree of server performance, server load and the estimated service time of requested job as guidelines of server selection. We incorporate fuzzification techniques and expert knowledge in this approach. Comparing the performances c~f our approach to that of conventional one, experiments show that the proposed approach provides better performances.

• Journal of Communications and Networks
• /
• v.15 no.2
• /
• pp.228-239
• /
• 2013

Peer-to-peer (P2P) systems have proved the most effective and popular file sharing applications in recent years. Previous studies mainly focused on equal service and differentiated service strategies when peers have no initial data before their downloads. For an upload-constrained P2P file sharing system, we model both the equal service process and the differentiated service process when the initial data distribution of peers satisfies some special conditions. Moreover, we show how to minimize the time required to distribute the file to any number of peers. The proposed fluid-based models can reveal the intrinsic relations among the initial data amount, the peer set size, and the minimum last finish time. The closed-form expressions derived from the extended models can closely approximate chunk-based models and systems, especially for relatively large files. As an application of the extended models, we show how to provide differentiated service efficiently to multiple peer sets. Since no limits are imposed on the upload bandwidth of peers or the size of each peer set, we believe that our analytic process and the results achieved can provide not only fundamental insights into bandwidth allocation and data scheduling but also a helpful reference for both improving system performance and building an effective incentive mechanism for P2P file sharing systems.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.3
• /
• pp.379-390
• /
• 2005

Intensive studies have been made in the area of VOD server Multimedia files in the VOD sever are characterized with the large volume of data, the requirements of synchronization and real-time playback of streams. The basic goal of the study is to find an efficient mechanism to allow maximum number of users under the limited resources such as Buffer size and disk bandwidth. we propose a efficient $pre\_fetching$ policy for multimedia services with dynamic monitoring and management of VOD sever resources. Simulation results show that the rate of buffer usage and service time of proposed scheme are about $28\%$ performance improved than that of traditional methods. This implies that our method can allow much more users for given resources.

• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.1
• /
• pp.78-89
• /
• 2006

In development of network-enabled consumer electronics, much of the time and effort is spent analyzing and solving network performance problems. In this paper, we define an instance of such problems discovered while developing a commercial home network gateway. We then analyze its cause and propose a solution mechanism. Our home network gateway uses art asymmetric link (ADSL) and suffers from an undesirable phenomenon where downlink traffic interferes with upload speed. We call this phenomenon the network performance interference problem. While this problem can easily be confused with receive livelock caused by packet contention at the input queue, we and that this is not the case. By performing extensive experiments and analysis, we reveal that our problem is caused by packet contention at the output queue and certain intrinsic characteristics of TCP. We devise an ACK-separation queuing mechanism for this problem and implement it in the home network gateway Our experiments show that it effectively solves the problem.