• Title/Summary/Keyword: Grid Scheduling

Search Result 142, Processing Time 0.031 seconds

Development of Daily Operation Program of Battery Energy Storage System for Peak Shaving of High-Speed Railway Substations (고속철도 변전소 피크부하 저감용 ESS 일간 운전 프로그램 개발)

  • Byeon, Gilsung;Kim, Jong-Yul;Kim, Seul-Ki;Cho, Kyeong-Hee;Lee, Byung-Gon
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.3
    • /
    • pp.404-410
    • /
    • 2016
  • This paper proposed a program of an energy storage system(ESS) for peak shaving of high-speed railway substations The peak shaving saves cost of equipment and demand cost of the substation. To reduce the peak load, it is very important to know when the peak load appears. The past data based load profile forecasting method is easy and applicable to customers which have relatively fixed load profiles. And an optimal scheduling method of the ESS is helpful in reducing the electricity tariff and shaving the peak load efficiently. Based on these techniques, MS. NET based peak shaving program is developed. In case study, a specific daily load profile of the local substation was applied and simulated to verify performance of the proposed program.

Sizing and Economic Analysis of Battery Energy Storage System for Peak Shaving of High-Speed Railway Substations (고속철도 변전소 피크부하 저감용 ESS 용량 산정 및 경제성 분석)

  • Kim, Seul-Ki;Kim, Jong-Yul;Cho, Kyeong-Hee;Byun, Gil-Sung
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.63 no.1
    • /
    • pp.27-34
    • /
    • 2014
  • The paper proposed a sizing method of an energy storage system(ESS) for peak shaving of high-speed railway substations based on load profile patterns of substations. A lithium based battery ESS was selected since it can produce high-power at high speed that peak shaving requires, and also takes up a relatively smaller space for installation. Adequate size of the ESS, minimum capacity which can technically meet a peak shaving target, was determined by collectively considering load patterns of a target substation, characteristics of the ESS to be installed, and optimal scheduling of the ESS. In case study, a local substation was considered to demonstrate the proposed sizing method. Also economic analysis with the determined size of ESS was performed to calculate electricity cost savings of the peak shaving ESS, and to offer pay-back period and return on investment.

Minimizing Energy Consumption in Scheduling of Dependent Tasks using Genetic Algorithm in Computational Grid

  • Kaiwartya, Omprakash;Prakash, Shiv;Abdullah, Abdul Hanan;Hassan, Ahmed Nazar
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.8
    • /
    • pp.2821-2839
    • /
    • 2015
  • Energy consumption by large computing systems has become an important research theme not only because the sources of energy are depleting fast but also due to the environmental concern. Computational grid is a huge distributed computing platform for the applications that require high end computing resources and consume enormous energy to facilitate execution of jobs. The organizations which are offering services for high end computation, are more cautious about energy consumption and taking utmost steps for saving energy. Therefore, this paper proposes a scheduling technique for Minimizing Energy consumption using Adapted Genetic Algorithm (MiE-AGA) for dependent tasks in Computational Grid (CG). In MiE-AGA, fitness function formulation for energy consumption has been mathematically formulated. An adapted genetic algorithm has been developed for minimizing energy consumption with appropriate modifications in each components of original genetic algorithm such as representation of chromosome, crossover, mutation and inversion operations. Pseudo code for MiE-AGA and its components has been developed with appropriate examples. MiE-AGA is simulated using Java based programs integrated with GridSim. Analysis of simulation results in terms of energy consumption, makespan and average utilization of resources clearly reveals that MiE-AGA effectively optimizes energy, makespan and average utilization of resources in CG. Comparative analysis of the optimization performance between MiE-AGA and the state-of-the-arts algorithms: EAMM, HEFT, Min-Min and Max-Min shows the effectiveness of the model.

Efficient Data Scheduling considering number of Spatial query of Client in Wireless Broadcast Environments (무선방송환경에서 클라이언트의 공간질의 수를 고려한 효율적인 데이터 스케줄링)

  • Song, Doohee;Park, Kwangjin
    • Journal of Internet Computing and Services
    • /
    • v.15 no.2
    • /
    • pp.33-39
    • /
    • 2014
  • How to transfer spatial data from server to client in wireless broadcasting environment is shown as following: A server arranges data information that client wants and transfers data by one-dimensional array for broadcasting cycle. Client listens data transferred by the server and returns resulted value only to server. Recently number of users using location-based services is increasing alongside number of objects, and data volume is changing into large amount. Large volume of data in wireless broadcasting environment may increase query time of client. Therefore, we propose Client based Data Scheduling (CDS) for efficient data scheduling in wireless broadcasting environment. CDS divides map and then calculates total sum of objects for each grid by considering number of objects and data size within divided grids. It carries out data scheduling by applying hot-cold method considering total data size of objects for each grid and number of client. It's proved that CDS reduces average query processing time for client compared to existing method.

