• 제목/요약/키워드: Virtual grid

검색결과 228건 처리시간 0.023초

Resource Management Scheme in Proxy-Based Mobile Grid (프록시기반 모바일 그리드에서 자원관리 기법)

  • Cho, InSeock;Lee, DaeWon;Lee, HwaMin;Gil, JoonMin;Yu, HeonChang
    • The Journal of Korean Association of Computer Education
    • /
    • 제11권5호
    • /
    • pp.67-76
    • /
    • 2008
  • Grid computing has a large scale virtual computing environment that enables a collaborative processing through sharing resources of geographically distributed organizations. In recent year, the development of wireless networks and mobile devices enables mobile devices to consider as a resource of the grids. However, there are some problems such as low performance of processors, small capacity of storages, limited capacity of battery, and low bandwidth. In this paper, to overcome these limitations occurred in mobile grid environments, we proposed a proxy-based mobile grid system. Our proposed system enables mobile devices to play roles as a resource consumer and a resource provider and to collaborate with wired grids through a mobile router. Also, we propose an adaptive job scheduling scheme to cope with context changes of mobile devices and compare our scheduling scheme with other scheduling schemes using a simulation tool, SimGrid, to verify the validity of our job scheduling scheme.

  • PDF

Stationary Frame Current Control Evaluations for Three-Phase Grid-Connected Inverters with PVR-based Active Damped LCL Filters

  • Han, Yang;Shen, Pan;Guerrero, Josep M.
    • Journal of Power Electronics
    • /
    • 제16권1호
    • /
    • pp.297-309
    • /
    • 2016
  • Grid-connected inverters (GCIs) with an LCL output filter have the ability of attenuating high-frequency (HF) switching ripples. However, by using only grid-current control, the system is prone to resonances if it is not properly damped, and the current distortion is amplified significantly under highly distorted grid conditions. This paper proposes a synchronous reference frame equivalent proportional-integral (SRF-EPI) controller in the αβ stationary frame using the parallel virtual resistance-based active damping (PVR-AD) strategy for grid-interfaced distributed generation (DG) systems to suppress LCL resonance. Although both a proportional-resonant (PR) controller in the αβ stationary frame and a PI controller in the dq synchronous frame achieve zero steady-state error, the amplitude- and phase-frequency characteristics differ greatly from each other except for the reference tracking at the fundamental frequency. Therefore, an accurate SRF-EPI controller in the αβ stationary frame is established to achieve precise tracking accuracy. Moreover, the robustness, the harmonic rejection capability, and the influence of the control delay are investigated by the Nyquist stability criterion when the PVR-based AD method is adopted. Furthermore, grid voltage feed-forward and multiple PR controllers are integrated into the current loop to mitigate the current distortion introduced by the grid background distortion. In addition, the parameters design guidelines are presented to show the effectiveness of the proposed strategy. Finally, simulation and experimental results are provided to validate the feasibility of the proposed control approach.

A Development of VPP Platform for the Efficient Utilization of Distributed Renewable Energy Resources (분산 재생에너지의 효율적 활용을 위한 가상발전소(VPP) 플랫폼 개발에 관한 연구)

  • Cho, Young-Hyeok;Baek, Seung-Yup;Choi, Won-Yong;Jeong, Dae-Yul
    • The Journal of Information Systems
    • /
    • 제27권2호
    • /
    • pp.95-114
    • /
    • 2018
  • Purpose The recent concern over environmental problems such as greenhouse gas emission and fine dust contributes increasing interest in renewable energies. However the intrinsic characteristics of renewable energies, intermittent and stochastic generation, might cause serious problems to the stability and controllability of power grid. Therefore countermeasures such as virtual power plant (VPP) must be prepared in advance of the spread of uncontrollable distributed renewable energy resources to be one of major energy sources. Design/methodology/approach This study deals with the design concept of the VPP platform. we proposed as a technology solution for achieving the stability of power grid by guaranteeing a single power profile combining multiple distributed power sources with ICT. The core characteristics of VPP should be able to participate in the grid operation by responding to operation instructions from the system operator, KPX, as well as the wholesale electricity market. Findings Therefore this study includes energy storage device(ESS) as a controllable component as well as renewable energy resources such as photovoltaic and wind power generation. Based on this configuration, we discussed core element technologies of VPP and protype design of VPP solution platform according to system requirements. In the proposed solution platform, UX design for the integrated control center and brokerage system were included as well as ancillary service function to respond to KPX's operation instruction with utilizing the capability of ESS. In addition, a simulator was suggested to verify the VPP operations.

