• Title/Summary/Keyword: Computing Resource

Search Result 852, Processing Time 0.027 seconds

IoT Collaboration System Based on Edge Computing for Smart Livestock System (스마트 축사를 위한 에지 컴퓨팅 기반 IoT 협업 시스템)

  • Ahn, Chi-Hyun;Lee, Hyungtak;Chung, Kwangsue
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.2
    • /
    • pp.258-264
    • /
    • 2022
  • The smart farm for livestock, in which information and communication technology (ICT) is combined with livestock farm, is mostly based on the cloud computing paradigm. A cloud-based smart livestock farm has disadvantages such as increased response time, burden on cloud resource caused by the increased number of IoT sensors, traffic burden on the network, and lack of failure resilience mechanisms through collaboration with adjacent IoT devices. In this paper, with these problems in mind, we propose an IoT collaboration system based on edge computing. By using the relatively limited computing resources of the edge device to share the cloud's web server function, we aim to reduce the cloud's resources needed and improve response time to user requests. In addition, through the heartbeat-based failure recovery mechanism, IoT device failures were detected and appropriate measures were taken.

Design of A new Algorithm by Using Standard Deviation Techniques in Multi Edge Computing with IoT Application

  • HASNAIN A. ALMASHHADANI;XIAOHENG DENG;OSAMAH R. AL-HWAIDI;SARMAD T. ABDUL-SAMAD;MOHAMMED M. IBRAHM;SUHAIB N. ABDUL LATIF
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.4
    • /
    • pp.1147-1161
    • /
    • 2023
  • The Internet of Things (IoT) requires a new processing model that will allow scalability in cloud computing while reducing time delay caused by data transmission within a network. Such a model can be achieved by using resources that are closer to the user, i.e., by relying on edge computing (EC). The amount of IoT data also grows with an increase in the number of IoT devices. However, building such a flexible model within a heterogeneous environment is difficult in terms of resources. Moreover, the increasing demand for IoT services necessitates shortening time delay and response time by achieving effective load balancing. IoT devices are expected to generate huge amounts of data within a short amount of time. They will be dynamically deployed, and IoT services will be provided to EC devices or cloud servers to minimize resource costs while meeting the latency and quality of service (QoS) constraints of IoT applications when IoT devices are at the endpoint. EC is an emerging solution to the data processing problem in IoT. In this study, we improve the load balancing process and distribute resources fairly to tasks, which, in turn, will improve QoS in cloud and reduce processing time, and consequently, response time.

Relative Speed based Task Distribution Algorithm for Smart Device Cluster (스마트 디바이스로 구성된 클러스터를 위한 상대속도 기반 작업 분배 기법)

  • Lee, Jaehun;Kang, Sooyong
    • The Journal of Korean Institute of Next Generation Computing
    • /
    • v.13 no.3
    • /
    • pp.60-71
    • /
    • 2017
  • Smart devices such as smart phones, smart TVs, and smart pads have become essential devices in recent years. As the popularity and demand grows, the performance of smart devices is also getting better and users are dealing with a lot of things such as education and business using smart devices instead of desktop. However, smart devices that still have poor performance compared to desktop, even with improved performance, have difficulty running high performance applications due to limited resources. In this paper, we propose a load balancing algorithm applying the characteristics of smart devices to overcome the resource limitations of devices. in order to verify the algorithm, we implemented the algorithm after adding the distributed processing system service in Android platform. After constructing the cluster on the smart device, various experiments were conducted. Through the analysis of the test results, it is confirmed that the proposed algorithm efficiently improves the overall distributed processing performance by effectively aggregating different amounts of computing resources in heterogeneous smart devices.

The Personalized Resource Sharing System in Ubiquitous Environments (유비쿼터스 환경에서 사용자 맞춤 자원 공유 시스템)

  • Park, Won-Ik;Lee, Yong-Dae;Choe, Hwan-Su;Gang, Seon-Hui;Jang, Seo-Yun;Park, Jong-Hyeon;Kim, Yeong-Guk;Gang, Ji-Hun
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2007.11a
    • /
    • pp.272-275
    • /
    • 2007
  • 유비쿼터스 환경은 보이지 않는 수많은 장치들과 소프트웨어들이 서로 연결되어 각각의 사용자들에게 편리한 서비스를 제공한다. 이러한 서비스를 제공 받기 위해서는 사용자와 서비스간의 매개체 역할을 하는 모바일 디바이스가 필요하다. 하지만 자원이 제한적인 모바일 디바이스의 특성상 다양한 서비스를 이용할 수는 없다. 따라서 본 논문에서는 사용자의 프로파일을 고려한 사용자 맞춤 차원 공유 시스템을 개발하여 주변의 다양한 자원을 실시간으로 공유 할 수 있도록 함으로써 모바일 디바이스의 제한적인 리소스 문제를 해결 하고자한다. 본 논문에서는 테스트 시나리오를 이용하여 제안하는 사용자 맞춤 자원 공유 시스템을 검증한다.

  • PDF

A Resource Scheduling Algorithm Using Node Clustering in VDI Environment (VDI 환경에서 클러스터링을 이용한 자원 스케줄링 알고리즘)

  • Seo, Kyung-Seok;Lee, Bong-Hwan
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2012.05a
    • /
    • pp.360-363
    • /
    • 2012
  • Recently green IT is considered as an essential element due to continuous consumption of energy and abrupt oil price. Thus, IT infrastructure is being replaced with cloud computing platform in oder to reduce server heat and energy consumption of data centers. In this paper, we implement an open source-based cloud platform and propose a resource scheduling algorithm for cloud VDI service using node clustering.

  • PDF

