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

검색결과 641건 처리시간 0.026초

동영상 부호화를 위한 움직임 벡터의 추정 (Estimation of Motion Vector for Moving Picture Encoding)

  • 강성관;임춘환;손영수;배상현
    • 한국정보통신학회논문지
    • /
    • 제5권7호
    • /
    • pp.1340-1345
    • /
    • 2001
  • 본 논문은 이동물체의 이동 정보를 표현하는 OF의 최적해를 계산하고 동작 속도를 향상시키는 방법을 제안한다. 이를 위하여 CHT와 투표누적을 사용하여 기존의 방법에 비해 양호한 최적해를 계산하였고, 간단하게 이 동물체를 검색하였다.

  • PDF

$H_\infty$ 최적제어기의 이산화 구현 (Digital Implementation of $H_\infty$ Optimal Controller)

  • 김광우;오도창;박홍배
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
    • /
    • pp.471-476
    • /
    • 1993
  • In this paper we proposed the digital implementation of an $H^{\infty}$-optimal controller using lifting technique and $H^{\infty}$-control theory. The discrete controller is obtained through iterative adjustment of sampling time and weighting function, which can ber performed by computing the L$_{2}$-induced input to output norm of the sampled-data system with bandlimited exogenous input. The resulting sampled-data bandlimited exogenous input. The resulting sampled-data system is stable and the performance including inter-sampling behaviour of the hybrid system can be also optimized.d.

  • PDF

Determining of an Optimal Spares Stocking Policy with Reliability Improvement

  • Jun Hong Kim
    • 산업경영시스템학회지
    • /
    • 제23권56호
    • /
    • pp.1-8
    • /
    • 2000
  • We present in this paper an optimal stocking policy for a repairable inventory system under reliability improvement. For this purpose we illustrate commercial flight lines with a large number of planes. This model is supported by a central repair facility. For modeling the nonstationary M/M/s system we implemented SIMAN for computing the time dependent number of units in the repair facility with any number of units. In this model we provide the required inventory level at each location. 1y month. for various levels of associated stock-out risk.

  • PDF

EHMM-CT: An Online Method for Failure Prediction in Cloud Computing Systems

  • Zheng, Weiwei;Wang, Zhili;Huang, Haoqiu;Meng, Luoming;Qiu, Xuesong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권9호
    • /
    • pp.4087-4107
    • /
    • 2016
  • The current cloud computing paradigm is still vulnerable to a significant number of system failures. The increasing demand for fault tolerance and resilience in a cost-effective and device-independent manner is a primary reason for creating an effective means to address system dependability and availability concerns. This paper focuses on online failure prediction for cloud computing systems using system runtime data, which is different from traditional tolerance techniques that require an in-depth knowledge of underlying mechanisms. A 'failure prediction' approach, based on Cloud Theory (CT) and the Hidden Markov Model (HMM), is proposed that extends the HMM by training with CT. In the approach, the parameter ω is defined as the correlations between various indices and failures, taking into account multiple runtime indices in cloud computing systems. Furthermore, the approach uses multiple dimensions to describe failure prediction in detail by extending parameters of the HMM. The likelihood and membership degree computing algorithms in the CT are used, instead of traditional algorithms in HMM, to reduce computing overhead in the model training phase. Finally, the results from simulations show that the proposed approach provides very accurate results at low computational cost. It can obtain an optimal tradeoff between 'failure prediction' performance and computing overhead.

그리드 컴퓨팅을 위한 NSGA-II 기반 다목적 작업 스케줄링 모델 (Multi-Objective Job Scheduling Model Based on NSGA-II for Grid Computing)

  • 김솔지;김태호;이홍철
    • 한국컴퓨터정보학회논문지
    • /
    • 제16권7호
    • /
    • pp.13-23
    • /
    • 2011
  • 그리드 컴퓨팅은 지리적으로 분산된 이기종의 컴퓨팅 자원들을 상호 연결하고 공유하여 가상의 고성능 컴퓨팅시스템을 구성함으로서 대용량의 컴퓨팅 연산 등을 수행하는 차세대 컴퓨팅 기술이다. 이러한 그리드 컴퓨팅의 성능을 극대화하기 위해서는 효율적으로 작업을 자원에 할당하는 작업 스케줄링 기법이 필요하다. 따라서 작업 총 완료시간 등을 고려한 작업 스케줄링 기법에 대한 많은 연구가 진행되었다. 그러나 작업 스케줄링에 있어서 자원의 사용에 따른 자원 비용을 고려하는 것 역시 매우 중요하며, 자원 비용의 최소화를 통해 그리드 컴퓨팅의 전체적인 성능 및 경제적 효율성을 높일 수 있다. 따라서 본 논문에서는 시간과 비용을 모두 고려한 다목적 작업 스케줄링 모델을 제안한다. 제안하는 모델은 다목적 유전 알고리즘 기법의 하나인 NSGA-II를 적용하여 최적 해를 도출하였고, 모델의 효율성을 증명하기 위해 시뮬레이션 환경을 구성하여 기존의 스케줄링 모델인 Min-Min, Max-Min 알고리즘과의 비교 실험을 수행하였다. 이를 통해 제안한 스케줄링 모델이 기존 스케줄링 모델에 비해 작업 총 완료시간과 자원 비용을 더욱 효율적으로 최소화함을 증명하였다.

