• Proceedings of the KIEE Conference
• /
• 2011.07a
• /
• pp.592-593
• /
• 2011

수요 반응 프로그램은 크게 인센티브 기반 수요 반응 프로그램과 가격 기반 수요 반응 프로그램으로 나눌 수 있다. 인센티브 기반 수요 반응 프로그램은 용량 요금 형태의 보상금을 지급하고 전력 시스템의 안정적 운영을 위해 긴급 상황 시, 이벤트를 통해 호출 됨으로써 중요성이 더욱 부각되고 있다. 신뢰도 수요 반응 자원들은 운영주체와의 사전 계약 시, 자신의 월 또는 연간 사용 한도를 정하고 계약을 하게 된다. 이는 빈번한 수요 자원 호출로 인해 수요 자원 보유자가 효과적으로 반응하지 못하게 됨을 방지하기 위함이다. 본 논문에서는 이러한 수요자원의 최대 사용 횟수를 고려하여 신뢰도 수요 반응 프로그램의 스케줄링 방법을 제안하였다. 본 스케줄링 방법은 각 이벤트별 필요 수요 자원량과 각 수요 자원들의 비용을 고려하여 특정 기간동안의 계획을 수립하는 것으로써, 현재 널리 이용되는 단기 스케줄링과 비교하였을 때, 운영주체의 비용을 절감할 수 있게 된다.

• The KIPS Transactions:PartC
• /
• v.16C no.2
• /
• pp.217-222
• /
• 2009

This paper proposes the number of Optical Network Unit (ONU) based priority scheduling mechanism over Ethernet Passive Optical Network (EPON) to support multicast Quality of Service (QoS) for Internet Protocol Television (IPTV) service. Multicast QoS is effected by the receivers' number of a packet because multicast efficiency is determined by how many receivers are received multiple copied packets. Therefore, the proposed mechanism assigns a priority with the number of ONUs to allocate high priority to IPTV services used by many people and firstly transmits a packet with high priority. By doing so, we show that the proposed mechanism support favorite IPTV services with better and stable QoS in spite of congestion.

• Journal of Broadcast Engineering
• /
• v.28 no.1
• /
• pp.141-144
• /
• 2023

Recently, a joint channel estimation, channel quantization, feedback, and precoding system based on deep-neural network (DNN) was proposed. The corresponding system achieved a joint optimization based on deep learning such that it achieved a higher sum rate than the existing codebook-based precoding systems. However, this DNN-based procoding system is not directly applicable for the environments with many users such that a specific user selection can potentially increase the sum rate of the system. Thus, in this letter, we study an appropriate user selection method suitable for DNN-based precoding.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.2
• /
• pp.227-233
• /
• 2004

Complex scheduling problems are related to planning, scheduling, constraint satisfaction problems, object-oriented concepts, and agent systems. Human preference-driven scheduling technique was to solve complex scheduling problems using constraint satisfaction problems and object-oriented concepts. We have tried to apply human preference-driven scheduling technique to reservation problems. For customer's satisfaction, we have considered customer's preferences in the reservation scheduling. The technique of reservation scheduling proposed in this thesis is based on object-oriented concepts. 1'o consider the over all satisfaction, the events of every object are alloted to the board along its priority. Constraints to reservation scheduling are classified to global and local. The definition of board and information of every event are global constraints and the preferences to object's board slots are local constraints. We have applied look-ahead technology to reservation scheduling in order to minimize backtracking not to fail the allotment of events.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.391-393
• /
• 2000

컴포넌트 기반 개발은 재사용성의 극대화로 개발시간의 단축과 비용 감소 등의 장점을 제공하고 있다. 특히, 기업의 빈번한 요구사항의 변경과 빠르게 진행되는 비즈니스 영역에 대해서 유연하게 대처하기 위해 많이 적용되고 있다. 본 논문에서는 현재 교육에 새로운 파라다임으로 주목받고 있는 자택수업 도메인에서 학부모와 관리하는 교사간의 정형화된 예약이 가능한 시스템에 컴포넌트 기반 개발을 적용해 보았다. 웹 상에서 학부모에게 교육적인 지원과 학생의 학습과정을 체크하기 위해 일정한 스케줄에 따라 교사의 스케줄을 확인하고 가능한 시간대에 협의할 수 있도록 도와준다. 이러한, 개발은 자택 교육뿐만 아니라, 이와 유사한 예약 시스템의 개발에 사용가능하며, 개발에 대한 부담을 줄일 수 있다. 또한, 웹을 기반으로 하는 구현에도 폭넓게 재사용될 수 있으며, 구현에 대한 가이드라인으로 제시될 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.202-204
• /
• 2003

