• Title/Summary/Keyword: Virtual Resource Scheduling

Search Result 33, Processing Time 0.025 seconds

A Cost-Efficient Job Scheduling Algorithm in Cloud Resource Broker with Scalable VM Allocation Scheme (클라우드 자원 브로커에서 확장성 있는 가상 머신 할당 기법을 이용한 비용 적응형 작업 스케쥴링 알고리즘)

  • Ren, Ye;Kim, Seong-Hwan;Kang, Dong-Ki;Kim, Byung-Sang;Youn, Chan-Hyun
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.1 no.3
    • /
    • pp.137-148
    • /
    • 2012
  • Cloud service users request dedicated virtual computing resource from the cloud service provider to process jobs in independent environment from other users. To optimize this process with automated method, in this paper we proposed a framework for workflow scheduling in the cloud environment, in which the core component is the middleware called broker mediating the interaction between users and cloud service providers. To process jobs in on-demand and virtualized resources from cloud service providers, many papers propose scheduling algorithms that allocate jobs to virtual machines which are dedicated to one machine one job. With this method, the isolation of being processed jobs is guaranteed, but we can't use each resource to its fullest computing capacity with high efficiency in resource utilization. This paper therefore proposed a cost-efficient job scheduling algorithm which maximizes the utilization of managed resources with increasing the degree of multiprogramming to reduce the number of needed virtual machines; consequently we can save the cost for processing requests. We also consider the performance degradation in proposed scheme with thrashing and context switching. By evaluating the experimental results, we have shown that the proposed scheme has better cost-performance feature compared to an existing scheme.

Virtual Machine Provisioning Scheduling with Conditional Probability Inference for Transport Information Service in Cloud Environment (클라우드 환경의 교통정보 서비스를 위한 조건부 확률 추론을 이용한 가상 머신 프로비저닝 스케줄링)

  • Kim, Jae-Kwon;Lee, Jong-Sik
    • Journal of the Korea Society for Simulation
    • /
    • v.20 no.4
    • /
    • pp.139-147
    • /
    • 2011
  • There is a growing tendency toward a vehicle demand and a utilization of traffic information systems. Due to various kinds of traffic information systems and increasing of communication data, the traffic information service requires a very high IT infrastructure. A cloud computing environment is an essential approach for reducing a IT infrastructure cost. And the traffic information service needs a provisioning scheduling method for managing a resource. So we propose a provisioning scheduling with conditional probability inference (PSCPI) for the traffic information service on cloud environment. PSCPI uses a naive bayse inference technique based on a status of a virtual machine. And PSCPI allocates a job to the virtual machines on the basis of an availability of each virtual machine. Naive bayse based PSCPI provides a high throughput and an high availability of virtual machines for real-time traffic information services.

Thread Block Scheduling for GPGPU based on Fine-Grained Resource Utilization (상세 자원 이용률에 기반한 병렬 가속기용 스레드 블록 스케줄링)

  • Bahn, Hyokyung;Cho, Kyungwoon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.5
    • /
    • pp.49-54
    • /
    • 2022
  • With the recent widespread adoption of general-purpose GPUs (GPGPUs) in cloud systems, maximizing the resource utilization through multitasking in GPGPU has become an important issue. In this article, we show that resource allocation based on the workload classification of computing-bound and memory-bound is not sufficient with respect to resource utilization, and present a new thread block scheduling policy for GPGPU that makes use of fine-grained resource utilizations of each workload. Unlike previous approaches, the proposed policy reduces scheduling overhead by separating profiling and scheduling, and maximizes resource utilizations by co-locating workloads with different bottleneck resources. Through simulations under various virtual machine scenarios, we show that the proposed policy improves the GPGPU throughput by 130.6% on average and up to 161.4%.

Resource Management Scheme in Proxy-Based Mobile Grid (프록시기반 모바일 그리드에서 자원관리 기법)

  • Cho, InSeock;Lee, DaeWon;Lee, HwaMin;Gil, JoonMin;Yu, HeonChang
    • The Journal of Korean Association of Computer Education
    • /
    • v.11 no.5
    • /
    • pp.67-76
    • /
    • 2008
  • Grid computing has a large scale virtual computing environment that enables a collaborative processing through sharing resources of geographically distributed organizations. In recent year, the development of wireless networks and mobile devices enables mobile devices to consider as a resource of the grids. However, there are some problems such as low performance of processors, small capacity of storages, limited capacity of battery, and low bandwidth. In this paper, to overcome these limitations occurred in mobile grid environments, we proposed a proxy-based mobile grid system. Our proposed system enables mobile devices to play roles as a resource consumer and a resource provider and to collaborate with wired grids through a mobile router. Also, we propose an adaptive job scheduling scheme to cope with context changes of mobile devices and compare our scheduling scheme with other scheduling schemes using a simulation tool, SimGrid, to verify the validity of our job scheduling scheme.

  • PDF

