• 제목/요약/키워드: Algorithm performance

검색결과 18,207건 처리시간 0.038초

An Algorithm for Performance Index of Telecommunications Network

  • Shin, YongYeon;Lee, SoYeon;Koh, JaiSang
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • 제2권2호
    • /
    • pp.111-123
    • /
    • 1998
  • Performance index is a measure of telecommunications network integrating reliability and capacity simultaneously. This paper suggests a computerized algorithm evaluating a performance index for telecommunications network and compares this computerized algorithm with the algorithm[1] by experimenting on several benchmarks. A computerized algorithm proposed by this paper is superior to the algorithm[1] with respect to the computation time for most of the benchmarks.

  • PDF

EPC Class 1 RFID 시스템에서 태그 인식 속도 향상을 위한 고속 태그 충돌 방지 알고리즘 (Fast Anti-collision Algorithm for Improving Tag Identification Speed in EPC Class 1 RFID System)

  • 이충희;김재현
    • 한국통신학회논문지
    • /
    • 제33권6B호
    • /
    • pp.450-455
    • /
    • 2008
  • 본 논문에서는 기존의 EPC Class 1 RFID 시스템에서의 태그 인식 절차와 태그 충돌 방지 알고리즘을 분석하였으며, 태그 인식 속도를 향상시키기 위한 고속 충돌 방지 알고리즘을 제안한다. 고속 충돌 방지 알고리즘에서는 태그 인식 과정에서 태그의 충돌 정보를 이용하고, 기존의 알고리즘에서 존재하던 불필요한 절차를 생략하였다. 성능 평가를 위하여 기존의 알고리즘과 제안한 알고리즘을 수학적으로 분석하였고, 이를 시뮬레이션으로 검증하였다. 결과에 따르면, 고속 충돌 방지 알고리즘이 기존의 알고리즘에 비해 상당한 성능향상을 보임을 확인할 수 있었다.

시뮬레이션 기법을 이용한 프로세러 할당 알고리즘들의 성능비교 (Performance Comparisons on Processor Allocation Algorithms by Using Simulation Techniques)

  • 최준구
    • 한국시뮬레이션학회논문지
    • /
    • 제3권1호
    • /
    • pp.43-53
    • /
    • 1994
  • With remarkable progress of hardware technologies, multiprocessor systems equipped with thousands of processors will be available in near future. In order to increase the performance of these systems, many processor allocation algorithms have been proposed. However, few studies have been conducted in order to compare the performance of these algorithms. In this paper, simulation techniques are used in order to compare the performance of the processor allocation algorithms proved to be useful. These are: an algorithm using equipartion, an algorithm using average parallelism, an algorithm using execution signatures, and an algorithm using the number of tasks in a task precedence graph. Simulation shows that the algorithm using execution signatures performs best while the algorithm using average parallelism performs worst with small allocated processors. Surprisingly, the algorithm using equipartition performs well despite the fact that it has smallest overhead. Overall, it can be recommended that the algorithm using equipartition be used without any execution history and that the algorithm using execution signatures be used with some execution history.

  • PDF

PERFORMANCE OF A KNIGHT TOUR PARALLEL ALGORITHM ON MULTI-CORE SYSTEM USING OPENMP

  • VIJAYAKUMAR SANGAMESVARAPPA;VIDYAATHULASIRAMAN
    • Journal of applied mathematics & informatics
    • /
    • 제41권6호
    • /
    • pp.1317-1326
    • /
    • 2023
  • Today's computers, desktops and laptops were build with multi-core architecture. Developing and running serial programs in this multi-core architecture fritters away the resources and time. Parallel programming is the only solution for proper utilization of resources available in the modern computers. The major challenge in the multi-core environment is the designing of parallel algorithm and performance analysis. This paper describes the design and performance analysis of parallel algorithm by taking the Knight Tour problem as an example using OpenMP interface. Comparison has been made with performance of serial and parallel algorithm. The comparison shows that the proposed parallel algorithm achieves good performance compared to serial algorithm.

Flow Holding Time based Advanced Hybrid QoS Routing Link State Update in QoS Routing

  • Cho, Kang Hong
    • 한국컴퓨터정보학회논문지
    • /
    • 제21권4호
    • /
    • pp.17-24
    • /
    • 2016
  • In this paper, we propose a AH LSU(Advanced Hybrid QoS Routing Link State Update) Algorithm that improves the performance of Hybrid LSU(Hybrid QoS Link State State Update) Algorithm with statistical information of flow holding time in network. AH LSU algorithm has had both advantages of LSU message control in periodic QoS routing LSU algorithm and QoS routing performance in adaptive LSU algorithm. It has the mechanism that calculate LSU message transmission priority using the flow of statistical request bandwidth and available bandwidth and include MLMR(Meaningless LSU Message Removal) mechanism. MLMR mechanism can remove the meaningless LSU message generating repeatedly in short time. We have evaluated the performance of the MLMR mechanism, the proposed algorithm and the existing algorithms on MCI simulation network. We use the performance metric as the QoS routing blocking rate and the mean update rate per link, it thus appears that we have verified the performance of this algorithm.

