• Title/Summary/Keyword: Grid Scheduling

Search Result 142, Processing Time 0.019 seconds

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.

Job Scheduling Method Considering the Utilization Patterns of Mobile Devices in Mobile Grid (모바일그리드에서 모바일장치의 이용패턴을 고려한 작업 스케줄링 기법)

  • Song, Sung-Jin;Jung, Soon-Young;Yu, Heon-Chang
    • The Journal of Korean Association of Computer Education
    • /
    • v.11 no.3
    • /
    • pp.91-99
    • /
    • 2008
  • In recent years, wireless networks have been widely deployed and the use of mobile devices has been popularized. As a result, mobile devices are increasingly considered as a resource of the Grid However, there are some problems such as unstable wireless communication and disconnection of mobile devices caused by movement in Mobile Grid Therefore, a scheduling method allocating jobs to the mobile devices should progressively deal with this problem The existing scheduling methods in Mobile Grid have mainly focused on the connection time of mobile devices. The connection time of mobile devices shows typically a regular pattern according to a user's living environments such as vacation/class in school, weekday/weekend in work, and so on. In this paper, we analyze statistics information for the utilization patterns of mobile devices and propose global and local scheduling methods for Mobile Grid, based on the analyzed utilization patterns.

  • PDF

Linear Programming based Optimal Scheduling for Grid-connected Microgrid (선형계획법에 의한 계통연계형 마이크로그리드의 최적 운용에 관한 연구)

  • Park, Jae-Sae
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.8
    • /
    • pp.1622-1626
    • /
    • 2011
  • Recently, interests on microgrids have been growing as clean power systems. Microgrids include small scaled distributed generation such as wind and solar power as well as diesel generators as main power sources. To operate a microgrid effectively, optimal scheduling for the microgrid is important. Especially, in the grid-connected mode, power trades between the microgrid and the power grid should be considered in optimal scheduling. In this paper, mathematic models for optimal operation of a microgrid were established based on the linear programming. In particular, the shiftable load was considered in the models to optimize it in microgrid operation. To show feasibility of the proposed models, they were applied to optimal microgrid operation and the results were discussed.

Power Scheduling of Smart Buildings in the Smart Grid Environment Using IT Optimization Techniques (IT 최적화 기술을 이용한 지능형전력망 환경의 스마트 빌딩 전력 스케줄링)

  • Lee, Eunji;Seo, Yu-Ri;Yoon, So-Young;Jang, Hye-Rin;Bahn, Hyokyung
    • Journal of Information Technology Services
    • /
    • v.11 no.sup
    • /
    • pp.41-50
    • /
    • 2012
  • With the recent advances in smart grid technologies and the increasing dissemination of smart meters, the power usage of each time unit can be detected in modern smart building environments. Thus, the utility company can adopt different price of electricity at each time slot considering the peak time. Korea government also announces the smart-grid roadmap that includes a law for realtime price of electricity. In this paper, we propose an efficient power scheduling scheme for smart buildings that adopt smart meters and real-time pricing of electricity. Our scheme dynamically changes the power mode of each consumer device according to the change of power rates. Specifically, we analyze the electricity demands and prices at each time, and then perform real-time power scheduling of consumer devices based on collaboration of each device. Experimental results show that the proposed scheme reduces the electricity charge of a smart building by up to 36.4%.

A Workqueue Replication Scheduling Algorithm Using Static Information on Grid Systems (그리드 시스템에서 정적정보를 활용한 작업큐 중복 스케줄링 알고리즘)

  • Kang, Oh-Han;Kang, Sang-Sung;Song, Hee-Heon
    • The KIPS Transactions:PartA
    • /
    • v.16A no.1
    • /
    • pp.9-16
    • /
    • 2009
  • Because Grid system consists of heterogenous computing resources, which are distributed on a wide scale, it is impossible to efficiently execute applications with scheduling algorithms of a conventional parallel system that, in contrast, aim at homogeneous and controllable resources. To suggest an algorithm that can fully reflect the characteristics of a grid system, our research is focused on examining the type of information used in current scheduling algorithms and consequently, deriving factors that could develop algorithms further. The results from the analysis of these algorithms not only show that static information of resources such as capacity or the number of processors can facilitate the scheduling algorithms but also verified a decrease in efficiency in case of utilizing real time load information of resources due to the intrinsic characteristics of a grid system relatively long computing time, and the need for the means to evade unfeasible resources or ones with slow processing time. In this paper, we propose a new algorithm, which is revised to reflect static information in the logic of WQR(Workqueue Replication) algorithms and show that it provides better performance than the one used in the existing method through simulation.

