• Title/Summary/Keyword: Desktop Grids

Search Result 5, Processing Time 0.016 seconds

A Log Analysis System with REST Web Services for Desktop Grids and its Application to Resource Group-based Task Scheduling

  • Gil, Joon-Min;Kim, Mi-Hye
    • Journal of Information Processing Systems
    • /
    • v.7 no.4
    • /
    • pp.707-716
    • /
    • 2011
  • It is important that desktop grids should be able to aggressively deal with the dynamic properties that arise from the volatility and heterogeneity of resources. Therefore, it is required that task scheduling be able to positively consider the execution behavior that is characterized by an individual resource. In this paper, we implement a log analysis system with REST web services, which can analyze the execution behavior by utilizing the actual log data of desktop grid systems. To verify the log analysis system, we conducted simulations and showed that the resource group-based task scheduling, based on the analysis of the execution behavior, offers a faster turnaround time than the existing one even if few resources are used.

Fuzzy Inference-based Replication Scheme for Result Verification in Desktop Grids (데스크톱 그리드에서 결과 검증을 위한 퍼지 추론 기반 복제 기법)

  • Gil, Joon-Min;Kim, Hong-Soo;Jung, Soon Young
    • The Journal of Korean Association of Computer Education
    • /
    • v.12 no.4
    • /
    • pp.65-75
    • /
    • 2009
  • The result verification is necessary to support a guarantee for the correctness of the task results be executed by any unspecified resources in desktop grid environments. Typically, voting-based and trust-based result verification schemes have been used in the environments. However, these suffer from two potential problems: waste of resources due to redundant replicas of each task and increase in turnaround time due to the inability to deal with a dynamic changeable execution environment. To overcome these problems, we propose a fuzzy inference-based replication scheme which can adaptively determine the number of replicas per task by using both trusty degree and result return probability of resources. Therefore our proposal can reduce waste of resources by determining the number of replicas meeting with a dynamic execution environment of desktop grids, not to mention an enhancement of turnaround time for entire asks. Simulation results show that our scheme is superior to other ones in terms of turnaround time, the waste of resources, and the number of re-replications per task.

  • PDF

CURRENT STATUS OF SUPERCOMPUTING TRENDS (국내외 슈퍼컴퓨팅 동향)

  • Cho, K.W.
    • 한국전산유체공학회:학술대회논문집
    • /
    • 2006.10a
    • /
    • pp.210-210
    • /
    • 2006
  • IT technologies(Chips, Grid and e-Science) are rapidly changed from 1965. In 1965, Intel co-founder Gordon Mooresaq the future. His prediction popularly known as Moore's law, state that the computer chips double in power every 18 months Grid computing offers a model for solving massive computational problems by making use of the unused resources of large numbers of disparate, often desktop, computers treated as a virtual cluster embedded in a distributed telecommunications infrastructure. In this paper, I will discuss current status of supercomputing technology and haw we can use these on CFD. Functionally, one can classify Grids into several types:

  • PDF

An Efficient Scheduling Method Taking into Account Resource Usage Patterns on Desktop Grids (데스크탑 그리드에서 자원 사용 경향성을 고려한 효율적인 스케줄링 기법)

  • Hyun Ju-Ho;Lee Sung-Gu;Kim Sang-Cheol;Lee Min-Gu
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.7
    • /
    • pp.429-439
    • /
    • 2006
  • A desktop grid, which is a computing grid composed of idle computing resources in a large network of desktop computers, is a promising platform for compute-intensive distributed computing applications. However, due to reliability and unpredictability of computing resources, effective scheduling of parallel computing applications on such a platform is a difficult problem. This paper proposes a new scheduling method aimed at reducing the total execution time of a parallel application on a desktop grid. The proposed method is based on utilizing the histories of execution behavior of individual computing nodes in the scheduling algorithm. In order to test out the feasibility of this idea, execution trace data were collected from a set of 40 desktop workstations over a period of seven weeks. Then, based on this data, the execution of several representative parallel applications were simulated using trace-driven simulation. The simulation results showed that the proposed method improves the execution time of the target applications significantly when compared to previous desktop grid scheduling methods. In addition, there were fewer instances of application suspension and failure.

A Study on Task Result Verification using Resource Clustering in Desktop Grids (데스크톱 그리드에서 자원 클러스터링을 이용한 작업 결과 검증에 관한 연구)

  • Kang, Jihun;Song, SungJin;Gil, Joon-Min
    • Annual Conference of KIPS
    • /
    • 2015.04a
    • /
    • pp.176-178
    • /
    • 2015
  • 데스크톱 그리드에서는 휘발성과 이질성과 같은 동적 특성을 갖는 자원의 자율적인 수행에 의해 얻어진 작업 결과의 검증이 중요하다. 이를 위해, 본 논문에서는 자원의 동적 특성을 신뢰도와 결과반환확률로 정의하고 k-means 클러스터링 알고리즘을 적용하여 자원들을 자원 그룹으로 분류하고, 분류된 자원 그룹에 따라 작업의 복제수를 결정하는 자원 클러스터링 기반의 컬과 검증 기법을 제안한다.