• Journal of Digital Contents Society
• /
• v.14 no.2
• /
• pp.171-178
• /
• 2013

Desktop grid computing is the computing paradigm that can execute large-scale computing jobs using the desktop resources with heterogeneity and volatility. However, such the computing environment can not guarantee the stability and reliability of task execution because the desktop resources with different performance can freely participate and leave in task execution. Therefore, in this paper, we design resource grouping scheme using k-means clustering algorithm with an aim to provide desktop grid computing with the stability and reliability of task execution. Moreover, we conduct resource grouping using the execution log data of actual desktop grid systems and present application methods of desktop resource groups to fault-tolerance.

• 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.

• 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.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.991-993
• /
• 2005

데스크탑 그리드(Desktop Grid) 환경에서는 자원 제공자인 데스크탑의 자율적 연산 참여와 탈퇴를 허용하기 때문에 기존 데스크탑 그리드 시스템들은 연산 도중 잦은 중단으로 인해 연산의 완료 시간이 지연되고, 연산 수행의 신뢰성이 저하되며 연산의 완료를 보장하지 못하고 있다. 기존의 데스크탑 그리드 시스템들은 이러한 데스크탑의 동적 특성을 반영하지 못하고 있을 뿐만 아니라 데스크탑의 연산 수행 양식을 고려하지 않아 시스템의 안정성과 성능이 저하되었다. 신뢰성 높은 연산 수행을 지원하고, 데스크탑의 비예측적 연산 수행 속성을 극복하기 위해서는 데스크탑의 동적인 특성인 휘발성(volatility)을 고려한 스케줄링이 필요하다. 본 논문에서는 휴리스틱 접근을 통해 동적으로 가변하는 데스크탑의 상태를 보다 정확하게 모델링 하는 가용성 기반 마코브 작업 스케줄링 기법을 제안한다. 제안 기법은 데스크탑의 가용성을 기반으로 과거 연산 수행에 대한 패턴을 확률 모델링하여 미래 연산 수행 유형을 예측함으로써 연산 수행 도중의 불안정한 자원 제공 현상을 완화시키며 안정적인 스케줄링을 지원하여 시스템의 신뢰성과 성능을 향상시킨다.

• Proceedings of the KIEE Conference
• /
• 2002.11c
• /
• pp.585-588
• /
• 2002

Grid provides integral ing system that enables to use distributed computing resource and services as adapts traditional infrastructures to overcome the distributed computing environments. But, computing today is moving away from a restriction of the desktop, becoming diffused into our surrounding and onto our personal digital devices. In such mobile computing environments, users expects to access resource and services at any time from anywhere in such Mobile-Grid computing. This expectation results security issues, since the computing environments is expanded. This paper describes the security challenges in Mobile-Grid computing, explaining why traditional security mechanism fail to meet the demands of these environments. This paper describes policy driven security mechanism enabled entity to use service and data in trust Mobile-Grid environments and a set of security service module that need to be realized in the Mobile-Grid security architecture presents a set of use pattern that show hew these modules can be used for billing service in a secure Mobile-Grid environments.

• 한국전산유체공학회:학술대회논문집
• /
• 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:

• 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.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.7
• /
• pp.1-10
• /
• 2010

The power of computational Grid resources can be utilized on users desktop by employing workflow managers. It also helps scientists to conveniently put together and run their own scientific workflows. Generally, stage-in, process and stage-out are serially executed and workflow systems help automate this process. However, as the data size is exponentially increasing and more and more scientific workflows require multiple processing steps to obtain the desired output, we argue that the data movement will possess high portion of overall running time. In this paper, we improved staging time and design a new scheduler where the system can execute concurrently as many jobs as possible. Our simulation study shows that 10% to 40% improvement in running time can be achieved through our approach.

• Journal of Korea Multimedia Society
• /
• v.19 no.12
• /
• pp.2014-2023
• /
• 2016

Web presence is one of the key issues for extensive deployment of Internet-of-Things (IoT). An obstacle to overcome for Web presence is relatively low computing power of IoT devices. In this paper, we present implementation of an IoT platform based on Constrained Application Protocol (CoAP) which is a web transfer protocol proposed by Internet Engineering Task Force (IETF) for the low performance IoT devices such as Wireless Sensor Network (WSN) nodes and micro-controllers. To qualify the performance of CoAP-based IoT system for such an application as smart grid, we designed a test platform consisting of Raspberry Pi2, Kmote WSN node and a desktop PC. Using open source softwares, CoAP was implemented on top of the platform. Leveraging the GET command defined at CoAP specification, performance of the system was measured in terms of round-trip time (RTT) from web application to the Kmote sensor node. To investigate abnormal cases among the test results, hop-by-hop delays were measured to analyze resulting data. The average response time of CoAP-based communication except the abnormal data was reduced by 23% smaller than the previous research result.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.49 no.5
• /
• pp.81-90
• /
• 2007

Watershed topographical information is required in hydrologic analysis, supporting efficient hydrologic model operation and managing water resources. Watershed topographical data extraction systems based on desktop GIS are abundant these days placing burdens for spatial data processing on users. This paper describes development of a Web-based Geographic Information Systems that can delineate the Geum River sub-basins and extract watershed topographical data in real time. Through this system, users can obtain a watershed boundary by selecting outlet location and then extracting topographical data including watershed area, boundary length, average altitude, slope distribution about the elevation range with Web browsers. Moreover, the system provides watershed hydrological data including land use, soil types, soil drainage conditions, and NRCS(Natural Resources Conservation Service) curve number for hydrologic model operation through grid overlay technique. The system operability was evaluated with the hydrological data of WAMIS(Water Management Information System) with the government operation Web site as reference data.