• Title/Summary/Keyword: Grid Environment

Search Result 1,030, Processing Time 0.027 seconds

The Design of Mobile Grid Architecture using Ad-Hoc Network (Ad-Hoc 네트워크를 이용한 모바일 그리드의 구조 설계)

  • Kim Tea-Kyoung;Seo Hee-Sek;Kim Hee-Wan
    • Journal of the Korea Computer Industry Society
    • /
    • v.6 no.2
    • /
    • pp.345-354
    • /
    • 2005
  • Mobile grid can provide the grid service to grid users regardless of space and time. There are many restrictions to use grid service in mobile environment such as battery power of mobile device, movement pattern of mobile device etc. So it is difficult to apply the grid technologies of wired network to wireless network environments. Therefore, to provide the mobile grid service, we suggested the mobile grid architecture using ad-hoc network. Also we showed that hybrid routing protocol is efficient for mobile grid service by considering the battery power of mobile device and simulations of evaluating the delay time of three routing protocols using NS-2. We will study the methods of resource allocations and network reliability to provide the mobile grid service.

  • PDF

Service Scheduling for Workflow Based Applications in Grids (그리드에서 워크플로우 기반 어플리케이션을 위한 서비스 스케줄링)

  • Chin, SungHo;Lee, JongHyuk;Yu, HeonChang
    • The Journal of Korean Association of Computer Education
    • /
    • v.9 no.6
    • /
    • pp.89-98
    • /
    • 2006
  • Recently, grid computing environment has being changed to the service-oriented grid integrated with Web Services. In this architecture, there is the service-oriented grid application in which Grid Services are executed according to the workflow of the grid application. This implies that the grid scheduling method needs to consider grid service characteristics. Therefore, we propose the grid service performance model based on factors such as service availability, accessibility, reliability, throughput, and slowdown, and develop service scheduling method to increase performance of the service-oriented grid application.

  • PDF

Service Prediction-Based Job Scheduling Model for Computational Grid (계산 그리드를 위한 서비스 예측 기반의 작업 스케줄링 모델)

  • Jang Sung-Ho;Lee Jong-Sik
    • Journal of the Korea Society for Simulation
    • /
    • v.14 no.3
    • /
    • pp.91-100
    • /
    • 2005
  • Grid computing is widely applicable to various fields of industry including process control and manufacturing, military command and control, transportation management, and so on. In a viewpoint of application area, grid computing can be classified to three aspects that are computational grid, data grid and access grid. This paper focuses on computational grid which handles complex and large-scale computing problems. Computational grid is characterized by system dynamics which handles a variety of processors and jobs on continuous time. To solve problems of system complexity and reliability due to complex system dynamics, computational grid needs scheduling policies that allocate various jobs to proper processors and decide processing orders of allocated jobs. This paper proposes a service prediction-based job scheduling model and present its scheduling algorithm that is applicable for computational grid. The service prediction-based job scheduling model can minimize overall system execution time since the model predicts the next processing time of each processing component and distributes a job to a processing component with minimum processing time. This paper implements the job scheduling model on the DEVS modeling and simulation environment and evaluates its efficiency and reliability. Empirical results, which are compared to conventional scheduling policies, show the usefulness of service prediction-based job scheduling.

  • PDF

Service Prediction-Based Job Scheduling Model for Computational Grid (계산 그리드를 위한 서비스 예측 기반의 작업 스케쥴링 모델)

  • Jang Sung-Ho;Lee Jong-Sik
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2005.05a
    • /
    • pp.29-33
    • /
    • 2005
  • Grid computing is widely applicable to various fields of industry including process control and manufacturing, military command and control, transportation management, and so on. In a viewpoint of application area, grid computing can be classified to three aspects that are computational grid, data grid and access grid. This paper focuses on computational grid which handles complex and large-scale computing problems. Computational grid is characterized by system dynamics which handles a variety of processors and jobs on continuous time. To solve problems of system complexity and reliability due to complex system dynamics, computational grid needs scheduling policies that allocate various jobs to proper processors and decide processing orders of allocated jobs. This paper proposes the service prediction-based job scheduling model and present its algorithm that is applicable for computational grid. The service prediction-based job scheduling model can minimize overall system execution time since the model predicts a processing time of each processing component and distributes a job to processing component with minimum processing time. This paper implements the job scheduling model on the DEVSJAVA modeling and simulation environment and simulates with a case study to evaluate its efficiency and reliability Empirical results, which are compared to the conventional scheduling policies such as the random scheduling and the round-robin scheduling, show the usefulness of service prediction-based job scheduling.

  • PDF

An Efficient Scheduling Method for Grid Systems Based on a Hierarchical Stochastic Petri Net

  • Shojafar, Mohammad;Pooranian, Zahra;Abawajy, Jemal H.;Meybodi, Mohammad Reza
    • Journal of Computing Science and Engineering
    • /
    • v.7 no.1
    • /
    • pp.44-52
    • /
    • 2013
  • This paper addresses the problem of resource scheduling in a grid computing environment. One of the main goals of grid computing is to share system resources among geographically dispersed users, and schedule resource requests in an efficient manner. Grid computing resources are distributed, heterogeneous, dynamic, and autonomous, which makes resource scheduling a complex problem. This paper proposes a new approach to resource scheduling in grid computing environments, the hierarchical stochastic Petri net (HSPN). The HSPN optimizes grid resource sharing, by categorizing resource requests in three layers, where each layer has special functions for receiving subtasks from, and delivering data to, the layer above or below. We compare the HSPN performance with the Min-min and Max-min resource scheduling algorithms. Our results show that the HSPN performs better than Max-min, but slightly underperforms Min-min.

