• Title/Summary/Keyword: load computation

Search Result 471, Processing Time 0.031 seconds

An Efficient Dynamic Load balancing Strategy for Tree-structured Computations (트리구조의 계산을 위한 효율적인 동적 부하분산 전략)

  • Hwang, In-Jae;Hong, Dong-Kweon
    • The KIPS Transactions:PartA
    • /
    • v.8A no.4
    • /
    • pp.455-460
    • /
    • 2001
  • For some applications, the computational structure changes dynamically during the program execution. When this happens, static partitioning and allocation of tasks are not enough to achieve high performance in parallel computers. In this paper, we propose a dynamic load balancing algorithm efficiently distributes the computation with dynamically growing tree structure to processors. We present an implementation technique for the algorithm on mesh architectures, and analyze its complexity. We also demonstrate through experiments how our algorithm provides good quality solutions.

  • PDF

Real-Time Digital Control of PWM Inverter Empolyed DSP (DSP에 의한 PWM 인버터의 Real-Time Digital 제어)

  • Park, Ga-Woo;Min, Wan-Ki;Choi, Jae-Ho;Choi, Sung-Ryool
    • Proceedings of the KIEE Conference
    • /
    • 1993.07b
    • /
    • pp.724-727
    • /
    • 1993
  • This paper is presented real-time digital control techniques of the PWM inverter for UPS. This proposed system is based on instantaneous digital control scheme which is empolyed double dead beat control and prediction method. Especially, to supply the load current from the inverter without the computation delay, the predictive methods are used to generate the load current signal. From the simulation and experimental results, it is shown that presented scheme has good performance such as very low THD of the output voltage, and good dynamic response under the nonlinear load. The experimental implementation of the system is estabilished by using the TMS320C25 DSP.

  • PDF

Salinity Routing Through Reservoir using WRAP-SALT (WRAP-SALT를 이용한 저수지 염분 추적)

  • Lee, Chi-Hun;Ko, Taek-Jo
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2012.05a
    • /
    • pp.221-221
    • /
    • 2012
  • The WRAP-SALT (Water Rights Analysis Package-SALT) simulation includes computation of end-of-month reservoir storage concentrations and mean monthly reservoir outflow concentrations for each month of the simulation. The model computes reservoir storage loads and concentrations based on load balance accounting algorithms and computes concentrations of water released and withdrawn from a reservoir as a function of the volume-weighted mean concentration of the water stored in the reservoir in the current month or previous months. A load budget accounting of the various component load inflows and outflows entering and leaving a reservoir is performed. A time history of storage concentrations computed for previous months is maintained for use in the lag procedure. This study presents computational methods for routing salinity through reservoirs for incorporation into WRAP-SALT simulation routines and methods for determining values for the parameters of the routing methods.

  • PDF

Fast computation of Observation Probability for Speaker-Independent Real-Time Speech Recognition (실시간 화자독립 음성인식을 위한 고속 확률계산)

  • Park Dong-Chul;Ahn Ju-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.9C
    • /
    • pp.907-912
    • /
    • 2005
  • An efficient method for calculation of observation probability in CDHMM(Continous Density Hidden Markov Model) is proposed in this paper. the proposed algorithm, called FCOP(Fast Computation of Observation Probability), approximate obsewation probabilities in CDHMM by eliminating insignificant PDFs(Probability Density Functions) and reduces the computational load. When applied to a speech recognition system, the proposed FCOP algorithm can reduce the instruction cycles by $20\%-30\%$ and can also increase the recognition speed about $30\%$ while minimizing the loss in its recognition rate. When implemented on a practical cellular phone, the FCOP algorithm can increase its recognition speed about $30\%$ while suffering $0.2\%$ loss in recognition rate.

Stochastic Power-efficient DVFS Scheduling of Real-time Tasks on Multicore Processors with Leakage Power Awareness (멀티코어 프로세서의 누수 전력을 고려한 실시간 작업들의 확률적 저전력 DVFS 스케쥴링)

  • Lee, Kwanwoo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.4
    • /
    • pp.25-33
    • /
    • 2014
  • This paper proposes a power-efficient scheduling scheme that stochastically minimizes the power consumption of real-time tasks while meeting their deadlines on multicore processors. In the proposed scheme, uncertain computation amounts of given tasks are translated into probabilistic computation amounts based on their past completion amounts, and the mean power consumption of the translated probabilistic computation amounts is minimized with a finite set of discrete clock frequencies. Also, when system load is low, the proposed scheme activates a part of all available cores with unused cores powered off, considering the leakage power consumption of cores. Evaluation shows that the scheme saves up to 69% power consumption of the previous method.