A Control Model for Prototyping Virtual Factory Simulator in Computer Integrated Manufacturing Environment (통합생산환경에서의 가상공장 시물레이터 개발을 위한 제어모형)

  • Namkyu Park;Hyun Jung Lee
    • The Journal of Society for e-Business Studies
    • /
    • v.1 no.1
    • /
    • pp.227-247
    • /
    • 1996
  • Presented in this paper is a control model for developing virtual factory simulator, which is being operated under the distributed environment. The control model consists of production activity plan and information flows. To incorporate elements of the characteristics of the distributed control system, we suggested a collaboration model. This model is working under the client/server architecture, and also designed for cooperative-distributed shop control(CDSC) system in order to exploit several advantages of client/server architecture. Collaboration among each agent(or client) is done through negotiation and task sharing. Based on a contract net model, the CDSC system has three kinds of agents-order agent, resource agent, and communication forwarding agent. Each agent performs shop scheduling and control through negotiation on contract net. No node in CDSC system can have authority over other node. A bidding scheme is employed far negotiation between order agent and resource agents. The CDSC system can support re-negotiation among resource agents and an algorithm for re-negotiation is also developed. Experimental results are shown to advocate the effectiveness of the CDSC system for CIM environments.

  • PDF

Large-scale Virtual Power Plant Management Method Considering Variable and Sensitive Loads (가변 및 민감성 부하를 고려한 대단위 가상 발전소 운영 방법)

  • Park, Yong Kuk;Lee, Min Goo;Jung, Kyung Kwon;Lee, Yong-Gu
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.5
    • /
    • pp.225-234
    • /
    • 2015
  • Nowadays a Virtual Power Plant (VPP) represents an aggregation of distributed energy resource such as Distributed Generation (DG), Combined Heat and Power generation (CHP), Energy Storage Systems (ESS) and load in order to operate as a single power plant by using Information and Communication Technologies, ICT. The VPP has been developed and verified based on a single virtual plant platform which is connected with a number of various distributed energy resources. As the VPP's distributed energy resources increase, so does the number of data from distributed energy. Moreover, it is obviously inefficient in the aspects of technique and cost that a virtual plant platform operates in a centralized manner over widespread region. In this paper the concept of the large-scale VPP which can reduce a error probability of system's load and increase the robustness of data exchange among distributed energy resources will be proposed. In addition, it can directly control and supervise energy resource by making small size's virtual platform which can make a optimal resource scheduling to consider of variable and sensitive load in the large-scale VPP. It makes certain the result is verified by simulation.

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.

A Resource Reservation Protocol and Packet Scheduling for Qos Provisioning in Hose-based VPNs (Hose 기반 VPN에서의 서비스품질 제공을 위한 자원예약 프로토콜과 패킷 스케줄링 기법)

  • Byun Hae-Sun;Woo Hyun-Je;Kim Kyoung-Min;Lee Mee-Jeong
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.3
    • /
    • pp.247-256
    • /
    • 2006
  • Among the resource provisioning mechanisms for the hose based Virtual Private Network (VPN) Quality of Service (QoS ), VPN-specific state provisioning allows the service provider to obtain highest resource multiplexing gains. However, dynamic and automatic resource reservation for the VPN-specific state provisioning is difficult due to the lack of appropriate resource reservation protocol. Furthermore, users of a VPN may experience unfair usage of resources among themselves since the reserved resources of a VPN are shared by the VPN users in a similar way that the traditional LAN bandwidth is shared by the attached hosts. In this paper, we propose a resource reservation protocol and a traffic service mechanism, which not only enable dynamic and automatic resource reservation according to the VPN-specific state provisioning algorithm, but also enforce the fair usage of reserved resources among the users of a VPN in case of congestion.

Network function virtualization (NFV) resource allocation (RA) scheme and research trend (네트워크기능 가상화 (NFV) 자원할당 (RA) 방식과 연구동향)

  • Kim, Hyuncheol;Yoon, Seunghyun;Jeon, Hongseok;Lee, Wonhyuk
    • Convergence Security Journal
    • /
    • v.16 no.7
    • /
    • pp.159-165
    • /
    • 2016
  • Through the NFV (Network Function Virtualization), companies such as network service providers and carriers have sought to dramatically reduce CAPEX / OPEX by improving the speed of new service provisioning and flexibility of network construction through the S/W-based devices provided by NFV. One of the most important considerations for establishing an NFV network to provide dynamic services is to determine how to dynamically allocate resources (VNFs), the basic building blocks of network services, in the right place. In this paper, we analyzed the latest research trends on VNF node, link allocation, and scheduling in nodes that are required to provide arbitrary NS in NFV framework. In this paper, we also propose VNF scheduling problems that should be studied further in RA (Resource Allocation).

Local Scheduling method based on the User Pattern for Korea@Home Agent (Korea@Home 에이전트를 위한 사용자패턴기반의 로컬 스케줄링기법)

  • Choi, JiHyun;Kim, Mikyoung;Choi, JangWon
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2007.11a
    • /
    • pp.226-230
    • /
    • 2007
  • This paper proposes a local scheduling method based on user pattern for Volunteer computing project, Korea@Home. It enables Korea@Home participants to run the agent without disturbance. It is devised to prevent user's application from delay while running the agent and decreases the frequency of switching resource between the user and the agent. We analyze the user's patterns of donating computing resource with Korea@Home which is a representative volunteer computing project in Korea. It has contributed the computing power to several applications including climate prediction and virtual screening. It promotes the volunteers to participate continuously without disturbance and increases the potential computing power with non-disturbance scheduling based on user usage pattern for Volunteer Computing.

  • PDF