• 제목/요약/키워드: computation time reduction

Search Result 221, Processing Time 0.025 seconds

An Efficient Service Function Chains Orchestration Algorithm for Mobile Edge Computing

  • Wang, Xiulei;Xu, Bo;Jin, Fenglin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.12
    • /
    • pp.4364-4384
    • /
    • 2021
  • The dynamic network state and the mobility of the terminals make the service function chain (SFC) orchestration mechanisms based on static and deterministic assumptions hard to be applied in SDN/NFV mobile edge computing networks. Designing dynamic and online SFC orchestration mechanism can greatly improve the execution efficiency of compute-intensive and resource-hungry applications in mobile edge computing networks. In order to increase the overall profit of service provider and reduce the resource cost, the system running time is divided into a sequence of time slots and a dynamic orchestration scheme based on an improved column generation algorithm is proposed in each slot. Firstly, the SFC dynamic orchestration problem is formulated as an integer linear programming (ILP) model based on layered graph. Then, in order to reduce the computation costs, a column generation model is used to simplify the ILP model. Finally, a two-stage heuristic algorithm based on greedy strategy is proposed. Four metrics are defined and the performance of the proposed algorithm is evaluated based on simulation. The results show that our proposal significantly provides more than 30% reduction of run time and about 12% improvement in service deployment success ratio compared to the Viterbi algorithm based mechanism.

Numerical data-driven machine learning model to predict the strength reduction of fire damaged RC columns

  • HyunKyoung Kim;Hyo-Gyoung Kwak;Ju-Young Hwang
    • Computers and Concrete
    • /
    • v.32 no.6
    • /
    • pp.625-637
    • /
    • 2023
  • The application of ML approaches in determining the resisting capacity of fire damaged RC columns is introduced in this paper, on the basis of analysis data driven ML modeling. Considering the characteristics of the structural behavior of fire damaged RC columns, the representative five approaches of Kernel SVM, ANN, RF, XGB and LGBM are adopted and applied. Additional partial monotonic constraints are adopted in modelling, to ensure the monotone decrease of resisting capacity in RC column with fire exposure time. Furthermore, additional suggestions are also added to mitigate the heterogeneous composition of the training data. Since the use of ML approaches will significantly reduce the computation time in determining the resisting capacity of fire damaged RC columns, which requires many complex solution procedures from the heat transfer analysis to the rigorous nonlinear analyses and their repetition with time, the introduced ML approach can more effectively be used in large complex structures with many RC members. Because of the very small amount of experimental data, the training data are analytically determined from a heat transfer analysis and a subsequent nonlinear finite element (FE) analysis, and their accuracy was previously verified through a correlation study between the numerical results and experimental data. The results obtained from the application of ML approaches show that the resisting capacity of fire damaged RC columns can effectively be predicted by ML approaches.

Development of a Method for Uncertainty Analysis in the Top Event Unavailability (고장수목 정점사상 이용 불능도의 불확실성 분석용 방법 개발)

  • Sang Hoon Han;Chang Hyun Chung;Kun Joong Yoo
    • Nuclear Engineering and Technology
    • /
    • v.16 no.2
    • /
    • pp.97-105
    • /
    • 1984
  • A method and computer code for the uncertainty analysis in the top event unavailability are developed and tested by combining Monte Carlo Method and Moments method with fault tree reduction technique. Using system fault trees and unavailability data selected in WASH-1400, the efficiency of the proposed method is tested and these results are compared with those obtained by Monte Carlo method. It is shown that the results are sufficiently good in accuracy and computation time is considerably reduced compared with those by Monte Carlo method.

  • PDF

Partitioned State Estimation in Electric Power Systems (계통분할에 의한 전력계통 상태추정)

  • 박석춘;최상봉;문영현
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.37 no.7
    • /
    • pp.427-433
    • /
    • 1988
  • This paper presents a partitioned state estimation algorithm on the basis of network reduction by using a estimation technique of boundary line flows. The network is partitioned into several subnetworks, which generates boundary lines. The accurate estimation of boundary line flows enables us to perform state estimation on each sub-system independently. A precise method to estimate boundary line flows is presented for the partitioned state estimation. The proposed algorithm redices computation time and memory requirements remarkably. The proposed algorithm have been tested for IEEE sample system and verified to be applicable to practical power systems.

Expert System On Advanced load shedding (개선된 부하차단에 관한 전문가 시스템)

  • Kim, Jae-Chul;Kim, Eung-Sang;You, Mi-Bog
    • Proceedings of the KIEE Conference
    • /
    • 1991.07a
    • /
    • pp.354-357
    • /
    • 1991
  • In the case of system operation, a line overload cause damage to spread an whole range of power system. Of the theorems on load shedding, this study applied power distribution theorem and load reduction theorem which are local load shedding method, which are not affected by the magnitude of the power system and need not a large memory capacity and computation time. In this paper, we treat the problem of overload when power system occurred to fatal fault. Especially, there is the special case that local load shedding theorem is not always solved. Therefore, we introduce a solved device of the problem and construct the expert system of expanded local load shedding. Because proposed method uses the merits of expert system, in the case of system operation, the system operator don't embarrass to fatal fault and promptly deals with.

  • PDF

