• Title/Summary/Keyword: Optimal computation

Search Result 636, Processing Time 0.024 seconds

Optimization of Stochastic System Using Genetic Algorithm and Simulation

  • 유지용
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1999.10a
    • /
    • pp.75-80
    • /
    • 1999
  • This paper presents a new method to find a optimal solution for stochastic system. This method uses Genetic Algorithm(GA) and simulation. GA is used to search for new alternative and simulation is used to evaluate alternative. The stochastic system has one or more random variables as inputs. Random inputs lead to random outputs. Since the outputs are random, they can be considered only as estimates of the true characteristics of they system. These estimates could greatly differ from the corresponding real characteristics for the system. We need multiple replications to get reliable information on the system. And we have to analyze output data to get a optimal solution. It requires too much computation to be practical. We address the problem of reducing computation. The procedure on this paper use GA character, an iterative process, to reduce the number of replications. The same chromosomes could exit in post and present generation. Computation can be reduced by using the information of the same chromosomes which exist in post and present current generation.

  • PDF

A Decomposition Algorithm for Convex Structuring Elements in Morphological Operation (모폴로지 연산에 사용되는 볼록 구조요소의 분해를 위한 알고리듬)

  • 온승엽
    • Journal of the Korea Society for Simulation
    • /
    • v.13 no.1
    • /
    • pp.11-23
    • /
    • 2004
  • The decomposition of a structuring element for a morphological operation reduces the amount of the computation required for executing the operation. In this paper, we present a new technique for the decomposition of convex structuring elements for morphological operations. We formulated the linear constraints for the decomposition of a convex polygon in discrete space, then the constraints are applied to the decomposition of a convex structuring element. Also, a cost function is introduced to represent the optimal criteria for decomposition. We use linear integer programming technique to find the combination of basis structuring elements which minimizes the amount of the computation required for executing the morphological operation. Formulating different cost functions for different implementation methods and computer architectures, we can determine the optimal decompositions which guarantee the minimal amounts of computation on different computing environment.

  • PDF

An Efficient Algorithm for Sparse Code Motion (희소코드모션을 위한 효율적인 알고리즘)

  • Shin Hyun-Deok;Yu Heui-Jong;Ahn Heui-Hak
    • The KIPS Transactions:PartA
    • /
    • v.12A no.1 s.91
    • /
    • pp.79-86
    • /
    • 2005
  • This paper suggests that sparse code motion algorithm should be used to make the code optimal in the respect of computation and lifetime. This algorithm Is SpCM algorithm, which expand BCM and LCM algorithm. BCM algorithm carries out the optimal code motion computationally and LCM algorithm reduces the register pressure in SpCM algorithm. Generally, code motion algorithm accomplishes the run-time optimal connected with the optimum of computation and the register pressure. Computational cost and consideration of the code size in the register pressure are also added in the paper. The optimum of code motion could be obtained through SpCM algorithm, which considers the code size, in audition to computational optimal and lifetime optimal. The algorithm presented in this paper is the most optimal algorithm in the respect of computation and lifetime, as all the unnecessary code motions are restrained.

Scalable Path Computation Flooding Approach for PCE-Based Multi-domain Networks

  • Perello, Jordi;Hernandez-Sola, Guillem;Agraz, Fernando;Spadaro, Salvatore;Comellas, Jaume
    • ETRI Journal
    • /
    • v.32 no.4
    • /
    • pp.622-625
    • /
    • 2010
  • In this letter, we assess the scalability of a path computation flooding (PCF) approach to compute optimal end-to-end inter-domain paths in a path computation element-based multi-domain network. PCF yields a drastically reduced network blocking probability compared to a blind per-domain path computation but introduces significant network control overhead and path computation complexity. In view of this, we introduce and compare an alternative low overhead PCF (LoPCF) solution. From the obtained results, LoPCF leads to similar blocking probabilities to PCF while exhibiting around 50% path computation complexity and network control overhead reduction.

Efficient Hybrid Transactional Memory Scheme using Near-optimal Retry Computation and Sophisticated Memory Management in Multi-core Environment

  • Jang, Yeon-Woo;Kang, Moon-Hwan;Chang, Jae-Woo
    • Journal of Information Processing Systems
    • /
    • v.14 no.2
    • /
    • pp.499-509
    • /
    • 2018
  • Recently, hybrid transactional memory (HyTM) has gained much interest from researchers because it combines the advantages of hardware transactional memory (HTM) and software transactional memory (STM). To provide the concurrency control of transactions, the existing HyTM-based studies use a bloom filter. However, they fail to overcome the typical false positive errors of a bloom filter. Though the existing studies use a global lock, the efficiency of global lock-based memory allocation is significantly low in multi-core environment. In this paper, we propose an efficient hybrid transactional memory scheme using near-optimal retry computation and sophisticated memory management in order to efficiently process transactions in multi-core environment. First, we propose a near-optimal retry computation algorithm that provides an efficient HTM configuration using machine learning algorithms, according to the characteristic of a given workload. Second, we provide an efficient concurrency control for transactions in different environments by using a sophisticated bloom filter. Third, we propose a memory management scheme being optimized for the CPU cache line, in order to provide a fast transaction processing. Finally, it is shown from our performance evaluation that our HyTM scheme achieves up to 2.5 times better performance by using the Stanford transactional applications for multi-processing (STAMP) benchmarks than the state-of-the-art algorithms.

