• Title/Summary/Keyword: Load usage scheduling

Search Result 8, Processing Time 0.024 seconds

A Study on Modeling of Users a Load Usage Pattern in Home Energy Management System Using a Copula Function and the Application (Copula 함수를 이용한 HEMS 내 전력소비자의 부하 사용패턴 모델링 및 그 적용에 관한 연구)

  • Shin, Je-Seok;Kim, Jin-O
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.1
    • /
    • pp.16-22
    • /
    • 2016
  • This paper addresses the load usage scheduling in the HEMS for residential power consumers. The HEMS would lead the residential users to change their power usage, so as to minimize the cost in response to external information such as a time-varying electricity price, the outside temperature. However, there may be a consumer's inconvenience in the change of the power usage. In order to improve this, it is required to understand the pattern of load usage according to the external information. Therefore, this paper suggests a methodology to model the load usage pattern, which classifies home appliances according to external information affecting the load usage and models the usage pattern for each appliance based on a copula function representing the correlation between variables. The modeled pattern would be reflected as a constraint condition for an optimal load usage scheduling problem in HEMS. To explain an application of the methodology, a case study is performed on an electrical water heater (EWH) and an optimal load usage scheduling for EHW is performed based on the branch-and-bound method. From the case study, it is shown that the load usage pattern can contribute to an efficient power consumption.

A CSP-based Load Leveling Algorithm for Ship Block Erection Network

  • Ryu, Ji-Sung;Park, Jin-Hyoung;Kim, Hong-Tae;Lee, Byung-No;Shin, Jong-Gye
    • Journal of Ship and Ocean Technology
    • /
    • v.10 no.2
    • /
    • pp.37-44
    • /
    • 2006
  • The erection in shipbuilding is the process to assemble all the blocks one by one in certain order and requires more leveled and efficient schedule than other processes do. However, erection schedule includes too many constraints to be systemized with simple programs and constraints are changed frequently. These difficulties make it rare to find automatic erection schedule generation system with load leveling ability. In this paper, a CSP (Constraint Satisfaction Problem)-based load leveling algorithm using a maximum load diminution technique is proposed and applied to the block erection scheduling of a dock in a shipyard. The result shows that it performs better than currently used scheduling method based on empirical logics. The maximum load of welding length and crane usage are reduced by 31.63% and 30.00% respectively. The deviation of resource usage amount also decreases by 8.93% and 7.51%.

DNS-based Dynamic Load Balancing Method on a Distributed Web-server System (분산 웹 서버 시스템에서의 DNS 기반 동적 부하분산 기법)

  • Moon, Jong-Bae;Kim, Myung-Ho
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.3
    • /
    • pp.193-204
    • /
    • 2006
  • In most existing distributed Web systems, incoming requests are distributed to servers via Domain Name System (DNS). Although such systems are simple to implement, the address caching mechanism easily results in load unbalancing among servers. Moreover, modification of the DNS is necessary to load considering the server's state. In this paper, we propose a new dynamic load balancing method using dynamic DNS update and round-robin mechanism. The proposed method performs effective load balancing without modification of the DNS. In this method, a server can dynamically be added to or removed from the DNS list according to the server's load. By removing the overloaded server from the DNS list, the response time becomes faster. For dynamic scheduling, we propose a scheduling algorithm that considers the CPU, memory, and network usage. We can select a scheduling policy based on resources usage. The proposed system can easily be managed by a GUI-based management tool. Experiments show that modules implemented in this paper have low impact on the proposed system. Furthermore, experiments show that both the response time and the file transfer rate of the proposed system are faster than those of a pure Round-Robin DNS.

An Emission-Aware Day-Ahead Power Scheduling System for Internet of Energy

  • Huang, Chenn-Jung;Hu, Kai-Wen;Liu, An-Feng;Chen, Liang-Chun;Chen, Chih-Ting
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.10
    • /
    • pp.4988-5012
    • /
    • 2019
  • As a subset of the Internet of Things, the Internet of Energy (IoE) is expected to tackle the problems faced by the current smart grid framework. Notably, the conventional day-ahead power scheduling of the smart grid should be redesigned in the IoE architecture to take into consideration the intermittence of scattered renewable generations, large amounts of power consumption data, and the uncertainty of the arrival time of electric vehicles (EVs). Accordingly, a day-ahead power scheduling system for the future IoE is proposed in this research to maximize the usage of distributed renewables and reduce carbon emission caused by the traditional power generation. Meanwhile, flexible charging mechanism of EVs is employed to provide preferred charging options for moving EVs and flatten the load profile simultaneously. The simulation results revealed that the proposed power scheduling mechanism not only achieves emission reduction and balances power load and supply effectively, but also fits each individual EV user's preference.