Plausible grid size for a real time decision making system based 3D water quality model (실시간 수질관리도구로서의 3차원 수질모형의 최적 격자크기 산정)

  • Ahn, Ki-Hong
    • Journal of Environmental Impact Assessment
    • /
    • v.20 no.4
    • /
    • pp.575-583
    • /
    • 2011
  • In this study, the plausible grid size was estimated to increase for efficiency of reservoir management using 3 dimensional water quality model. To validate utilization of a real time water quality management tool, ELCOM-CAEDYM model was applied to Soyang reservoir in korea. 100m grid size can represent the real topography and take out exact analysis results. $400{\times}400m$ grid can be easily used to analysis because of data capacity. Consequently, the grid size of 200m or 300m was recommended to establish 3D model considering the required simulation time and the irrelevance between horizontal grid size and vertical distribution for temperature and turbidity analysis.

Effects of Natural Independent Visual Background for Reducing Simulator Sickness (자연형 IVB(Independent Visual Background)의 Simulator Sickness 감소효과)

  • 김도회;임정위
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.25 no.3
    • /
    • pp.28-33
    • /
    • 2002
  • Several studies indicated that an independent visual background (IVB) reduced simulator sickness (SS) and balance disturbance associated with exposure to virtual environments (VEs) and motion simulators. A recent study showed that an IVB comprised of an earth-fixed grid was less effective in a complex driving simulator than in a simple VE. Subjects' post-experiment reports indicated that the VE motion "induced" motion of the earth-fixed grid m. This led to the suggestion that an IVB comprised of clouds would be less subject to induced motion and therefore would alleviate nausea more effectively than a grid IVB. Clouds are "natural" and are usually perceived as relatively stable, whereas a grid has no inherent stability. 12 subjects were exposed to complex motion through a simulated environment in a driving simulator under 3 IVB conditions: grid, less clouds, many clouds. They reported less nausea when the many-cloud IVB was used relative to the grid IVB condition. grid IVB condition.

Smart Grid and Its Implications for Electricity Market Design

  • Kim, Seon-Gu;Hur, Seong-Il;Chae, Yeoung-Jin
    • Journal of Electrical Engineering and Technology
    • /
    • v.5 no.1
    • /
    • pp.1-7
    • /
    • 2010
  • Recently, smart grid has been considered a very important new energy delivery technology, and one that can help ensure a cleaner environment by making use of information and communication technology (ICT) in countries around the world. The many technological benefits smart grid offers is expected to bring about a huge change in the electric energy supply chain. In particular, smart grid with advanced ICT is likely to allow market agents to participate in the decision-making process in the restructured electricity industry, easily facilitating Homeostatic Utility Control. In this paper, we examine smart grid as a market externality, and then illustrate issues from the commercial market perspective as it relates to electricity market design. Finally, our paper identifies some of the impacts of smart grid on electricity market design, which may possibly be incorporated into the evolution of the electricity market, thus ensuring market efficiency.

Design and Implementation of a Grid System META for Executing CFD Analysis Programs on Distributed Environment (분산 환경에서 CFD 분석 프로그램 수행을 위한 그리드 시스템 META 설계 및 구현)

  • Kang, Kyung-Woo;Woo, Gyun
    • The KIPS Transactions:PartA
    • /
    • v.13A no.6 s.103
    • /
    • pp.533-540
    • /
    • 2006
  • This paper describes the design and implementation of a grid system META (Metacomputing Environment using Test-run of Application) which facilitates the execution of a CFD (Computational Fluid Dynamics) analysis program on distributed environment. The grid system META allows the CFD program developers can access the computing resources distributed over the network just like one computer system. The research issues involved in the grid computing include fault-tolerance, computing resource selection, and user-interface design. In this paper, we exploits an automatic resource selection scheme for executing the parallel SPMD (Single Program Multiple Data) application written in MPI (Message Passing Interface). The proposed resource selection scheme is informed from the network latency time and the elapsed time of the kernel loop attained from test-run. The network latency time highly influences the executional performance when a parallel program is distributed and executed over several systems. The elapsed time of the kernel loop can be used as an estimator of the whole execution time of the CFD Program due to a common characteristic of CFD programs. The kernel loop consumes over 90% of the whole execution time of a CFD program.

Load Balancing for Parallel Finite Element Analysis in Computing GRID Environment (컴퓨팅 그리드 시스템에서의 병렬 유한요소 해석을 위한 로드 밸런싱)

  • Lee,Chang-Seong;Im,Sang-Yeong;Kim,Seung-Jo;Jo,Geum-Won
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.31 no.10
    • /
    • pp.1-9
    • /
    • 2003
  • In GRID environments, an efficient load balancing algorithm should be adopted since the system performances of GRID system are not homogeneous. In this work, a new two-step mesh-partitioning scheme based on the graph-partitioning scheme was introduced to consider the difference of system performance. In the two-step mesh-partitioning scheme, the system performance weights were calculated to reflect the effect of heterogeneous system performances and WEVM(Weighted Edge and vertex Method) was adopted to minimize the increase' of communications. Numerical experiments were carried out in multi-cluster environment and WAN (Wide Area Network) environment to investigate the effectiveness of the two-step mesh-partitioning scheme.