• Title/Summary/Keyword: Grid Scheduling

Search Result 142, Processing Time 0.036 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.

Real-Time Job Scheduling Strategy for Grid Computing (그리드 컴퓨팅을 위한 실시간 작업 스케줄링 정책)

  • Choe, Jun-Young;Lee, Won-Joo;Jeon, Chang-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.2
    • /
    • pp.1-8
    • /
    • 2010
  • In this paper, we propose a scheduling strategy for grid environment that reduces resource cost. This strategy considers resource cost and job failure rate to efficiently allocate local computing resources. The key idea of our strategy is that we use two-level scheduling using remote and local scheduler. The remote scheduler determines the expected total execution times of jobs using the current network and local system status maintained in its resource database and allocates jobs with minimum total execution time to local systems. The local scheduler recalculates the waiting time and execution time of allocated job and uses it to determine whether the job can be processed within the specified deadline. If it cannot finish in time, the job is migrated other local systems, through simulation, we show that it is more effective to reduce the resource cost than the previous Greedy strategy. We also show that the proposed strategy improves the performance compared to previous Greedy strategy.

Meta Service: Mapping of a Service Request to a Workflow in Grid Environments (그리드 환경에서 워크플로우의 서비스 매핑을 위한 메타 서비스)

  • Lee, Sang-Keon;Choi, Jae-Young;Hwang, Seog-Chan
    • The KIPS Transactions:PartA
    • /
    • v.12A no.4 s.94
    • /
    • pp.289-296
    • /
    • 2005
  • Many jobs in Grid environments consist of several subtasks, and these subtasks can be represented by a workflow, which is executed effectively on a Grid. In this paper, we present Meta services which describe a mapping from a service request to a workflow in Grid environments. By using Meta services, a workflow in Grid environments could adapts various service concepts such as portal services, Grid services, and Web services. And the workflow can be shared and reused among workflow users. Furthermore, historical performance data can be included in Meta services, so effective scheduling of the workflow is also possible.

Implementation of Web-based Grid Scheduling Platform (웹기반 그리드 스케줄링 플랫폼의 구현)

  • Kang, Sang-Sung;Kang, Oh-Han
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.1015-1017
    • /
    • 2005
  • 본 논문에서는 웹기반의 그리드 컴퓨팅 환경에서 시스템을 모델링하고 스케줄링 기법을 시뮬레이션 할 수 있는 그리드 스케줄링 플랫폼을 설계하고 구현하였다. 구현한 웹기반 그리드 스케줄링 플랫폼은 자바 환경의 그리드 스케줄링 툴킷인 GridSim을 시뮬레이션 도구로 활용하였으며, 자원 모델링, 작업 모델링, 알고리즘 컴파일, 시뮬레이션을 웹 환경에서 빠르게 수행할 수 있다. 구축한 스케줄링 플랫폼은 향후 그리드 연구에 기반구조로 활용될 수 있으며 스케줄링 기법의 성능 분석을 위한 도구로 사용될 수 있다.

  • PDF

A Point-based Scheduling Algorithm for GRID Environment (GRID 환경을 위한 포인트 기반 스케줄링 알고리즘)

  • 오영은;김진석
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10a
    • /
    • pp.403-405
    • /
    • 2003
  • 지역적으로 분산되어 있는 고성능의 컴퓨팅 자원들을 한 데 묶어 이용하는 그리드 기술이 발전함에 따라, 그리드 환경에서의 스케줄링이 절실히 필요하게 되었다. 본 논문에서는 그리드 자원 정보를 이용하여 그리드 자원을 효율적으로 이용할 수 있는 스케줄링 알고리즘에 대하여 고찰해보고, 자원의 성능을 고려한 스케줄링 알고리즘을 설계하여 실험하였다. 이러한 실험을 위하여 그리드 환경을 시뮬레이션 하였으며, 이 결과를 다른 알고리즘과 비교하였다.

  • PDF

A Scheduling Algorithm for Improving Response Time in Grid-based Web Service (그리드(Grid)기반 웹 서비스(Web Service)의 응답 시간 향상을 위한 스케쥴링 기법)

  • 박미선;박기진
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10a
    • /
    • pp.424-426
    • /
    • 2003
  • 웹 서비스의 사용이 급격히 증가함에 따라 사용자의 웹 서비스 005(Quality of Services)에 대란 관심도 높아지고 있다. 본 논문에서는 QoS 요소들 중 응답 시간(Response time) 향상에 대한 스케줄링 기법을 제안하여, 서비스의 질을 향상시키고자 한다. 구체적으로는 기존의 그리드 시스템에 사용되고 있는 단일 배치 스케줄링 기법을 기본으로 한 다중 배치 스케줄링을 연구하였으며, 이를 통해 그리드 기반 웹 서비스의 응답 시간 성능이 개선됨을 확인하였다.

  • PDF