Improvement of High-Availability Seamless Redundancy (HSR) Traffic Performance for Smart Grid Communications

  • Nsaif, Saad Allawi;Rhee, Jong Myung
    • Journal of Communications and Networks
    • /
    • 제14권6호
    • /
    • pp.653-661
    • /
    • 2012
  • High-availability seamless redundancy (HSR) is a redundancy protocol for Ethernet networks that provides two frame copies for each frame sent. Each copy will pass through separate physical paths, pursuing zero fault recovery time. This means that even in the case of a node or a link failure, there is no stoppage of network operations whatsoever. HSR is a potential candidate for the communications of a smart grid, but its main drawback is the unnecessary traffic created due to the duplicated copies of each sent frame, which are generated and circulated inside the network. This downside will degrade network performance and might cause network congestion or even stoppage. In this paper, we present two approaches to solve the above-mentioned problem. The first approach is called quick removing (QR), and is suited to ring or connected ring topologies. The idea is to remove the duplicated frame copies from the network when all the nodes have received one copy of the sent frame and begin to receive the second copy. Therefore, the forwarding of those frame copies until they reach the source node, as occurs in standard HSR, is not needed in QR. Our example shows a traffic reduction of 37.5%compared to the standard HSR protocol. The second approach is called the virtual ring (VRing), which divides any closed-loop HSR network into several VRings. Each VRing will circulate the traffic of a corresponding group of nodes within it. Therefore, the traffic in that group will not affect any of the other network links or nodes, which results in an enhancement of traffic performance. For our sample network, the VRing approach shows a network traffic reduction in the range of 67.7 to 48.4%in a healthy network case and 89.7 to 44.8%in a faulty network case, compared to standard HSR.

Performance Evaluation of Scheduling Algorithms according to Communication Cost in the Grid System of Co-allocation Environment (Co-allocation 환경의 그리드 시스템에서 통신비용에 따른 스케줄링 알고리즘의 성능 분석)

  • Kang, Oh-Han;Kang, Sang-Seong;Kim, Jin-Suk
    • The KIPS Transactions:PartA
    • /
    • 제14A권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.

Implementation of Access Control System Suitable for Meteorological Tasks in Grid Computing Environment (그리드 컴퓨팅 환경에서 기상업무에 적합한 접근 제어 시스템 구현)

  • Na, Seung-kwon;Ju, Jae-han
    • Journal of Advanced Navigation Technology
    • /
    • 제21권2호
    • /
    • pp.206-211
    • /
    • 2017
  • Recently computing devices by connecting to a network, grid computing, the next generation of digital neural networks that provide maximum service will connect all of the computer such as a PC or server, PDA into one giant network makes the virtual machine. Therefore, we propose the grid computing implementation model to be applied to meteorological business field as follows. First, grid computing will be used for tasks such as the development of numerical models below the mid-scale or test operations, and the final backup of the weather supercomputer. Second, the resources that will constitute grid computing are limited to business PCs and Linux servers operated by the central government considering operational efficiency. Third, the network is restricted to the LAN section, which suggests the implementation of high performance computing.