An Optimal Decomposition Algorithm for Convex Structuring Elements (볼록 구조자룰 위한 최적 분리 알고리듬)

  • 온승엽
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.9
    • /
    • pp.1167-1174
    • /
    • 1999
  • In this paper, we present a new technique for the local decomposition of convex structuring elements for morphological image processing. Local decomposition of a structuring element consists of local structuring elements, in which each structuring element consists of a subset of origin pixel and its eight neighbors. Generally, local decomposition of a structuring element reduces the amount of computation required for morphological operations with the structuring element. A unique feature of our approach is the use of linear integer programming technique to determine optimal local decomposition that guarantees the minimal amount of computation. We defined a digital convex polygon, which, in turn, is defined as a convex structuring element, and formulated the necessary and sufficient conditions to decompose a digital convex polygon into a set of basis digital convex polygons. We used a set of linear equations to represent the relationships between the edges and the positions of the original convex polygon, and those of the basis convex polygons. Further. a cost function was used represent the total processing time required for computation of dilation/erosion with the structuring elements in a decomposition. Then integer linear programming was used to seek an optimal local decomposition, that satisfies the linear equations and simultaneously minimize the cost function.

  • PDF

Optimal Environmental and Economic Operation using Evolutionary Computation and Neural Networks (진화연산과 신경망이론을 이용한 전력계통의 최적환경 및 경제운용)

  • Rhee, Sang-Bong;Kim, Kyu-Ho;You, Seok-Ku
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.12
    • /
    • pp.1498-1506
    • /
    • 1999
  • In this paper, a hybridization of Evolutionary Strategy (ES) and a Two-Phase Neural Network(TPNN) is applied to the optimal environmental and economic operation. As the evolutionary computation, ES is to search for the global optimum based on natural selection and genetics but it shows a defect of reducing the convergence rate in the latter part of search, and often does not search the exact solution. Also, neural network theory as a local search technique can be used to search a more exact solution. But it also has the defect that a solution frequently sticks to the local region. So, new algorithm is presented as hybrid methods by combining merits of two methods. The hybrid algorithm has been tested on Emission Constrained Economic Dispatch (ECED) problem and Weighted Emission Economic Dispatch (WEED) problem for optimal environmental and economic operation. The result indicated that the hybrid approach can outperform the other computational efficiency and accuracy.

  • PDF

Redundancy Resolution for Free-Floating Manipulators Using Kinematic Optimal Control Approach (기구학적 최적 제어를 사용한 자유 부유 매니퓰레이터의 여유도 해결)

  • Kim, Yong-Min;Kim, Byung-Kook
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.8
    • /
    • pp.790-798
    • /
    • 2011
  • An efficient sequential computation algorithm of kinematic optimal control is suggested for redundancy resolution of freefloating manipulators. Utilization of minimum principle usually requires involved and tedious procedure of differentiation of Hamiltonian. Due to the constraints of momentum conservation, it is not easy to get exact differential equations of boundary value problem for even relatively simple free-floating manipulator models. To overcome this difficulty, we developed an effective sequential algorithm for the computation of terms appeared in the differential equations. The usefulness of suggested approach is verified by simulation of a planar 3-joints free-floating manipulator.

Comparison of neural network algorithms for the optimal routing in a Multistage Interconnection Network (MIN의 최적경로 배정을 위한 신경회로망 알고리즘의 비교)

  • Kim, Seong-Su;Gong, Seong-Gon
    • Proceedings of the KIEE Conference
    • /
    • 1995.11a
    • /
    • pp.569-571
    • /
    • 1995
  • This paper compares the simulated annealing and the Hopfield neural network method for an optimal routing in a multistage interconnection network(MIN). The MIN provides a multiple number of paths for ATM cells to avoid cell conflict. Exhaustive search always finds the optimal path, but with heavy computation. Although greedy method sets up a path quickly, the path found need not be optimal. The simulated annealing can find an sub optimal path in time comparable with the greedy method.

  • PDF

Optimal Design of PM Wind Generator using Memetic Algorithm (Memetic Algorithms을 적용한 영구자석 풍력발전기 최적설계)

  • Park, Ji-Seong;Ahn, Young-Jun;Kim, Jong-Wook;Lee, Chel-Gyun;Jung, Sang-Yong
    • Proceedings of the KIEE Conference
    • /
    • 2009.04b
    • /
    • pp.6-8
    • /
    • 2009
  • This paper presents the novel implementation of memetic algorithm with GA (Genetic Algorithm) and MADS (Mesh Adaptive Direct Search), which is applied for optimal design methodology of electric machine. This hybrid algorithm has been developed for obtaining the global optimum rapidly, which is effective for optimal design of electric machine with many local optima and much longer computation time. In particular, the proposed memetic algorithm has been forwarded to optimal design of direct-driven PM wind generator for maximizing the Annual Energy Production (AEP), of which design objective should be obtained by FEA (Finite Element Analysis). After all, it is shown that GA combined with MADS has contributed to reducing the computation time effectively for optimal design of PM wind generator when compared with purposely developed GA implemented with the parallel computing method.

  • PDF