Improved Scheduling Approach IN SC-FDMA

  • Elshakwi, Saleh.Y.;Abdulrahman, Tarek
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.2 no.6
    • /
    • pp.350-356
    • /
    • 2013
  • Single Carrier Frequency Domain Multiple Access (SC-FDMA) has proven to be the best long term evolution for uplink multiple access because of its low Peak to Average Power Ratio (PAPR), a feature that leads to low power consumption. This is achievable only if the resource allocation is performed in a contiguous manner. This paper proposes a new approach with an improvement in the global resources allocation. The new approach presented utilizes the gain function, which adopts some of the procedures deduced from the older Recursive Maximum Expansion (RME) algorithm. The experiment proved that the new approach is better than the original RME algorithms and in most cases, is closer to the optimal solution.

  • PDF

The Real-Time Constructive Simulation With the RM scheduling and Lock-free Shared Objects (RM 스케쥴링과 Lock-Free 공유개체에 의한 실시간 시뮬레이션)

  • 박현규
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.519-522
    • /
    • 1998
  • The Constructive Battle simulation Model is very important to the recent military training for the substitution of the field training. However, real battlefield systems operate under rea-time conditions, they are inherently distributed, concurrent and dynamic. In order to reflect these properties by the computer-based simulation systems which represent real world processes, we have been developing constructive simulation model for several years. The constructive simulation system is one of the famous real-time system software, nd the one common feature of all real-time systems is defined as the correctness of the system depend not only on the logical result of computation, but also on the time at which the results are produced. Conventionally, scheduling and resource allocation activities which have timing constraints are major problem of real-time computing systems. To overcome these constraints, we elaborated on these issues and developed the simulation system on commercially available hardware and operating system with lock-free resource allocation scheme and rae monotonic scheduling.

  • PDF

Dynamic Resource Allocation and Scheduling for Cloud-Based Virtual Content Delivery Networks

  • Um, Tai-Won;Lee, Hyunwoo;Ryu, Won;Choi, Jun Kyun
    • ETRI Journal
    • /
    • v.36 no.2
    • /
    • pp.197-205
    • /
    • 2014
  • This paper proposes a novel framework for virtual content delivery networks (CDNs) based on cloud computing. The proposed framework aims to provide multimedia content delivery services customized for content providers by sharing virtual machines (VMs) in the Infrastructure-as-a-Service cloud, while fulfilling the service level agreement. Furthermore, it supports elastic virtual CDN services, which enables the capabilities of VMs to be scaled to encompass the dynamically changing resource demand of the aggregated virtual CDN services. For this, we provide the system architecture and relevant operations for the virtual CDNs and evaluate the performance based on a simulation.

An Implementation of Global Scheduler for Efficient Distributed Resource Management (효율적 분산자원 관리를 위한 글로벌 스케쥴러 구현)

  • Yong Wan Koo
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.3
    • /
    • pp.1-13
    • /
    • 1994
  • In this study under the distributed system for efficient distribution resource completely symmetic global scheduler was designed and implemented to obtain the general global scheduler, that is load balancing as sharing objectives. To balance the system's load efficiently each node must be designed to get right decision-making. Thus we considered computing time to estimate fault such as delay on communication network, communication period and other decision-making. Load balancing mechanism which suggested in this study was implemented in the distributed system which IBM PC/AT linked to and composed with Ethernet. The target operating system was composed of IBM PC/AT as a basic construction in which proper type of UNIX operating system were ported and communication layer chose communication type implemented from Amoeba. The method of IPC employing layered multilevel access method to avoid inefficient protocol using direct communication mode guarantees rapid response due to short ready time for IPC.

  • PDF

Real-Time Scheduling Strategy for Resource Allocation in Grid Computing (그리드 컴퓨팅에서 자원 할당을 위한 실시간 스케줄링 정책)

  • 최준영;이원주;전창호
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2004.04a
    • /
    • pp.85-87
    • /
    • 2004
  • 그리드 컴퓨팅에서는 자원의 상세 정보를 실시간으로 사용하기 어렵기 때문에 자원 관리와 할당이 기존 시스템에 비해 비효율적이다. 따라서, 본 논문에서는 작업의 총 실행시간을 예측하여 그리드 자원을 할당하는 새로운 스케줄링 정책을 제안한다. 이 스케줄링 정책의 특징은 원격 스케줄러와 로컬스케줄러를 사용하여 2단계 스케줄링을 수행한다. 원격 스케줄러에서는 자원 데이터베이스에 저장된 네트워크 환경과 로컬시스템의 정보를 사용하여 작업의 총 실행시간을 예측한다. 그리고 총 실행시간이 최소인 로컬시스템에 작업을 할당한다. 로컬스케줄러에서는 할당된 작업의 대기시간과 처리시간을 계산한 후, 작업을 데드라인 내에 처 리 할 수 있다면 로컬 시스템에서 처리한다. 하지만 데드라인을 초과하면 다른 로컬시스템으로 이주시켜 처리함으로써 작업실패율(failure rate)과 자원비용(resource cost)을 최소화한다.

  • PDF