• 제목/요약/키워드: Computing Resource

Search Result 852, Processing Time 0.024 seconds

Task offloading under deterministic demand for vehicular edge computing

  • Haotian Li ;Xujie Li ;Fei Shen
    • ETRI Journal
    • /
    • v.45 no.4
    • /
    • pp.627-635
    • /
    • 2023
  • In vehicular edge computing (VEC) networks, the rapid expansion of intelligent transportation and the corresponding enormous numbers of tasks bring stringent requirements on timely task offloading. However, many tasks typically appear within a short period rather than arriving simultaneously, which makes it difficult to realize effective and efficient resource scheduling. In addition, some key information about tasks could be learned due to the regular data collection and uploading processes of sensors, which may contribute to developing effective offloading strategies. Thus, in this paper, we propose a model that considers the deterministic demand of multiple tasks. It is possible to generate effective resource reservations or early preparation decisions in offloading strategies if some feature information of the deterministic demand can be obtained in advance. We formulate our scenario as a 0-1 programming problem to minimize the average delay of tasks and transform it into a convex form. Finally, we proposed an efficient optimal offloading algorithm that uses the interior point method. Simulation results demonstrate that the proposed algorithm has great advantages in optimizing offloading utility.

Implementation and Performance Aanalysis of Efficient Big Data Processing System Through Dynamic Configuration of Edge Server Computing and Storage Modules (BigCrawler: 엣지 서버 컴퓨팅·스토리지 모듈의 동적 구성을 통한 효율적인 빅데이터 처리 시스템 구현 및 성능 분석)

  • Kim, Yongyeon;Jeon, Jaeho;Kang, Sungjoo
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.16 no.6
    • /
    • pp.259-266
    • /
    • 2021
  • Edge Computing enables real-time big data processing by performing computing close to the physical location of the user or data source. However, in an edge computing environment, various situations that affect big data processing performance may occur depending on temporary service requirements or changes of physical resources in the field. In this paper, we proposed a BigCrawler system that dynamically configures the computing module and storage module according to the big data collection status and computing resource usage status in the edge computing environment. And the feature of big data processing workload according to the arrangement of computing module and storage module were analyzed.

Minimizing the Risk of an Open Computing Environment Using the MAD Portfolio Optimization (최적포트폴리오 기법을 이용한 개방형 전산 환경의 안정성 확보에 관한 연구)

  • Kim, Hak-Jin;Park, Ji-Hyoun
    • Journal of Intelligence and Information Systems
    • /
    • v.15 no.2
    • /
    • pp.15-31
    • /
    • 2009
  • The next generation IT environment is expected to be an open computing environment based on Grid computing technologies, which allow users to access to any type of computing resources through networks. The open computing environment has benefits in aspects of resource utilization, collaboration, flexibility and cost reduction. Due to the variation in performance of open computing resources, however, resource allocation simply based on users' budget and time constraints often fails to meet the Service Level Agreement(SLA). This paper proposes the Mean-Absolute Deviation(MAD) portfolio optimization approach, in which service brokers consider the uncertainty of performance of resources, and compose resource portfolios that minimize the uncertainty. In order to investigate the effect of this approach, we simulate an open computing environment with varying uncertainty levels, users' constraints, and brokers' optimization strategies. The simulation result concludes threefolds. First, the MAD portfolio optimization improves the success ratio of delivering the required performance to users. Second, the success ratio depends on the accuracy in predicting the variability of performance. Thirdly, the measured variability can also help service brokers expand their service to cost-critical users by discounting the access cost of open computing resources.

  • PDF

A Workflow Execution System for Analyzing Large-scale Astronomy Data on Virtualized Computing Environments

  • Yu, Jung-Lok;Jin, Du-Seok;Yeo, Il-Yeon;Yoon, Hee-Jun
    • International Journal of Contents
    • /
    • v.16 no.4
    • /
    • pp.16-25
    • /
    • 2020
  • The size of observation data in astronomy has been increasing exponentially with the advents of wide-field optical telescopes. This means the needs of changes to the way used for large-scale astronomy data analysis. The complexity of analysis tools and the lack of extensibility of computing environments, however, lead to the difficulty and inefficiency of dealing with the huge observation data. To address this problem, this paper proposes a workflow execution system for analyzing large-scale astronomy data efficiently. The proposed system is composed of two parts: 1) a workflow execution manager and its RESTful endpoints that can automate and control data analysis tasks based on workflow templates and 2) an elastic resource manager as an underlying mechanism that can dynamically add/remove virtualized computing resources (i.e., virtual machines) according to the analysis requests. To realize our workflow execution system, we implement it on a testbed using OpenStack IaaS (Infrastructure as a Service) toolkit and HTCondor workload manager. We also exhaustively perform a broad range of experiments with different resource allocation patterns, system loads, etc. to show the effectiveness of the proposed system. The results show that the resource allocation mechanism works properly according to the number of queued and running tasks, resulting in improving resource utilization, and the workflow execution manager can handle more than 1,000 concurrent requests within a second with reasonable average response times. We finally describe a case study of data reduction system as an example application of our workflow execution system.

