• 제목/요약/키워드: Smart Scheduling

검색결과 134건 처리시간 0.039초

An Adaptive Smart Grid Management Scheme Based on the Coopetition Game Model

  • Kim, Sungwook
    • ETRI Journal
    • /
    • 제36권1호
    • /
    • pp.80-88
    • /
    • 2014
  • Recently, the idea of the smart grid has been gaining significant attention and has become a hot research topic. The purpose of this paper is to present a novel smart grid management scheme that uses game theory principles. In our proposed scheme, power appliances in the smart grid adaptively form groups according to the non-cooperative hedonic game model. By exploiting multi-appliance diversity, appliances in each group are dynamically scheduled in a cooperative manner. For efficient smart grid management, the proposed coopetition game approach is dynamic and flexible to adaptively respond to current system conditions. The main feature is to maximize the overall system performance while satisfying the requirements of individual appliances. Simulation results indicate that our proposed scheme achieves higher energy efficiency and better system performance than other existing schemes.

전력 사용을 고려한 다이캐스팅 공정의 스케줄링 (Scheduling of Die Casting Processes Considering Power Usage)

  • 양정민;박용국
    • 한국산학기술학회논문지
    • /
    • 제13권8호
    • /
    • pp.3358-3365
    • /
    • 2012
  • 본 논문은 전력 효율을 고려한 다이캐스팅 공정의 스케줄링 기법을 제안한다. 시프트(shift)마다 반복 작업하는 다이캐스팅 공정의 스케줄링 문제는 각 제품의 시프트별 생산량을 의사결정변수로 정의하여 용탕 효율을 최대화 시키는 선형계획법으로 표현 가능하다. 본 연구에서는 주조 공장의 전력 사용에 대한 제한 조건까지 고려하는 새로운 선형계획법 모델을 제시한다. 제안된 모델은 다이캐스팅 공정의 한 시프트가 소비하는 전력 사용량이 주어진 한계 전력량 범위를 넘지 않도록 하는 스케줄링 결과를 유도한다. 사례 연구를 통하여 제안된 모델의 우수성과 응용가능성을 검증한다. 본 논문은 스마트 그리드 환경에서 지능형 소비자로 분류되는 주조 공장이 전력 사용 제한 조건을 만족시켜야 하는 문제에 대한 기초 연구의 역할을 할 것이다.

Novel Beamforming and User Scheduling Algorithm for Inter-cell Interference Cancellation

  • Kim, Kyunghoon;Piao, Jinhua;Choi, Seungwon
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제5권5호
    • /
    • pp.346-348
    • /
    • 2016
  • Coordinated multi-point transmission is a candidate technique for next-generation cellular communications systems. We consider a system with multiple cells in which base stations coordinate with each other by sharing user channel state information, which mitigates inter-cell interference (ICI), especially for users located at the cell edge. We introduce a new user scheduling method that considers both ICI and intra-cell orthogonality. Due to the influence of ICI cancellation and the loss reduction of effective channel gain during the beamforming process, the proposed method improves the system sum rate, when compared to the conventional method, by an average of 0.55bps/Hz for different numbers of total users per cell.

Fault-tolerant Scheduling of Real-time Tasks with Energy Efficiency on Lightly Loaded Multicore Processors

  • Lee, Wan Yeon;Choi, Yun-Seok
    • International journal of advanced smart convergence
    • /
    • 제7권3호
    • /
    • pp.92-100
    • /
    • 2018
  • In this paper, we propose a fault-tolerant scheduling scheme with energy efficiency for real-time periodic tasks on DVFS-enabled multicore processors. The scheme provides the tolerance of a permanent fault with the primary-backup task model. Also the scheme reduces the energy consumption of real-time tasks with the fully overlapped execution between each primary task and its backup task, whereas most of previous methods tried to minimize the overlapped execution between the two tasks. In order to the leakage energy loss of idle cores, the scheme activates a part of available cores with rarely used cores powered off. Evaluation results show that the proposed scheme saves up to 82% energy consumption of the previous method.

Revenue Maximizing Scheduling for a Fast Electric Vehicle Charging Station with Solar PV and ESS

  • Leon, Nishimwe H.;Yoon, Sung-Guk
    • KEPCO Journal on Electric Power and Energy
    • /
    • 제6권3호
    • /
    • pp.315-319
    • /
    • 2020
  • The modern transportation and mobility sector is expected to encounter high penetration of Electric Vehicles (EVs) because EVs contribute to reducing the harmful emissions from fossil fuel-powered vehicles. With the prospective growth of EVs, sufficient and convenient facilities for fast charging are crucial toward satisfying the EVs' quick charging demand during their trip. Therefore, the Fast Electric Vehicle Charging Stations (FECS) will be a similar role to gas stations. In this paper, we study a charging scheduling problem for the FECS with solar photovoltaic (PV) and an Energy Storage System (ESS). We formulate an optimization problem that minimizes the operational costs of FECS. There are two cost and one revenue terms that are buying cost from main grid power, ESS degradation cost, and revenue from the charging fee of the EVs. Simulation results show that the proposed scheduling algorithm reduces the daily operational cost by effectively using solar PV and ESS.