경성 실시간 시스템(Hard Real-Time System)어서는 주기 태스크들의 엄격한 마감시간(Deadline) 보장이 시스템의 성능을 좌우한다. 본 논문에서는 CPU의 이용률(Utilization)이 높아 비율단조 정책으로는 마감시간을 보장 할 수 없는 주기 태스크들을 위해 확장된 스케줄 가능성 검사를 통해 수행할 태스크들의 공통 주기(L.C.M : Least Common Multiple)내에서 EDF(Earliest-Deadline First) 정책을 기반으로 마감시간 보장 수행패턴(Feasible Pattern)을 찾고, 이를 참조하여 우선순위를 고려하지 않고 태스크들을 강제 수행할 수 있게 하는 비율단조 기반의 스케쥴링 기법을 제안한다. EDF를 기반으로 생성된 패턴은 EDF 정책의 특성에 따라 CPU의 이용률을 100% 까지 가능하게 하며 패턴을 참조하여 강제 수행함으로써 EDF 정책이 갖는 실행시간 스케쥴링 오버헤드를 없앨 수 있다.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.23 no.2
• /
• pp.196-206
• /
• 2012

AESA radar is able to instantaneously and adaptively position and control the beam, and such adaptive beam pointing of AESA radar enables to remarkably improve the multi-mission capability, compared with mechanically scanned array radar. AESA radar brings a new challenges, radar resource management(RRM), which is a technique efficiently allocating finite resources, such as energy and time to each task in an optimal and intelligent way. Especially radar beam scheduling is the most critical component for the success of RRM. In this paper, we proposed stochastic radar beam scheduling algorithm using simulated annealing(SA), and evaluated the performance on the multi-function radar scenario. As a result, we showed that our proposed algorithm is superior to previous dispatching rule based scheduling algorithm from the viewpoint of beam processing latency and the number of scheduled beams, with real time capability.

• 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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1364-1370
• /
• 2017

This paper proposes a method that automatically sets profile schedule context-based mobile phone by collecting the user's external situation based on the GPS sensor and accelerometer built into the smartphone and interacting with the data in the user's schedule to minimize the user's handset handling. However, real-time data collection in mobile phones causes energy shortage in the device due to battery consumption. In other words, a service control method is explained in a way that can efficiently handle resource consumption because accessing a measurement device such as GPS and other sensors may increase power consumption of the portable device. Therefore, effective data sharing for context awareness to reduce weekly schedules and smartphone mode has improved energy efficiency in sensing for data collection. The user can use the context more effectively by providing environmental adaptability for various situations such as the end user's local context and smartphone force control.

• Journal of KIISE:Software and Applications
• /
• v.30 no.3_4
• /
• pp.293-307
• /
• 2003

Object-oriented development has been generalized, but object-oriented project planning and scheduling techniques have not been studied enough. Furthermore, it is difficult to apply the conventional software management techniques to object-oriented projects. Especially, the large scaled projects are increasing, but the project planing techniques for these large scaled projects have not been proposed enough. In this paper, we propose systematic techniques for OO based project scheduling. We suggest a 7 step-process for deriving the OO project schedule from the use-case diagram which is describing the functional requirements of the system. The proposed process includes identifying use-cases, drawing preliminary chart through interdependency analysis, identifying characteristics of each use case, determining the number of iteration, assigning use-cases to iteration, considering available resource and constraints, drawing revised PERT chart. Each step has the explanation of the input, output, and the guidelines needed to perform the step. The project scheduling technique proposed in this paper ran be used effectively in the planning phase which the purpose is to plan a development schedule to yield the high quality software in minimum time.