Bidding Strategically for Scheduling in Grid Systems

  • Naddaf, Babak;Habibi, Jafar
    • Journal of Information Processing Systems
    • /
    • v.5 no.2
    • /
    • pp.87-96
    • /
    • 2009
  • Grid computing is a new technology which involves efforts to create a huge source of processing power by connecting computational resources throughout the world. The key issue of such environments is their resource allocation and the appropriate job scheduling strategy. Several approaches to scheduling in these environments have been proposed to date. Market driven scheduling as a decentralized solution for such complicated environments has introduced new challenges. In this paper the bidding problem with regard to resources in the reverse auction resource allocation model has been investigated and the new bidding strategies have been proposed and investigated.

Robust Web Server System Using Virtual Machine Against DOS Attack (가상머신을 이용한 DoS 공격에 강건한 웹 서버 시스템)

  • Park, Seung Kyu;Yang, Hawan Seok;Kim, Bae Hyun
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.9 no.1
    • /
    • pp.1-7
    • /
    • 2013
  • The cloud computing is technology which gives flexible and solid infrastructure to IT environment. With this technology multiple computing environment can be consolidated in to a single server so that maximize system resource utilization. Better processing power can be achieved with less system resource. IT manager can cope with increasing unnecessary cost for additional server and management cost as well. This means a enterprise is able to provide services with better quality and create new services with surplus resource. The time required for recovery from system failure will be reduced from days to minutes. Enhanced availability and continuity of enterprise business minimize the codt and the risk produced by service discontinuity. In this paper, we propose framework architecture that is strong against denial-of-service attack.

Energy Aware Task Scheduling for a Distributed MANET Computing Environment

  • Kim, Jaeseop;Kim, Jong-Kook
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.4
    • /
    • pp.987-992
    • /
    • 2016
  • This study introduces an example environment where wireless devices are mobile, devices use dynamic voltage scaling, devices and tasks are heterogeneous, tasks have deadline, and the computation and communication power is dynamically changed for energy saving. For this type of environment, the efficient system-level energy management and resource management for task completion can be an essential part of the operation and design of such systems. Therefore, the resources are assigned to tasks and the tasks may be scheduled to maximize a goal which is to minimize energy usage while trying to complete as many tasks as possible by their deadlines. This paper also introduces mobility of nodes and variable transmission power for communication which complicates the resource management/task scheduling problem further.

Definition of Network Resource and Network Service Interface for Grid Network Resource Manager (그리드 네트워크 자원 관리기를 위한 네트워크 자원과 네트워크 서비스 인터페이스의 정의)

  • Kim, Hae-Hyun;Cha, Young-Wook;Han, Jang-Soo;Kim, Choon-Hee;Kong, Jong-Uk;Seok, Woo-Jin
    • The KIPS Transactions:PartC
    • /
    • v.16C no.4
    • /
    • pp.511-520
    • /
    • 2009
  • Grid technology enables high performance computation and mass data processing by connecting geographically distributed computing resources to high-speed network. To carry on grid tasks requiring guaranteed quality of service, we need to build converged infrastructure which controls and manages network resources as well as computing resources. In this paper, we defined grid network service interface and information model to support grid network path, resource creation and reservation. In addition to resource creation and reservation messages of the existing GLIF, grid network path and notification messages were defined in the grid network service interface. We also defined related statuses and messages for two-phase resource reservation mechanism. We designed and implemented network resource management system based on the grid network information model and service interface. We experimented in resource reservation, allocation and release of network resources in grid environment with GMPLS control and transport network.

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.

Energy-aware Multi-dimensional Resource Allocation Algorithm in Cloud Data Center

  • Nie, Jiawei;Luo, Juan;Yin, Luxiu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.9
    • /
    • pp.4320-4333
    • /
    • 2017
  • Energy-efficient virtual resource allocation algorithm has become a hot research topic in cloud computing. However, most of the existing allocation schemes cannot ensure each type of resource be fully utilized. To solve the problem, this paper proposes a virtual machine (VM) allocation algorithm on the basis of multi-dimensional resource, considering the diversity of user's requests. First, we analyze the usage of each dimension resource of physical machines (PMs) and build a D-dimensional resource state model. Second, we introduce an energy-resource state metric (PAR) and then propose an energy-aware multi-dimensional resource allocation algorithm called MRBEA to allocate resources according to the resource state and energy consumption of PMs. Third, we validate the effectiveness of the proposed algorithm by real-world datasets. Experimental results show that MRBEA has a better performance in terms of energy consumption, SLA violations and the number of VM migrations.