• Title/Summary/Keyword: Heterogeneous Grid

Search Result 84, Processing Time 0.032 seconds

Grid Resource Selection System Using Decision Tree Method (의사결정 트리 기법을 이용한 그리드 자원선택 시스템)

  • Noh, Chang-Hyeon;Cho, Kyu-Cheol;Ma, Yong-Beom;Lee, Jong-Sik
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.1
    • /
    • pp.1-10
    • /
    • 2008
  • In order to high-performance data Processing, effective resource selection is needed since grid resources are composed of heterogeneous networks and OS systems in the grid environment. In this paper. we classify grid resources with data properties and user requirements for resource selection using a decision tree method. Our resource selection method can provide suitable resource selection methodology using classification with a decision tree to grid users. This paper evaluates our grid system performance with throughput. utilization, job loss, and average of turn-around time and shows experiment results of our resource selection model in comparison with those of existing resource selection models such as Condor-G and Nimrod-G. These experiment results showed that our resource selection model provides a vision of efficient grid resource selection methodology.

  • PDF

TIGRIS Grid MPI Service based on WSRF (WSRF기반의 TIGRIS 그리드 MPI 서비스)

  • Kwon, Oh-Kyoung;Park, Kyung-Lang;Kwon, Oh-Young;Hahm, Jaegyoon;Lee, Pill Woo
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2007.11a
    • /
    • pp.212-216
    • /
    • 2007
  • In this paper, we describe TIGRIS Grid MPI Service, which is the WS-Resource Framework (WSRF) based services to enable an MPI job to be executed on Grid environments. It covers heterogeneous compute resources and diverse MPI libraries. The main functionalities are as follows. First, it allows an MPI user to seamlessly launch a job without knowing how to use the specific MPI library. Secondly, it executes an MPI job on the cross-site resources by supporting the Grid-enabled MPI library such as MPICH-G2. Thirdly, it enables the user to launch a job using the source code without compiling.

  • PDF

Decentralized Broker-BBsed Model for Resource Management in Grid Computing Environment (그리드 컴퓨팅 환경에서의 자원 관리를 위한 분산화된 브로커 기반 모델)

  • Ma, Yong-Beom;Lee, Jong-Sik
    • Journal of the Korea Society for Simulation
    • /
    • v.16 no.2
    • /
    • pp.1-8
    • /
    • 2007
  • Resource management in grid computing environment is essential for integration and interaction among heterogeneous resources. This paper discusses resource management methods of centralized and decentralized broker-based modeling for solving complex problems of resource management and presents design and development of the decentralized broker-based resource management modeling in grid computing environment. This model comprises a global resource broker and a local resource broker, and we derive reduction of communication and functional dispersion of Job management using a local resource broker. The simulation experiment shows the improvement of resource utilization and average response time and proves that this model improves utilization of resources and replies to user requests promptly.

  • PDF

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.

A JCML and a GUI-based Editor for Specifying Job Control Flow on Grid (그리드에서 작업 흐름을 효과적으로 제어하기 위한 JCML과 GUI 기반의 편집기)

  • 황석찬;최재영;이상산
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.3_4
    • /
    • pp.152-159
    • /
    • 2004
  • The Grid system is an emerging computing infrastructure that will substitute for existing distributed systems. However end users have a difficulty in using the Grid because of its complicated usage, which is an inherent characteristic from the heterogeneous mechanism of the Grid. In this paper, we present the JCML(Job Control Markup Language) and its GUI-based editor, which not only provide users with ease of use, improved working environment, but assist users to execute their jobs efficiently The JCML is a job control language that improves the RSL of Globus, which defines global services in Grid. The JCML is designed to support flexibility among various Grid services using standard XML. And it makes use of a graph representation method, GXL(Graph eXchange Language), to specify detailed job properties and dependencies among jobs using nodes and edges. The JCML editor provides users with GUI-based interface. With the JCML editor, a complicated job order can be easily completed using very simple manipulations with a mouse, such as a drag-and-drop.

Dynamic Resource Ranking and Grouping Algorithm for Grid Computing (그리드 컴퓨팅을 위한 동적 자원 랭킹 및 그룹핑 알고리즘)

  • Yi Jinsung;Park Kiejin;Choi Changyeol;Kim Sungsoo
    • Journal of KIISE:Information Networking
    • /
    • v.32 no.4
    • /
    • pp.471-482
    • /
    • 2005
  • The high-speed network permits Grid computing to handle large problem of management areas and share various computational resources. As there are many resources and changes of them in Grid computing, the resources should be detected effectively and matched correctly with tasks to provide high performance. In this paper, we propose a mechanism that maximizes the performance of Grid computing systems. According to a priority, grade and site of heterogeneous resources, we assign tasks to those resources. Initially, a volunteer's priority and ranking are determined by static information like as CPU speed, RAM size, storage size and network bandwidth. And then, the rank of resources is decided by considering dynamic information such as correctness, response time, and error rate. We find that overall Grid system performance is improved and high correctness using resource reallocation mechanism is achieved.

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
    • /
    • v.14A no.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.

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
    • /
    • v.16 no.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.

NUMERICAL SOLUTION FOR WOOD DRYING ON ONE-DIMENSIONAL GRID

  • Lee, Yong-Hun;Kang, Wook;Chung, Woo-Yang
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.11 no.1
    • /
    • pp.95-105
    • /
    • 2007
  • A mathematical modeling for the drying process of hygroscopic porous media, such as wood, has been developed in the past decades. The governing equations for wood drying consist of three conservation equations with respect to the three state variables, moisture content, temperature and air density. They are involving simultaneous, highly coupled heat and mass transfer phenomena. In recent, the equations were extended to account for material heterogeneity through the density of the wood and via the density variation of the material process, capillary pressure, absolute permeability, bound water diffusivity and effective thermal conductivity. In this paper, we investigate the drying behavior for the three primary variables of the drying process in terms of control volume finite element method to the heterogeneous transport model on one-dimensional grid.

  • PDF

A Study on the Development of Globus-based Grid using Heterogeneous Supercomputing Resources (이기종 슈퍼컴퓨팅 자원들을 활용한 Globus 기반 그리드 구축에 관한 연구)

  • Kang, Kyung-Woo
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2002.04a
    • /
    • pp.345-348
    • /
    • 2002
  • 지난 몇 년 동안 컴퓨터의 처리 속도와 네트워크의 속도는 아주 빠르게 향상되고 있다. 빨라진 네트워크를 이용하여 분산된 자원들을 연결하고 하나의 시스템처럼 사용하고자 하는 노력들이 진행되고 있는데 이와 같은 것을 일반적으로 메타컴퓨팅 또는 그리드라고 부른다. 본 논문에서는 국내 주요 슈퍼컴퓨팅 자원들을 활용한 그리드 개발과 전산유체역학 프로그램을 이용한 가능성 시험을 수행하였다. 시험결과로 분산자원을 이용했을 때 네트워크의 속도에 따라 성능향상을 얻을 수 있었다.

  • PDF