A Genetic Algorithm Based Task Scheduling for Cloud Computing with Fuzzy logic

  • Singh, Avtar;Dutta, Kamlesh
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제2권6호
    • /
    • pp.367-372
    • /
    • 2013
  • Cloud computing technology has been developing at an increasing expansion rate. Today most of firms are using this technology, making improving the quality of service one of the most important issues. To achieve this, the system must operate efficiently with less idle time and without deteriorating the customer satisfaction. This paper focuses on enhancing the efficiency of a conventional Genetic Algorithm (GA) for task scheduling in cloud computing using Fuzzy Logic (FL). This study collected a group of task schedules and assessed the quality of each task schedule with the user expectation. The work iterates the best scheduling order genetic operations to make the optimal task schedule. General GA takes considerable time to find the correct scheduling order when all the fitness function parameters are the same. GA is an intuitive approach for solving problems because it covers all possible aspects of the problem. When this approach is combined with fuzzy logic (FL), it behaves like a human brain as a problem solver from an existing database (Memory). The present scheme compares GA with and without FL. Using FL, the proposed system at a 100, 400 and 1000 sample size*5 gave 70%, 57% and 47% better improvement in the task time compared to GA.

  • PDF

Non-periodic Subway Scheduling that Minimizes Operational Cost and Passenger Waiting Time

  • Hong, YunWoo;Chung, Yerim;Min, YunHong
    • 한국컴퓨터정보학회논문지
    • /
    • 제23권8호
    • /
    • pp.133-142
    • /
    • 2018
  • Subway metro scheduling is one of the most important problems impacting passenger convenience today. To operate efficiently, the Seoul metro uses regular, periodic schedules for all lanes, both north and southbound. However, many past studies suggest that non-periodic scheduling would better optimize costs. Since the Seoul metro is continuously facing a deficit, adopting a non-periodic schedule may be necessary. Two objectives are presented; the first, to minimize the average passengers' waiting time, and the second, to minimize total costs, the sum of the passenger waiting time, and the operational costs. In this paper, we use passenger smart card data and a precise estimation of transfer times. To find the optimal time-table, a genetic algorithm is used to find the best solution for both objectives. Using Python 3.5 for the analysis, for the first objective, we are able to reduce the average waiting time, even when there are fewer trains. For the second objective, we are able to save about 4.5 thousand USD with six fewer trains.

Performance Analysis of Buffer Aware Scheduling for Video Services in LTE Network

  • Lin, Meng-Hsien;Chen, Yen-Wen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권9호
    • /
    • pp.3594-3610
    • /
    • 2015
  • Recent advancements in broadband wireless communication technologies enable mobile users to receive video streaming services with various smart devices. The long term evolution (LTE) network provides high bandwidth and low latency for several emerging mobile applications. This paper proposes the buffer aware scheduling (BAS) approach to schedule the downlink video traffic in LTE network. The proposed BAS scheme applies the weighting function to heuristically adjust the scheduling priority by considering the buffer status and channel condition of UE so as to reduce the time that UE stays in the connected state without receiving data. Both of 1080P and 2160P resolution video streaming sources were applied for exhaustive simulations to examine the performance of the proposed scheme by comparing to that of the fair bandwidth (FB) and the best channel quality indicator (CQI) schemes. The simulation results indicate that the proposed BAS scheme not only achieves better performance in power saving, streaming delivery time, and throughput than the FB scheme while maintaining the similar performance as the best CQI scheme in light traffic load. Specifically, the proposed scheme reduces streaming delivery time and generates less signaling overhead than the best CQI scheme when the traffic load is heavy.

데이터 플로우 기반 응용들을 위한 GPU 스케줄링 프레임워크 (A GPU scheduling framework for applications based on dataflow specification)

  • 이용빈;김성찬
    • 한국멀티미디어학회논문지
    • /
    • 제17권10호
    • /
    • pp.1189-1197
    • /
    • 2014
  • Recently, general purpose graphic processing units(GPUs) are being widely used in mobile embedded systems such as smart phone and tablet PCs. Because of architectural limitations of mobile GPGPUs, only a single program is allowed to occupy a GPU at a time in a non-preemptive way. As a result, it is difficult to meet performance requirements of applications such as frame rate or response time if applications running on a GPU are not scheduled properly. To tackle this difficulty, we propose to specify applications using synchronous data flow model of computation such that applications are formed with edges and nodes. Then nodes of applications are scheduled onto a GPU unlike conventional scheduling an application as a whole. This approach allows applications to share a GPU at a finer granularity, node (or task)-level, providing several benefits such as eliminating need for manually partitioning applications and better GPU utilization. Furthermore, any scheduling policy can be applied in response to the characteristics of applications.

Schedule Optimization in Resource Leveling through Open BIM Based Computer Simulations

  • 김현주
    • 한국BIM학회 논문집
    • /
    • 제9권2호
    • /
    • pp.1-10
    • /
    • 2019
  • In this research, schedule optimization is defined as balancing the number of workers while keeping the demand and needs of the project resources, creating the perfect schedule for each activity. Therefore, when one optimizes a schedule, multiple potentials of schedule changes are assessed to get an instant view of changes that avoid any over and under staffing while maximizing productivity levels for the available labor cost. Optimizing the number of workers in the scheduling process is not a simple task since it usually involves many different factors to be considered such as the development of quantity take-offs, cost estimating, scheduling, direct/indirect costs, and borrowing costs in cash flow while each factor affecting the others simultaneously. That is why the optimization process usually requires complex computational simulations/modeling. This research attempts to find an optimal selection of daily maximum workers in a project while considering the impacts of other factors at the same time through OPEN BIM based multiple computer simulations in resource leveling. This paper integrates several different processes such as quantity take-offs, cost estimating, and scheduling processes through computer aided simulations and prediction in generating/comparing different outcomes of each process. To achieve interoperability among different simulation processes, this research utilized data exchanges supported by building SMART-IFC effort in automating the data extraction and retrieval. Numerous computer simulations were run, which included necessary aspects of construction scheduling, to produce sufficient alternatives for a given project.