Search Space Reduction by Vertical-Decomposition of a Grid Map (그리드 맵의 수직 분할에 의한 탐색 공간 축소)

  • Jung, Yewon;Lee, Juyoung;Yu, Kyeonah
    • Journal of KIISE
    • /
    • 제43권9호
    • /
    • pp.1026-1033
    • /
    • 2016
  • Path-finding on a grid map is a problem generally addressed in the fields of robotics, intelligent agents, and computer games. As technology advances, virtual game worlds tend to be represented more accurately and more realistically, resulting in an excessive increase in the number of grid tiles and in path-search time. In this study, we propose a path-finding algorithm that allows a prompt response to real-time queries by constructing a reduced state space and by precomputing all possible paths in an offline preprocessing stage. In the preprocessing stage, we vertically decompose free space on the grid map, construct a connectivity graph where nodes are the decomposed regions, and store paths between all pairs of nodes in matrix form. In the real-time query stage, we first find the nodes containing the query points and then retrieve the corresponding stored path. The proposed method is simulated for a set of maps that has been used as a benchmark for grid-based path finding. The simulation results show that the state space and the search time decrease significantly.

Multi-Objective Job Scheduling Model Based on NSGA-II for Grid Computing (그리드 컴퓨팅을 위한 NSGA-II 기반 다목적 작업 스케줄링 모델)

  • Kim, Sol-Ji;Kim, Tae-Ho;Lee, Hong-Chul
    • Journal of the Korea Society of Computer and Information
    • /
    • 제16권7호
    • /
    • pp.13-23
    • /
    • 2011
  • Grid computing is a new generation computing technology which organizes virtual high-performance computing system by connecting and sharing geographically distributed heterogeneous resources, and performing large-scaled computing operations. In order to maximize the performance of grid computing, job scheduling is essential which allocates jobs to resources effectively. Many studies have been performed which minimize total completion times, etc. However, resource costs are also important, and through the minimization of resource costs, the overall performance of grid computing and economic efficiency will be improved. So in this paper, we propose a multi-objective job scheduling model considering both time and cost. This model derives from the optimal scheduling solution using NSGA-II, which is a multi objective genetic algorithm, and guarantees the effectiveness of the proposed model by executing experiments with those of existing scheduling models such as Min-Min and Max-Min models. Through experiments, we prove that the proposed scheduling model minimizes time and cost more efficiently than existing scheduling models.

A Study on Traffic Big Data Mapping Using the Grid Index Method (그리드 인덱스 기법을 이용한 교통 빅데이터 맵핑 방안 연구)

  • Chong, Kyu Soo;Sung, Hong Ki
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • 제19권6호
    • /
    • pp.107-117
    • /
    • 2020
  • With the recent development of autonomous vehicles, various sensors installed in vehicles have become common, and big data generated from those sensors is increasingly being used in the transportation field. In this study, we proposed a grid index method to efficiently process real-time vehicle sensing big data and public data such as road weather. The applicability and effect of the proposed grid space division method and grid ID generation method were analyzed. We created virtual data based on DTG data and mapped to the road link based on coordinates. As a result of analyzing the data processing speed in grid index method, the data processing performance improved by more than 2,400 times compared to the existing link unit processing method. In addition, in order to analyze the efficiency of the proposed technology, the virtually generated data was mapped and visualized.

An Empirical Analysis of Worldwide Cyberinfrastructure

  • Cho, Manhyung
    • Asian Journal of Innovation and Policy
    • /
    • 제4권3호
    • /
    • pp.381-396
    • /
    • 2015
  • Cyberinfrastructure is a research infrastructure that provides an environment in which research communities can get access to distributed resources and collaborate at unprecedented levels of computation, storage, and network capacity. The Worldwide LHC Computing Grid (WLCG) is a global collaborative project of computing or data centers that enables access to scientific data generated by the Large Hadron Collider (LHC) experiments at CERN. This case study analyzes the WLCG as a model of cyberinfrastructure in research collaboration. WLCG provides a useful case of how cyberinfrastructure can work in providing an infrastructure for collaborative researches under data-intensive paradigm. Cyberinfrastructure plays the critical role of facilitating collaboration of diverse and widely separated communities of researchers. Data-intensive science requires new strategies for research support and significant development of cyberinfrastructure. The sustainability of WLCG depends on the resources of partner organizations and virtual organizations at international levels, essential for research collaboration.