Vertex Coloring based Slot Reuse Scheduling for Power Line Communications

  • Yoon, Sung-Guk
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.5
    • /
    • pp.2135-2141
    • /
    • 2015
  • Power line communication (PLC) is one of the major communication technologies in smart grid since it combines good communication capability with easy and simple deployment. As a power network can be modeled as a graph, we propose a vertex coloring based slot reuse scheduling in the time division multiple access (TDMA) period for PLCs. Our objective is to minimize the number of assigned time slots, while satisfying the quality of service (QoS) requirement of each station. Since the scheduling problem is NP-hard, we propose an efficient heuristic scheduling, which consists of repeated vertex coloring and slot reuse improvement algorithms. The simulation results confirm that the proposed algorithm significantly reduces the total number of time slots.

Grid Transaction Network Modeling and Simulation for Resource Management in Grid Computing Environment (그리드 컴퓨팅 환경에서의 효율적인 자원 관리를 위한 그리드 거래망 모델링과 시뮬레이션)

  • Jang, Sung-Ho;Lee, Jong-Sik
    • Journal of the Korea Society for Simulation
    • /
    • v.15 no.3
    • /
    • pp.1-9
    • /
    • 2006
  • As an effective solution to resolve complex computing problems and to handle geographically dispersed data sets, grid computing has been noticed. Grid computing separates an application to several parts and executes on heterogeneous computing platforms simultaneously. The most important problem in grid computing environments is to manage grid resources and to schedule grid resources. This paper proposes a grid transaction network model that is applicable for resource management and scheduling in grid computing environment and presents a grid resource bidding algorithm for grid users and grid resource providers. Using DEVSJAVA modeling and simulation, this paper evaluates usefulness and efficiency of the proposed model.

  • PDF

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

  • Kim, Sungwook
    • ETRI Journal
    • /
    • v.36 no.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.

An Active Enactment Architecture for Enterprise Workflow Grid (액티브 엔터프라이즈 워크플로우 그리드 아키텍처)

  • Paik, Su-Ki
    • Journal of Information Technology Services
    • /
    • v.7 no.4
    • /
    • pp.167-178
    • /
    • 2008
  • This paper addresses the issue of workflow on Grid and P2P, and proposes a layered workflow architecture and its related workflow models that are used for not only distributing workflows' information onto Grid or P2P resources but also scheduling the enactment of workflows. Especially, the most critical rationale of this paper is on the fact that the nature of Grid computing environment is fitted very well into building a platform for the maximally parallel and very large scale workflows that are frequently found in very large scale enterprises. The layered architecture proposed in this paper, which we call Enterprise Workflow Grid Architecture, is targeting on maximizing the usability of computing facilities in the enterprise as well as the scalability of its underlined workflow management system in coping with massively parallel and very large scale workflow applications.

A Novel Air Indexing Scheme for Window Query in Non-Flat Wireless Spatial Data Broadcast

  • Im, Seok-Jin;Youn, Hee-Yong;Choi, Jin-Tak;Ouyang, Jinsong
    • Journal of Communications and Networks
    • /
    • v.13 no.4
    • /
    • pp.400-407
    • /
    • 2011
  • Various air indexing and data scheduling schemes for wireless broadcast of spatial data have been developed for energy efficient query processing. The existing schemes are not effective when the clients' data access patterns are skewed to some items. It is because the schemes are based on flat broadcast that does not take the popularity of the data items into consideration. In this paper, thus, we propose a data scheduling scheme letting the popular items appear more frequently on the channel, and grid-based distributed index for non-flat broadcast (GDIN) for window query processing. The proposed GDIN allows quick and energy efficient processing of window query, matching the clients' linear channel access pattern and letting the clients access only the queried data items. The simulation results show that the proposed GDIN significantly outperforms the existing schemes in terms of access time, tuning time, and energy efficiency.

Design and Implementation of a QoS-Based Scheduling Algorithm Based on the LTE QCI Specifications

  • Ramneek, Ramneek;Choi, Wonjun;Seok, Woojin
    • Annual Conference of KIPS
    • /
    • 2014.11a
    • /
    • pp.227-230
    • /
    • 2014
  • LTE 3GPP standard defines several QCI (QoS Class Identifier) classes to provide differential QoS, depending on the requirements of different user applications.These QCI values have been characterized in terms of priority, packet loss and delay budget. In spite of the availability of this robust QoS framework in LTE, there is no such scheduling algorithm that has its working principle based on this framework. The responsibility of fulfilling the user requirements, while satisfying the service class requirements is left upon the cellular service provider and it is an open issue at present. To solve this problem, we have proposed a MAC scheduler, which defines the priority of different users based on their bearer specification and provides desired QoS in terms of the achieved throughput through the resource block allocation based on calculated user priority.