Adaptive Scheduling for QoS-based Virtual Machine Management in Cloud Computing

  • Cao, Yang;Ro, Cheul Woo
    • International Journal of Contents
    • /
    • v.8 no.4
    • /
    • pp.7-11
    • /
    • 2012
  • Cloud Computing can be viewed as a dynamically-scalable pool of resources. Virtualization is one of the key technologies enabling Cloud Computing functionalities. Virtual machines (VMs) scheduling and allocation is essential in Cloud Computing environment. In this paper, two dynamic VMs scheduling and allocating schemes are presented and compared. One dynamically on-demand allocates VMs while the other deploys optimal threshold to control the scheduling and allocating of VMs. The aim is to dynamically allocate the virtual resources among the Cloud Computing applications based on their load changes to improve resource utilization and reduce the user usage cost. The schemes are implemented by using SimPy, and the simulation results show that the proposed adaptive scheme with one threshold can be effectively applied in a Cloud Computing environment both performance-wise and cost-wise.

Workflow Scheduling Using Heuristic Scheduling in Hadoop

  • Thingom, Chintureena;Kumar R, Ganesh;Yeon, Guydeuk
    • Journal of information and communication convergence engineering
    • /
    • v.16 no.4
    • /
    • pp.264-270
    • /
    • 2018
  • In our research study, we aim at optimizing multiple load in cloud, effective resource allocation and lesser response time for the job assigned. Using Hadoop on datacenter is the best and most efficient analytical service for any corporates. To provide effective and reliable performance analytical computing interface to the client, various cloud service providers host Hadoop clusters. The previous works done by many scholars were aimed at execution of workflows on Hadoop platform which also minimizes the cost of virtual machines and other computing resources. Earlier stochastic hill climbing technique was applied for single parameter and now we are working to optimize multiple parameters in the cloud data centers with proposed heuristic hill climbing. As many users try to priorities their job simultaneously in the cluster, resource optimized workflow scheduling technique should be very reliable to complete the task assigned before the deadlines and also to optimize the usage of the resources in cloud.

Performance Improvement using Effective Task Size Calculation in Dynamic Load Balancing Systems (동적 부하 분산 시스템에서 효율적인 작업 크기 계산을 통한 성능 개선)

  • Choi, Min;Kim, Nam-Gi
    • The KIPS Transactions:PartA
    • /
    • v.14A no.6
    • /
    • pp.357-362
    • /
    • 2007
  • In distributed systems like cluster systems, in order to get more performance improvement, the initial task placement system precisely estimates and correctly assigns the resource requirement by the process. The resource-based initial job placement scheme needs the prediction of resource usage of a task in order to fit it to the most suitable hosts. However, the wrong prediction of resource usage causes serious performance degradation in dynamic load balancing systems. Therefore, in this paper, to resolve the problem due to the wrong prediction, we propose a new load metric. By the new load metric, the resource-based initial job placement scheme can work without priori knowledge about the type of process. Simulation results show that the dynamic load balancing system using the proposed approach achieves shorter execution times than the conventional approaches.

Optimal Capacity Determination Method of Battery Energy Storage System for Demand Management of Electricity Customer (수용가 수요관리용 전지전력저장시스템의 최적용량 산정방법)

  • Cho, Kyeong-Hee;Kim, Seul-Ki;Kim, Eung-Sang
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.62 no.1
    • /
    • pp.21-28
    • /
    • 2013
  • The paper proposes an optimal sizing method of a customer's battery energy storage system (BESS) which aims at managing the electricity demand of the customer to minimize electricity cost under the time of use(TOU) pricing. Peak load limit of the customer and charging and discharging schedules of the BESS are optimized on annual basis to minimize annual electricity cost, which consists of peak load related basic cost and actual usage cost. The optimal scheduling is used to assess the maximum cost savings for all sets of candidate capacities of BESS. An optimal size of BESS is determined from the cost saving curves via capacity of BESS. Case study uses real data from an apartment-type factory customer and shows how the proposed method can be employed to optimally design the size of BESS for customer demand management.