유색잡음에 대한 적응잡음제거기의 성능향성 (Performance improvement of adaptivenoise canceller with the colored noise)

  • 박장식;조성환;손경식
    • 한국통신학회논문지
    • /
    • 제22권10호
    • /
    • pp.2339-2347
    • /
    • 1997
  • The performance of the adaptive noise canceller using LMS algorithm is degraded by the gradient noise due to target speech signals. An adaptive noise canceller with speech detector was proposed to reduce this performande degradation. The speech detector utilized the adaptive prediction-error filter adapted by the NLMS algorithm. This paper discusses to enhance the performance of the adaptive noise canceller forthecorlored noise. The affine projection algorithm, which is known as faster than NLMS algorithm for correlated signals, is used to adapt the adaptive filter and the adaptive prediction error filter. When the voice signals are detected by the speech detector, coefficients of adaptive filter are adapted by the sign-error afine projection algorithm which is modified to reduce the miaslignment of adaptive filter coefficients. Otherwirse, they are adapted by affine projection algorithm. To obtain better performance, the proper step size of sign-error affine projection algorithm is discussed. As resutls of computer simulation, it is shown that the performance of the proposed ANC is better than that of conventional one.

  • PDF

A New Approach to System Identification Using Hybrid Genetic Algorithm

  • Kim, Jong-Wook;Kim, Sang-Woo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2001년도 ICCAS
    • /
    • pp.107.6-107
    • /
    • 2001
  • Genetic alogorithm(GA) is a well-known global optimization algorithm. However, as the searching bounds grow wider., performance of local optimization deteriorates. In this paper, we propose a hybrid algorithm which integrates the gradient algorithm and GA so as to reinforce the performance of local optimization. We apply this algorithm to the system identification of second order RLC circuit. Identification results show that the proposed algorithm gets the better and robust performance to find the exact values of RLC elements.

  • PDF

추적 개시 확률 산출을 통한 적응빔형성 성능 분석 (Tracking Initiation Performance Analysis of the Adaptive Beamforming)

  • 하창읍;김영신;이상혁
    • 전자공학회논문지
    • /
    • 제53권11호
    • /
    • pp.89-96
    • /
    • 2016
  • 잠수함 정숙화 기술의 발달로 대잠 소나의 탐지성능 향상이 요구되고 있다. 이와 같은 성능향상의 필요성에 의해 소나체계에 널리 쓰이는 일반적인 빔형성 기법(CBF : Conventional BeamForming)보다 성능이 뛰어난 적응 빔형성(ABF : Adaptive BeamForming) 기법이 대체 알고리즘으로 검토되고 있다. 소나 체계에 적응 빔형성기를 적용하여 성능향상을 도모하기 위해서는 적응 빔형성 기법의 체계 적용성이 검증되어야 하는데 이를 위해서는 체계 적용성을 측정하기 위한 성능지표가 정립되어야 한다. 본 논문에서는 적응 빔형성기와 일반적인 빔형성기의 추적 개시(Tracking initiation) 확률을 산출하여 두 기법의 성능을 정량화하여 적응 빔형성기의 체계 적용성을 검토하였다.

방위각을 이용한 신호원 위치 추정 알고리즘의 성능 비교 (Performance Comparison of LOB-based Emitter Localization Algorithms)

  • 이준호;김민철;조성우;진용기;이동근
    • 한국군사과학기술학회지
    • /
    • 제12권4호
    • /
    • pp.437-445
    • /
    • 2009
  • In this paper, we present the performance of the LOB(line of bearing) - based emitter localization algorithm. The linear LSE(least-squared error) algorithm, nonlinear LSE algorithm and Stansfield algorithm are considered. In addition, we focus on the performance improvement of the weighted estimation compared with the unweighted estimation. Each estimation algorithm is briefly introduced, and the performance of the algorithm is illustrated using the numerical results.

베이지안 기법을 활용한 공용성 모델개발 연구 (Pavement Performance Model Development Using Bayesian Algorithm)

  • 문성호
    • 한국도로학회논문집
    • /
    • 제18권1호
    • /
    • pp.91-97
    • /
    • 2016
  • PURPOSES : The objective of this paper is to develop a pavement performance model based on the Bayesian algorithm, and compare the measured and predicted performance data. METHODS : In this paper, several pavement types such as SMA (stone mastic asphalt), PSMA (polymer-modified stone mastic asphalt), PMA (polymer-modified asphalt), SBS (styrene-butadiene-styrene) modified asphalt, and DGA (dense-graded asphalt) are modeled in terms of the performance evaluation of pavement structures, using the Bayesian algorithm. RESULTS : From case studies related to the performance model development, the statistical parameters of the mean value and standard deviation can be obtained through the Bayesian algorithm, using the initial performance data of two different pavement cases. Furthermore, an accurate performance model can be developed, based on the comparison between the measured and predicted performance data. CONCLUSIONS : Based on the results of the case studies, it is concluded that the determined coefficients of the nonlinear performance models can be used to accurately predict the long-term performance behaviors of DGA and modified asphalt concrete pavements. In addition, the developed models were evaluated through comparison studies between the initial measurement and prediction data, as well as between the final measurement and prediction data. In the model development, the initial measured data were used.