• Title/Summary/Keyword: Iterations

Search Result 756, Processing Time 0.026 seconds

On-line Trace Based Automatic Parallelization of Java Programs on Multicore Platforms

  • Sun, Yu;Zhang, Wei
    • Journal of Computing Science and Engineering
    • /
    • v.6 no.2
    • /
    • pp.105-118
    • /
    • 2012
  • We propose two new approaches that automatically parallelize Java programs at runtime. These approaches, which rely on run-time trace information collected during program execution, dynamically recompile Java byte code that can be executed in parallel. One approach utilizes trace information to improve traditional loop parallelization, and the other parallelizes traces instead of loop iterations. We also describe a cost/benefit model that makes intelligent parallelization decisions, as well as a parallel execution environment to execute parallelized programs. These techniques are based on Jikes RVM. Our approach is evaluated by parallelizing sequential Java programs, and its performance is compared to that of the manually parallelized code. According to the experimental results, our approach has low overheads and achieves competitive speedups compared to the manually parallelizing code. Moreover, trace parallelization can exploit parallelism beyond loop iterations.

Numerical dissipation for explicit, unconditionally stable time integration methods

  • Chang, Shuenn-Yih
    • Earthquakes and Structures
    • /
    • v.7 no.2
    • /
    • pp.159-178
    • /
    • 2014
  • Although the family methods with unconditional stability and numerical dissipation have been developed for structural dynamics they all are implicit methods and thus an iterative procedure is generally involved for each time step. In this work, a new family method is proposed. It involves no nonlinear iterations in addition to unconditional stability and favorable numerical dissipation, which can be continuously controlled. In particular, it can have a zero damping ratio. The most important improvement of this family method is that it involves no nonlinear iterations for each time step and thus it can save many computationally efforts when compared to the currently available dissipative implicit integration methods.

A Comparative Study on the PSO and APSO Algorithms for the Optimal Design of Planar Patch Antennas (평면형 패치 안테나의 최적설계를 위한 PSO와 APSO 알고리즘 비교 연구)

  • Kim, Koon-Tae;Kim, Hyeong-Seok
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.62 no.11
    • /
    • pp.1578-1583
    • /
    • 2013
  • In this paper, stochastic optimization algorithms of PSO (Particle Swarm Optimization) and APSO (Adaptive Particle Swam Optimization) are studied and compared. It is revealed that the APSO provides faster convergence and better search efficiency than the conventional PSO when they are adopted to find the global minimum of a two-dimensional function. The advantages of the APSO comes from the ability to control the inertia weight, and acceleration coefficients. To verify that the APSO is working better than the standard PSO, the design of a 10GHz microstrip patch as one of the elements of a high frequency array antenna is taken as a test-case and shows the optimized result with 5 iterations in the APSO and 28 iterations in th PSO.

LDPC Decoding by Failed Check Nodes for Serial Concatenated Code

  • Yu, Seog Kun;Joo, Eon Kyeong
    • ETRI Journal
    • /
    • v.37 no.1
    • /
    • pp.54-60
    • /
    • 2015
  • The use of serial concatenated codes is an effective technique for alleviating the error floor phenomenon of low-density parity-check (LDPC) codes. An enhanced sum-product algorithm (SPA) for LDPC codes, which is suitable for serial concatenated codes, is proposed in this paper. The proposed algorithm minimizes the number of errors by using the failed check nodes (FCNs) in LDPC decoding. Hence, the error-correcting capability of the serial concatenated code can be improved. The number of FCNs is simply obtained by the syndrome test, which is performed during the SPA. Hence, the decoding procedure of the proposed algorithm is similar to that of the conventional algorithm. The error performance of the proposed algorithm is analyzed and compared with that of the conventional algorithm. As a result, a gain of 1.4 dB can be obtained by the proposed algorithm at a bit error rate of $10^{-8}$. In addition, the error performance of the proposed algorithm with just 30 iterations is shown to be superior to that of the conventional algorithm with 100 iterations.

Compact-Size Fractal Antenna with Stable Radiation Properties for Wi-Fi and WiMAX Communications

  • Abed, Amer T.;Singh, Mandeep S.J.;Islam, Mohammad Tariqul
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.6
    • /
    • pp.2734-2747
    • /
    • 2018
  • In this study, a novel fractal ring antenna with a compact size of $24{\times}9{\times}0.8mm^3$ was configured using three iterations. Low profile, circular polarization, and measured operating bands (4.5-6.5 GHz) meet specifications of the upper band used in Wi-Fi and WiMAX applications. The antenna featured, stable radiation properties, especially gain and efficiency, in the notched band (92%). In deep, the antenna impedance, reflection coefficients, surface current distribution and circular polarization for the three iterations had been studied to improve the process of antenna design and its radiation characteristics.

