• Proceedings of the KSR Conference
• /
• 2010.06a
• /
• pp.1191-1202
• /
• 2010

The objective of this paper is to propose a Binary Artificial Bee Colony (BABC) to obtain the best/optimal solution for NP-hard scheduling problem of railway track maintenance. We can greatly maximize the objective value using proposed BABC within limited computation time. The proposed BABC mechanism is very efficient to find the best solution because of employing fewer control parameters.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.07a
• /
• pp.3-6
• /
• 2018

최근 방대한 양의 스트림 데이터가 생산되면서 이를 실시간으로 처리하기 위한 프레임워크가 등장하였으며, 오픈 소스 영역에서 Spark Streaming이 주목받고 있다. Spark Streaming은 분산 환경에서 성능 향상을 위해 지연 스케줄링을 기반으로 응용을 수행하지만, 장애 발생 시 사용 가능한 태스크 슬롯을 빠르게 할당받지 못할 경우 장애 복구 시간이 지연될 수 있다는 문제점이 있다. 이러한 문제점을 해결하기 위해 본 논문에서는 실행자의 태스크 슬롯 보장을 통해 대기 시간 없이 즉시 할당할 수 있도록 하는 개선 메커니즘을 제안하였고, 실험 결과 장애 복구 응답성이 39.14% 개선됨을 확인하였다.

• Proceedings of the KIEE Conference
• /
• 2004.05a
• /
• pp.71-73
• /
• 2004

Recently many peoples served multimedia data from Internet. But characteristic of multimedia-object about that effect on weight and transport-time causes Streaming Application is restricted to high-quality-service. This research propose the Quality-of-service(QoS) supporting for Home Gateway that behaving Routing and media platform equipment, using CBQ Scheduling scheme. The QoS Supporting for Multimeda Service that using general Rouging policy is difficult because media platform locate in Home Gateway. Therefore this research propose Routing mechanism to QoS support of media platform located in Gateway using TCP based CBQ Control.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.33 no.9
• /
• pp.113-119
• /
• 2005

The methods that are used for receiving data from attached devices under real-time preemptive multi-task operating system (OS) by general processors can be categorized as polling and interrupt driven. The technical approach to these methods may be different due to the application specific scheduling policy of the OS and the programming architecture of the flight software. It is one of the most important requirements on the development of the flight software to process the data received from satellite subsystems or components with the exact timeliness and accuracy. This paper presents the analysis of the I/O method of device related scheduling mechanism and the reliable data I/O methods between processor and devices.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.565-567
• /
• 2004

배터리를 효율적으로 사용하기 위한 기존 연구에서 제한된 용량의 배터리를 최대한 연장하여 사용하는 방법들에 관하여 다루었다. 본 논문에서는 시스템을 사용하는 정해진 시간동안 배터리가 소진되지 않도록, 시스템에서 동작하는 작업량을 동적으로 조절하는 방법을 제시한다. 제시된 방법에서는 시스템에서 동작하는 작업들을 중요성에 따라 분류하고, 시스템을 연동시키는 배터리 잔량을 주기적으로 측정한다. 그리고 측정된 배터리 잔량이 충분하면 모든 작업들을 동작시키고 배터리 잔량이 부족하면 중요성이 떨어지는 작업들부터 동작을 정지시켜서 전체 작업량을 감소시키고, 이를 통하여 배터리 지속 시간을 점진적으로 연장시키는 방법이다

• The KIPS Transactions:PartA
• /
• v.14A no.2
• /
• pp.99-106
• /
• 2007

Grid computing, a mechanism which uses heterogeneous systems that are geographically distributed, draws attention as a new paradigm for the next generation operation of parallel and distributed computing. The importance of grid computing concerning communication cost is very huge because grid computing furnishes uses with integrated virtual computing service, in which a number of computer systems are connected by a high-speed network. Therefore, to reduce the execution time, the scheduling algorithm in grid environment should take communication cost into consideration as well as computing ability of resources. However, most scheduling algorithms have not only ignored the communication cost by assuming that all tasks were dealt in one cluster, but also did not consider the overhead of communication cost when the tasks were processed in a number of clusters. In this paper, the functions of original scheduling algorithms are analyzed. More importantly, the functions of algorithms are compared and analyzed with consideration of communication cost within the co allocation environment, in which a task is performed separately in many clusters.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.6
• /
• pp.1892-1912
• /
• 2022