M_CSPF: A Scalable CSPF Routing Scheme with Multiple QoS Constraints for MPLS Traffic Engineering

  • Hong, Daniel W.;Hong, Choong-Seon;Lee, Gil-Haeng
    • ETRI Journal
    • /
    • v.27 no.6
    • /
    • pp.733-746
    • /
    • 2005
  • In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

  • PDF

Investigation of design values computation of wood shear walls constructed with structural foam sheathing

  • Shadravan, Shideh;Ramseyer, Chris C.
    • Advances in Computational Design
    • /
    • v.4 no.3
    • /
    • pp.223-238
    • /
    • 2019
  • This study investigated the ultimate lateral load capacity of shear walls constructed with several types of structural foam sheathing. Sixteen tests were conducted and the results were compared to the published design values commutated by the manufactures for each test series. The sheathing products included 12.7 mm (1/2 in) SI-Strong, 25.4 mm (1 in) SI-Strong, 12.7 mm (1/2 in) R-Max Thermasheath, and 2 mm (0.078 in) ThermoPly Green. The structural foam sheathing was attached per the manufacturers' specification to one side of the wood frame for each wall tested. Standard 12.7 mm (1/2 in) gypsum wallboard was screwed to the opposite side of the frame. Simpson HDQ8 tie-down anchors were screwed to the terminal studs at each end of the wall and anchored to the base of the testing apparatus. Both monotonic and cyclic testing following ASTM E564 and ASTM E2126, respectively, were considered. Results from the monotonic tests showed an 11 to 27 percent smaller capacity when compared to the published design values. Likewise, the test results from the cyclic tests showed a 24 to 45 percent smaller capacity than the published design values and did not meet the seismic performance design criteria computation.

Minimum-Power Scheduling of Real-Time Parallel Tasks based on Load Balancing for Frequency-Sharing Multicore Processors (주파수 공유형 멀티코어 프로세서를 위한 부하균등화에 기반한 실시간 병렬 작업들의 최소 전력 스케줄링)

  • Lee, Wan Yeon
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.6
    • /
    • pp.177-184
    • /
    • 2015
  • This paper proposes a minimum-power scheduling scheme of real-time parallel tasks while meeting deadlines of the real-time tasks on DVFS-enabled multicore processors. The proposed scheme first finds a floating number of processing cores to each task so that the computation load of all processing cores would be equalized. Next the scheme translates the found floating number of cores into a natural number of cores while maintaining the computation load of all cores unchanged, and allocates the translated natural number of cores to the execution of each task. The scheme is designed to minimize the power consumption of the frequency-sharing multicore processor operating with the same processing speed at an instant time. Evaluation shows that the scheme saves up to 38% power consumption of the previous method.

A Comparative Study on the 1-D and 3-D Load Follow Analysis Methods of Light Water Reactor (경수로의 부하추종 운전에 대한 1차원 및 3차원 해석방법의 비교 연구)

  • Kim, Chang-Hyo;Lee, Sang-Hoon;Chung, Chang-Hyun
    • Nuclear Engineering and Technology
    • /
    • v.19 no.1
    • /
    • pp.34-41
    • /
    • 1987
  • This work concerns with a comparison of the 1-dimensional (or 1-D) load follow analysis method with reference to the detailed 3-dimensional (or 3-D) computations. For this purpose a 1-D two-group finite difference code, HLOFO, and a 3-D coarse-mesh code based on the modified Borresen's method, CMSNAC, are developed. The CMSNAC code is used to obtain the 3-D power peaks and reactivity parameters in response to power swing from 100 to 50 and back to 100% in the 12-3-6-3 load cycle for the BOL of the KORI Unit 1 PWR core. The 3-D result is then compared with the 1-D HLOFO computations, the cross section and buckling inputs of which are obtained by combining the flux-volume weighting scheme with the approximate flux from the auxiliary 3-D computations. It is shown that the 1-D computation has a limited accuracy, yet it is confirmed that it can describe the core axial average behavior which is fairly consistent with the detailed 3-D computation.

  • PDF

Definition and Application of Equivalent Load for Stiffness (강성등가하중의 정의와 응용)

  • Kim Chee-Kyeong
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.19 no.3 s.73
    • /
    • pp.303-312
    • /
    • 2006
  • This paper presents the equivalent nodal load for the element stiffness which represents the influence of the stiffness change such as the addition of elements, the deletion of elements, and/or the partial change of element stiffness. The reanalysis of structure using the equivalent load improves the efficiency very much because the inverse of the structural stiffness matrix, which needs a large amount of computation to calculate, is reused in the reanalysis. In this paper, the concept of the equivalent load for the element stiffness is described and some numerical examples are provided to verify it.