Convergence Diagnostics for the Gibbs Sampler

  • Sohn, Joong-Kweon;Kim, Heon-Joo;Kang, Sang-Gil
    • Journal of the Korean Data and Information Science Society
    • /
    • v.7 no.1
    • /
    • pp.1-12
    • /
    • 1996
  • The Gibbs sampler is a substantially powerful tool in Bayesian analysis. However, it is necerssary to choose the numbert of iterations and the size of random samples. This problem has been studied by many researchers. The proposed procedures by them are generally difficult to apply to a practical problem. The attraction of the sampling based approaches is their conceptual simplicity and ease of implementation for users with available computing resources but without numerical analytic efforts. In this paper we consider the problem of determining the number of iterations t, which is simple to application.

  • PDF

CFD Model of the Base Flow on Axi-symmetric Nacelle Using Singularities (축대칭 나셀에서 특이점을 이용한 베이스 유동의 전산해석적인 모델)

  • Baik Doo Sung;Han Young Chool
    • Journal of computational fluids engineering
    • /
    • v.6 no.2
    • /
    • pp.1-8
    • /
    • 2001
  • Despite the massive effort which has been given to the analysis of the base flows, one commonly occurring case seems to be overlooked. This is for base (rearward facing surface) which is between a subsonic flow and supersonic flow. Potential flows of the air and gas streams are computed for the flow past a separated wake. Then a viscous jet mixing is superimposed on this inviscid solution. Conservation of mass, momentum and energy is achieved by multiple iterations. Despite the iterations, the wake flow field is computed with modest computer requirements.

  • PDF

Performance of Iterative Multiuser Detector and Turbo Decoder in WCDMA System (WCDMA 시스템에l서 반복 다중사용자 검출기 및 터보 복호기의 성능)

  • Kim, Jeong-Goo
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.11 no.4
    • /
    • pp.40-46
    • /
    • 2006
  • The performance of iterative multiuser detector and turbo decoder is presented to provide high quality multimedia services in WCDMA (wideband code division multiple access) system in this paper. Especially the relationship between the local iteration of turbo decoder and the global iteration of multiuser detector including the turbo decoder is analyzed. As a result, three local iterations and three global iterations are considered to be sufficient to provide satisfactory error performance with resonable complexity. The interference cancellation capability of global iteration is improved when the number of users is increased.

  • PDF

An Algorithm for One-Sided Generalized Least Squares Estimation and Its Application

  • Park, Chul-Gyu
    • Journal of the Korean Statistical Society
    • /
    • v.29 no.3
    • /
    • pp.361-373
    • /
    • 2000
  • A simple and efficient algorithm is introduced for generalized least squares estimation under nonnegativity constraints in the components of the parameter vector. This algorithm gives the exact solution to the estimation problem within a finite number of pivot operations. Besides an illustrative example, an empirical study is conducted for investigating the performance of the proposed algorithm. This study indicates that most of problems are solved in a few iterations, and the number of iterations required for optimal solution increases linearly to the size of the problem. Finally, we will discuss the applicability of the proposed algorithm extensively to the estimation problem having a more general set of linear inequality constraints.

  • PDF

Probabilistic computation of the structural performance of moment resisting steel frames

  • Ceribasi, Seyit
    • Steel and Composite Structures
    • /
    • v.24 no.3
    • /
    • pp.369-382
    • /
    • 2017
  • This study investigates the reliability of the performance levels of moment resisting steel frames subjected to lateral loads such as wind and earthquake. The reliability assessment has been performed with respect to three performance levels: serviceability, damageability, and ultimate limit states. A four-story moment resisting frame is used as a typical example. In the reliability assessment the uncertainties in the loadings and in the capacity of the frame have been considered. The wind and earthquake loads are assumed to have lognormal distribution, and the frame resistance is assumed to have a normal distribution. In order to obtain an appropriate limit state function a linear relation between the loading and the deflection is formed. For the reliability analysis an algorithm has been developed for determination of limit state functions and iterations of the first order reliability method (FORM) procedure. By the method presented herein the multivariable analysis of a complicated reliability problem is reduced to an S-R problem. The procedure for iterations has been tested by a known problem for the purpose of avoiding convergence problems. The reliability indices for many cases have been obtained and also the effects of the coefficient of variation of load and resistance have been investigated.