With the massive demand and growth of cloud computing, virtualization plays an important role in providing services to end-users efficiently. However, with the increase in services over Cloud Computing, it is becoming more challenging to manage and run multiple Virtual Machines (VMs) in Cloud Computing because of excessive power consumption. It is thus important to overcome these challenges by adopting an efficient technique to manage and monitor the status of VMs in a cloud environment. Reduction of power/energy consumption can be done by managing VMs more effectively in the datacenters of the cloud environment by switching between the active and inactive states of a VM. As a result, energy consumption reduces carbon emissions, leading to green cloud computing. The proposed Efficient Dynamic VM Scheduling approach minimizes Service Level Agreement (SLA) violations and manages VM migration by lowering the energy consumption effectively along with the balanced load. In the proposed work, VM Scheduling for Efficient Dynamically Migrated VM (VMS-EDMVM) approach first detects the over-utilized host using the Modified Weighted Linear Regression (MWLR) algorithm and along with the dynamic utilization model for an underutilized host. Maximum Power Reduction and Reduced Time (MPRRT) approach has been developed for the VM selection followed by a two-phase Best-Fit CPU, BW (BFCB) VM Scheduling mechanism which is simulated in CloudSim based on the adaptive utilization threshold base. The proposed work achieved a Power consumption of 108.45 kWh, and the total SLA violation was 0.1%. The VM migration count was reduced to 2,202 times, revealing better performance as compared to other methods mentioned in this paper.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.7
• /
• pp.2815-2839
• /
• 2020

In a cloud computing paradigm, allocation of various virtualized ICT resources is a complex problem due to the presence of heterogeneous application (MapReduce, content delivery and networks web applications) workloads having contentious allocation requirements in terms of ICT resource capacities (resource utilization, execution time, response time, etc.). This task of resource allocation becomes more challenging due to finite available resources and increasing consumer demands. Therefore, many unique models and techniques have been proposed to allocate resources efficiently. However, there is no published research available in this domain that clearly address this research problem and provides research taxonomy for classification of resource allocation techniques including strategic, target resources, optimization, scheduling and power. Hence, the main aim of this paper is to identify open challenges faced by the cloud service provider related to allocation of resource such as servers, storage and networks in cloud computing. More than 70 articles, between year 2007 and 2020, related to resource allocation in cloud computing have been shortlisted through a structured mechanism and are reviewed under clearly defined objectives. Lastly, the evolution of research in resource allocation techniques has also been discussed along with salient future directions in this area.

• Journal of the Korea Computer Industry Society
• /
• v.7 no.3
• /
• pp.217-226
• /
• 2006

Intensive studies have been made in the area of N-VOD server Multimedia files in the N-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 VCR-LIKE operations and buffer, disk scheduling policy for multimedia services with management of VOD sever resources. Simulation results show that the rate of buffer usage and service time of proposed scheme are about 18% performance improved than that of traditional methods. This implies that our method can allow much more users for given resources.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.10
• /
• pp.19-28
• /
• 2022

In this paper, we propose the Detector Scheduler which determines the best tracking-by-detection (TBD) mechanism to perform real-time high-accurate multi-object tracking (MOT). The Detector Scheduler determines whether to run a detector by measuring the dissimilarity of features between different frames. Furthermore, we propose a self-supervision method to learn the Detector Scheduler with tracking results since it is difficult to generate ground truth (GT) for learning the Detector Scheduler. Our proposed self-supervision method generates pseudo labels on whether to run a detector when the dissimilarity of the object cardinality or appearance between frames increases. To this end, we propose the Detector Scheduling Loss to learn the Detector Scheduler. As a result, our proposed method achieves real-time high-accurate multi-object tracking by boosting the overall tracking speed while keeping the tracking accuracy at most.