A design of floating-point multiplier for superscalar microprocessor (수퍼스칼라 마이크로프로세서용 부동 소수점 승산기의 설계)

  • 최병윤;이문기
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.5
    • /
    • pp.1332-1344
    • /
    • 1996
  • This paper presents a pipelined floating point multiplier(FMUL) for superscalar microprocessors that conbines radix-16 recoding scheme based on signed-digit(SD) number system and new rouding and normalization scheme. The new rounding and normalization scheme enable the FMUL to compute sticky bit in parallel with multiple operation and elminate timing delay due to post-normalization. By expoliting SD radix-16 recoding scheme, we can achieves further reduction of silicon area and computation time. The FMUL can execute signle-precision or double-precision floating-point multiply operation through three-stage pipelined datapath and support IEEE standard 754. The algorithm andstructure of the designed multiplier have been successfully verified through Verilog HOL modeling and simulation.

  • PDF

Development of on-line inverse kinematic algorithm and its experimental implementation (온라인 좌표 역변환 알고리듬의 개발과 이의 실험적 수행)

  • 오준호;박서욱;이두현
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1988.10a
    • /
    • pp.16-20
    • /
    • 1988
  • This paper presents a new algorithm for solving the inverse kinematics in real-time applications. The end-tip movement of each link can be resolved into the basic resolution unit, .DELTA.l, which depends on link length, reduction ratio and resolution of the incremental encoder attached to the joint. When x- and y-axis projection of the end-tip movement are expressed in .DELTA.l unit, projectional increments .DELTA.x and .DELTA.y become -1, 0 or I by truncation. By using the incremental computation with these ternary value and some simple logic rules, a coordinate transformation can be realized. Through this approach, it should be noted that the floating-point arithmetic and the manipulation of trigonometric functions are completely eliminated. This paper demonstrates the proposed method in a parallelogram linkage type, two-link arm.

  • PDF

ADVANCED DOMAIN DECOMPOSITION METHOD BY LOCAL AND MIXED LAGRANGE MULTIPLIERS

  • Kwak, Junyoung;Chun, Taeyoung;Cho, Haeseong;Shin, Sangjoon;Bauchau, Olivier A.
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.18 no.1
    • /
    • pp.17-26
    • /
    • 2014
  • This paper presents development of an improved domain decomposition method for large scale structural problem that aims to provide high computational efficiency. In the previous researches, we developed the domain decomposition algorithm based on augmented Lagrangian formulation and proved numerical efficiency under both serial and parallel computing environment. In this paper, new computational analysis by the proposed domain decomposition method is performed. For this purpose, reduction in computational time achieved by the proposed algorithm is compared with that obtained by the dual-primal FETI method under serial computing condition. It is found that the proposed methods significantly accelerate the computational speed for a linear structural problem.

A Study on the Multidisciplinary Design Optimization Using Collaborative Optimization Approach (협동 최적화 접근 방법에 의한 타분야 최적 설계에 관한 연구)

  • 노명일;이규열
    • Korean Journal of Computational Design and Engineering
    • /
    • v.5 no.3
    • /
    • pp.263-275
    • /
    • 2000
  • Multidisciplinary design optimization(MDO) can yield optimal design considering all the disciplinary requirements concurrently. A method to implement the collaborative optimization(CO) approach, one of the MDO methodologies, is developed using a pre-compiler “EzpreCompiler”, a design optimization library “EzOptimizer”, and a common object request broker architecture(CORBA) in distributed computing environment. The CO approach is applied to a mathematical example to show its applicability and equivalence to standard optimization(SO) formulation. In a realistic engineering problem such as optimal design of a two-member hub frame, optimal design of a speed reducer and initial design of a bulk carrier, the CO yields better results than the SO. Furthermore, the CO allows the distributed processing using the CORBA, which leads to reduction of overall computation time.

  • PDF

Optimal Design of Rotor Pole of BLDC Motor Using Taguchi Method and FEM (Taguchi 방법과 FEM을 이용한 BLDC 전동기 회전자 자극의 최적설계)

  • Kim, J.H.;Lee, H.K.;Kwon, Y.A.
    • Proceedings of the KIEE Conference
    • /
    • 2002.04a
    • /
    • pp.40-42
    • /
    • 2002
  • This paper presents the optimal design of BLDC motor keeping the average torque and cogging toruqe of the initial model while minimizing the volume of magnet pole by FEM and Taguchi method. Experimental tests are performed by Finite element method, and the second order polynomial equations are obtained from FEM results due to design parameter variation referred to orthogonal arrays by Taguchi. The presented optimization shows a big reduction of computation time and a largely reduced volume of magnet pole.

  • PDF