Scheduling of Die Casting Processes Considering Power Usage (전력 사용을 고려한 다이캐스팅 공정의 스케줄링)

  • Yang, Jung-Min;Park, Yong-Kuk
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.8
    • /
    • pp.3358-3365
    • /
    • 2012
  • This paper presents a scheduling scheme for die casting processes considering power usage. The scheduling problem of a shift-based die casting process is represented by a linear programming (LP) model that maximizes the average efficiency of melting furnaces in regard of the usage of molten alloy, where the product quantities of each shift are used as primary variables. In this research, we propose a novel LP model that considers power usage of foundries. The developed LP model can derive product plans in which the expended power of a casting shift does not exceed a prescribed limit, while optimizing the efficiency of alloy usage. The simulation result of a case study demonstrates the superiority and applicability of the proposed scheme. This paper serves as a basic research on the role of foundries as an intelligent costumer in smart grid environment where the limit of power usage should be fulfilled.

Optimal Hourly Scheduling of Community-Aggregated Electricity Consumption

  • Khodaei, Amin;Shahidehpour, Mohammad;Choi, Jaeseok
    • Journal of Electrical Engineering and Technology
    • /
    • v.8 no.6
    • /
    • pp.1251-1260
    • /
    • 2013
  • This paper presents the optimal scheduling of hourly consumption in a residential community (community, neighborhood, etc.) based on real-time electricity price. The residential community encompasses individual residential loads, communal (shared) loads, and local generation. Community-aggregated loads, which include residential and communal loads, are modeled as fixed, adjustable, shiftable, and storage loads. The objective of the optimal load scheduling problem is to minimize the community-aggregated electricity payment considering the convenience of individual residents and hourly community load characteristics. Limitations are included on the hourly utility load (defined as community-aggregated load minus the local generation) that is imported from the utility grid. Lagrangian relaxation (LR) is applied to decouple the utility constraint and provide tractable subproblems. The decomposed subproblems are formulated as mixed-integer programming (MIP) problems. The proposed model would be used by community master controllers to optimize the utility load schedule and minimize the community-aggregated electricity payment. Illustrative optimal load scheduling examples of a single resident as well as an aggregated community including 200 residents are presented to show the efficiency of the proposed method based on real-time electricity price.

Estimation of Reasonable Price of Battery Energy Storage System for Electricity Customers Demand Management (전력소비자 수요관리용 전지전력저장시스템의 적정 가격 산정)

  • Kim, Seul-Ki;Cho, Kyeong-Hee;Kim, Jong-Yul;Kim, Eung-Sang
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.62 no.10
    • /
    • pp.1390-1396
    • /
    • 2013
  • The paper estimated the reasonable market price of lead-acid battery energy storage system (BESS) intended for demand management of electricity customers. As time-of-use (TOU) tariffs have extended to a larger number of customers and gaps in the peak and off-peak rates have gradually risen, deployment of BESS has been highly needed. However, immature engineering techniques, lack of field experiences and high initial investment cost have been barriers to opening up ESS markets. This paper assessed electricity cost that BESS operation could save for customers and, based on the possible cost savings, estimated reasonable prices at which BESSs could become a more prospective option for demand management of customers. Battery scheduling was optimized to maximize the electricity cost savings that BESS would possibly achieve under TOU tariffs conditions. Basic economic factors such as payback period and return on investment were calculated to determine reasonable market prices. Actual load data of 12 industrial customers were used for case studies.

Two-Tree Collective Communication in Grid Computing Systems (그리드 컴퓨팅 시스템에서의 두 개의 트리를 이용한 집합 통신)

  • 차광호;이정희;한동수;유찬수
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.5
    • /
    • pp.450-459
    • /
    • 2004
  • This paper studies the collective communication in the grid computing environment, which is characterized by the combination of heterogeneous networks as well as uneven, long communication delay. Efficient collective communication requires communication schedule, which in turn requires network information. When the network information is not accurate or network faults occur, the performance of collective communication can be markedly degraded. This paper proposes TTCC(Two-Tree Collective Communication) for scheduling collective communication in the grid. It Provides an efficient and reliable schedule even In this unfavorable network condition by maintaining two disjoint communication trees. Benefits of the proposed method are manifested via simulation, where the performance degradation with TTCC is much slower than those using conventional scheduling algorithms.