Countable-grid Scheduling Method (CSM) and CSM-based Soft-logic Algorithm Development for Automated Construction Scheduling and Visualization (건설 공정계획 자동화와 시각화를 위한 가산 그리드 공정계획 기법(CSM)과 CSM기반 소프트로직 알고리즘 개발 연구)

  • Choi, Heungsoon;Moon, Seonghyeon;Chi, Seokho
    • Korean Journal of Construction Engineering and Management
    • /
    • v.23 no.4
    • /
    • pp.65-77
    • /
    • 2022
  • Schedule management is one of pivotal project success factors during construction projects. However, there are many difficulties in rapid scheduling and controlling since the existing planning techniques require considerable amount of manual work and manager's judgment in a construction project. This research aims to propose a new scheduling method and algorithm for automating and visualizing the planning process, which is called Countable-grid scheduling method. In this method, if the scope of work is defined via a visualized tool, the schedule plan is created automatically according to the productivity and workable conditions of each activity. The location of the work for each date can be visualized in grid-based approach. Moreover, the work schedule can be updated automatically according to the progress. The industrial applicability of the proposed method was verified in construction projects via case study with sample data. This research can contribute to the construction industry by automating the construction schedule management process.

Bargaining-Based Smart Grid Pricing Model for Demand Side Management Scheduling

  • Park, Youngjae;Kim, Sungwook
    • ETRI Journal
    • /
    • v.37 no.1
    • /
    • pp.197-202
    • /
    • 2015
  • A smart grid is a modernized electrical grid that uses information about the behaviors of suppliers and consumers in an automated fashion to improve the efficiency, reliability, economics, and sustainability of the production and distribution of electricity. In the operation of a smart grid, demand side management (DSM) plays an important role in allowing customers to make informed decisions regarding their energy consumption. In addition, it helps energy providers reduce peak load demand and reshapes the load profile. In this paper, we propose a new DSM scheduling scheme that makes use of the day-ahead pricing strategy. Based on the Rubinstein-Stahl bargaining model, our pricing strategy allows consumers to make informed decisions regarding their power consumption, while reducing the peak-to-average ratio. With a simulation study, it is demonstrated that the proposed scheme can increase the sustainability of a smart grid and reduce overall operational costs.

Study on Load Redistribution Mechanism in Grid System (그리드시스템을 위한 부하재분배 메커니즘에 관한 연구)

  • Lee, Seong-Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.9
    • /
    • pp.2350-2353
    • /
    • 2009
  • For applications that are grid enabled, the grid can offer a resource balancing effect by scheduling grid jobs on machines with low utilization. When jobs communicate with each other, the internet, with storage resources, an advanced scheduler could schedule them to minimize communications traffic or minimize the distance of the communications. We propose an load redistribution algorithm to minimize communication traffic and distance of the communication using genetic algorithm. The experiments show the proposed load redistribution algorithm performs efficiently in the variance of load in grid environments.

An Efficient Job Scheduling Strategy for Computational Grid (계산 그리드를 위한 효율적인 작업 스케줄링 정책)

  • Jo, Ji-Hun;Lee, Won-Joo;Jeon, Chang-Ho
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.8
    • /
    • pp.753-757
    • /
    • 2008
  • In this paper, we propose a new scheduling strategy for dynamic programming in Grid environment. The key idea of this scheme is to reduce the execution time of a job by dividing the dynamic table based on the locality of table and allocating jobs to nodes which minimize network latency. This scheme obtains optimal concurrency by constructing the dynamic table using a distributed top down method. Through simulation, we show that the proposed Grid strategy improves the performance of Grid environment compared to previous branch-bound strategies.

Cross-layer Design of Joint Routing and Scheduling for Maximizing Network Capacity of IEEE 802.11s based Multi-Channel SmartGrid NAN Networks (IEEE 802.11s 를 사용한 스마트그리드 NAN 네트워크의 최대 전송 성능을 위한 다중 채널 스케쥴링과 라우팅의 결합 설계)

  • Min, Seok Hong;Kim, Bong Gyu;Lee, Jae Yong;Kim, Byung Chul
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.5
    • /
    • pp.25-36
    • /
    • 2016
  • The goal of the SmartGrid is to maximize energy efficiency by exchanging bi-directional real-time power information with the help of ICT(Information and Communication Technology). In this paper, we propose a "JRS-MS" (Joint Routing and Scheduling for Multi-channel SmartGrid) algorithm that uses numerical modeling methods in IEEE 802.11s based STDMA multi-channel SmartGrid NAN networks. The proposed algorithm controls the amount of data transmission adaptively at the link layer and finds a high data-rate path which has the least interference between traffic flows in multi-channel SmartGrid NAN networks. The proposed algorithm improve transmission performance by enhancing network utilization. By comparing the results of performance analysis between the proposed algorithm and the JRS-SG algorithm in the previous paper, we showed that the JRS-MS algorithm can improve transmission performance by maximally utilizing given network resources when the number of flows are increasing in the multi-hop NAN wireless mesh networks.