SDRE controller considering Multi Observer applied to nonlinear IPMC model

  • Bernat, Jakub;Kolota, Jakub;Stepien, Slawomir
    • Smart Structures and Systems
    • /
    • 제20권1호
    • /
    • pp.1-10
    • /
    • 2017
  • Ionic Polymer Metal Composite (IPMC) is an electroactive polymer (EAP) and a promising candidate actuator for various potential applications mainly due to its flexible, low voltage/power requirements, small and compact design, and lack of moving parts. Although widely used in industry, this material requires accurate numerical models and knowledge of optimal control methods. This paper presents State-Dependent Riccati Equation (SDRE) approach as one of rapidly emerging methodologies for designing nonlinear controllers. Additionally, the present paper describes a novel method of Multi HGO Observer design. In the proposed design, the calculated position of the IPMC strip accurately tracks the target position, which is illustrated by the experiments. Numerical results and comparison with experimental data are presented and the effectiveness of the proposed control strategy is verified in experiments.

Hybrid Self Organizing Map using Monte Carlo Computing

  • 전성해;박민재;오경환
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2006년도 춘계학술대회 학술발표 논문집 제16권 제1호
    • /
    • pp.381-384
    • /
    • 2006
  • Self Organizing Map(SOM) is a powerful neural network model for unsupervised loaming. In many clustering works with exploratory data analysis, it has been popularly used. But it has a weakness which is the poorly theoretical base. A lot more researches for settling the problem have been published. Also, our paper proposes a method to overcome the drawback of SOM. As compared with the presented researches, our method has a different approach to solve the problem. So, a hybrid SOM is proposed in this paper. Using Monte Carlo computing, a hybrid SOM improves the performance of clustering. We verify the improved performance of a hybrid SOM according to the experimental results using UCI machine loaming repository. In addition to, the number of clusters is determined by our hybrid SOM.

  • PDF

Profit-Maximizing Virtual Machine Provisioning Based on Workload Prediction in Computing Cloud

  • Li, Qing;Yang, Qinghai;He, Qingsu;Kwak, Kyung Sup
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권12호
    • /
    • pp.4950-4966
    • /
    • 2015
  • Cloud providers now face the problem of estimating the amount of computing resources required to satisfy a future workload. In this paper, a virtual machine provisioning (VMP) mechanism is designed to adapt workload fluctuation. The arrival rate of forthcoming jobs is predicted for acquiring the proper service rate by adopting an exponential smoothing (ES) method. The proper service rate is estimated to guarantee the service level agreement (SLA) constraints by using a diffusion approximation statistical model. The VMP problem is formulated as a facility location problem. Furthermore, it is characterized as the maximization of submodular function subject to the matroid constraints. A greedy-based VMP algorithm is designed to obtain the optimal virtual machine provision pattern. Simulation results illustrate that the proposed mechanism could increase the average profit efficiently without incurring significant quality of service (QoS) violations.

Efficient Process Network Implementation of Ray-Tracing Application on Heterogeneous Multi-Core Systems

  • Jung, Hyeonseok;Yang, Hoeseok
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제5권4호
    • /
    • pp.289-293
    • /
    • 2016
  • As more mobile devices are equipped with multi-core CPUs and are required to execute many compute-intensive multimedia applications, it is important to optimize the systems, considering the underlying parallel hardware architecture. In this paper, we implement and optimize ray-tracing application tailored to a given mobile computing platform with multiple heterogeneous processing elements. In this paper, a lightweight ray-tracing application is specified and implemented in Kahn process network (KPN) model-of-computation, which is known to be suitable for the description of real-time applications. We take an open-source C/C++ implementation of ray-tracing and adapt it to KPN description in the Distributed Application Layer framework. Then, several possible configurations are evaluated in the target mobile computing platform (Exynos 5422), where eight heterogeneous ARM cores are integrated. We derive the optimal degree of parallelism and a suitable distribution of the replicated tasks tailored to the target architecture.

HeteroAccel: 엣지 컴퓨팅 환경에서의 다양한 영상 추론을 위한 쿠버네티스 기반의 이종 연산·가속기 자원 관리 시스템 (Kubernetes-based Heterogeneous Computational and Accelerator Resource Management System for Various Image Inferences in Edge Computing Environments)

  • 전재호;김용연;강성주
    • 대한임베디드공학회논문지
    • /
    • 제16권5호
    • /
    • pp.201-207
    • /
    • 2021
  • Edge Computing enables image-based inference in close proximity to end users and real-world objects. However, since edge servers have limited computational and accelerator resources, efficient resource management is essential. In this paper, we present HeteroAccel system that performs optimal scheduling in Kubernetes platform based on available node and accelerator information for various inference requests. Our experiments showed 25.3% improvement in overall inference performance over the default scheduling scheme in edge computing environment in which four types of inference services are requested.