• Title/Summary/Keyword: Distributed Load

Search Result 1,301, Processing Time 0.025 seconds

An Efficient Data Replacement Algorithm for Performance Optimization of MapReduce in Non-dedicated Distributed Computing Environments (비-전용 분산 컴퓨팅 환경에서 맵-리듀스 처리 성능 최적화를 위한 효율적인 데이터 재배치 알고리즘)

  • Ryu, Eunkyung;Son, Ingook;Park, Junho;Bok, Kyoungsoo;Yoo, Jaesoo
    • The Journal of the Korea Contents Association
    • /
    • v.13 no.9
    • /
    • pp.20-27
    • /
    • 2013
  • In recently years, with the growth of social media and the development of mobile devices, the data have been significantly increased. MapReduce is an emerging programming model that processes large amount of data. However, since MapReduce evenly places the data in the dedicated distributed computing environment, it is not suitable to the non-dedicated distributed computing environment. The data replacement algorithms were proposed for performance optimization of MapReduce in the non-dedicated distributed computing environments. However, they spend much time for date replacement and cause the network load for unnecessary data transmission. In this paper, we propose an efficient data replacement algorithm for the performance optimization of MapReduce in the non-dedicated distributed computing environments. The proposed scheme computes the ratio of data blocks in the nodes based on the node availability model and reduces the network load by transmitting the data blocks considering the data placement. Our experimental results show that the proposed scheme outperforms the existing scheme.

Optimal Distributed Computation with Communication Delays (통신지연이 있는 분산처리의 최적화)

  • Kim, Hyoung-Joong;Jee, Gyu-In;Lee, Jang-Gyu
    • Proceedings of the KIEE Conference
    • /
    • 1991.07a
    • /
    • pp.748-752
    • /
    • 1991
  • Tree network consisting of communicating processors is considered. The objective is to minimize the computation time by distributing the processing load to other nodes. The effect of the order of load distribution on the processing time is addressed. An algorithm which optimally determines the order of load distribution is developed. It is shown that the order depends only on the channel capacity between nodes but not on the computing capability of each node.

  • PDF

A Study on Adbanced Load Balancing for Multiprocessor System (다중처리 시스템에서 향상된 부하분산에 관한 연구)

  • 김중민;유재욱;박인갑
    • Proceedings of the IEEK Conference
    • /
    • 2002.06a
    • /
    • pp.243-246
    • /
    • 2002
  • In this paper, an advanced load balancing algorithm in nth order Hypercube distributed system has been proposed. The new algorithm uses centralized load-balancing to avoid blocking phenomenon and processor thrashing, and shows the results which makes loads to approach average value of loads. The new algorithm os compared with several other algorithm and it shows a merit in cost function value.

  • PDF

Study on Live Loads in Office Buildings (사무실 적재하중의 통계적 조사 연구)

  • 김상효;조형근;배규웅;박홍석
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1989.10a
    • /
    • pp.25-28
    • /
    • 1989
  • Live load data in domestic office buildings have been collected in a systematic manner. Based on surveyed data, equivalent uniformly distributed load intensities, which produce the same load effect as the actual spatially varying live load, have been obtained for various structural members(such as slab, beam, column, etc.). Influence surface method has been employed to compute load effects under real live load, inclucing beam moment, slab moment as well as axial force and moments in column. The results have been examined to find probabilistic characteristics and relationship between influence area and load intensity(or coefficient of variation). The results were also compared with other survey results and found to be reasonable.

  • PDF

Mitigation of Negative Impedance Instabilities in a DC/DC Buck-Boost Converter with Composite Load

  • Singh, Suresh;Rathore, Nupur;Fulwani, Deepak
    • Journal of Power Electronics
    • /
    • v.16 no.3
    • /
    • pp.1046-1055
    • /
    • 2016
  • A controller to mitigate the destabilizing effect of constant power load (CPL) is proposed for a DC/DC buck-boost converter. The load profile has been considered to be predominantly of CPL type. The negative incremental resistance of the CPL tends to destabilize the feeder system, which may be an input filter or another DC/DC converter. The proposed sliding mode controller aims to ensure system stability under the dominance of CPL. The effectiveness of the controller has been validated through real-time simulation studies and experiments under various operating conditions. The controller has been demonstrated to be robust with respect to variations in supply voltage and load and capable of mitigating instabilities induced by CPL. Furthermore, the controller has been validated using all possible load profiles, which may arise in modern-day DC-distributed power systems.

Vehicle Load Effects on Slab of Parking Garage Structure (주차장 구조물 슬래브의 차량하중영향에 관한 연구)

  • 곽효경;송종영
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1997.04a
    • /
    • pp.131-138
    • /
    • 1997
  • The equivalent vehicle load factors which can consider the concentrated wheel load effect in slab design of parking garage structure are proposed. Based on the standard vehicle with total weight of 2.4 ton which is designed through the investigation of small to medium vehicle produced in Korea and the review of numerous foreign design codes for parking garage structure, the effects of moving vehicle loads on slab are analyzed using the finite element method. Besides. the relationships between the equivalent load factors and the sectional dimensions are established by regression analysis. The calculation of design forces can be easily accomplished without taking sophisticated numerical analysis for the moving vehicle load as the results obtained to the distributed load are multiplied by the proposed load factors in practice.

  • PDF

Indivisible load scheduling applied to Linear Programming (선형계획법을 적용한 임의 분할 불가능한 부하 분배계획)

  • Son, Kyung-Ho;Lee, Dal-Ho;Kim, Hyoung-Joog
    • 한국정보통신설비학회:학술대회논문집
    • /
    • 2005.08a
    • /
    • pp.382-387
    • /
    • 2005
  • There are many studies on arbitrarily divisible load scheduling problem in a distributed computing network consisting of processors interconnected through communication links. It is not efficient to arbitrarily distribute the load that comes into the system. In this paper, how to schedule in case that arbitrarily indivisible load comes into the system is studied. Also, the cases of the divisible load mixed with the indivisible load that come into network were dealt with optimal load distribution in parallel processing system by scheduling applied to linear programming.

  • PDF

Thermomechanical interactions in a transversely isotropic thermoelastic media with diffusion due to inclined load

  • Parveen Lata;Heena
    • Structural Engineering and Mechanics
    • /
    • v.90 no.3
    • /
    • pp.263-272
    • /
    • 2024
  • This research deals with the study of two-dimensional deformation in transversely isotropic thermoelastic diffusion medium. This investigation integrates the effect of diffusion and thermal effects in transversely isotropic thermoelastic solids under inclined load. Inclined load is taken as linear combination of normal load and tangential load. Laplace and Fourier transformation techniques are employed to transform the physical domain and then transformed solutions are inverted with the aid of numerical inversion techniques. Concentrated and distributed load are considered to exemplify its utility. Graphical representation of variation in displacement, stresses, temperature and concentration distribution with distance is depicted by taking inclination at different angles. Some particular cases are studied.

FEA-Based Optimal Design of Permanent Magnet DC Motor Using Internet Distributed Computing

  • Lee, Cheol-Gyun;Choi, Hong-Soon
    • Journal of IKEEE
    • /
    • v.13 no.3
    • /
    • pp.24-31
    • /
    • 2009
  • The computation time of FEA(finite element analysis) for one model may range from a few seconds up to several hours according to the complexity of the simulated model. If these FEA is used to calculate the objective and the constraint functions during the optimal solution search, it causes very excessive execution time. To resolve this problem, the distributed computing technique using internet web service is proposed in this paper. And the dynamic load balancing mechanisms are established to advance the performance of distributed computing. To verify its validity, this method is applied to a traditional mathematical optimization problem. And the proposed FEA-based optimization using internet distributed computing is applied to the optimal design of the permanent magnet dc motor(PMDCM) for automotive application.

  • PDF

Fault detection using heartbeat signal in the real-time distributed systems (실시간 분산 시스템에서 heartbeat 시그널을 이용한 장애 검출)

  • Moon, Wonsik
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.14 no.3
    • /
    • pp.39-44
    • /
    • 2018
  • Communication in real-time distributed system should have high reliability. To develop group communication Protocol with high reliability, potential fault should be known and when fault occurs, it should be detected and a necessary action should be taken. Existing detection method by Ack and Time-out is not proper for real time system due to load to Ack which is not received. Therefore, group communication messages from real-time distributed processing systems should be communicated to all receiving processors or ignored by the message itself. This paper can make be sure of transmission of reliable message and deadline by suggesting and experimenting fault detection technique applicable in the real time distributed system based on ring, and analyzing its results. The experiment showed that the shorter the cycle of the heartbeat signal, the shorter the time to propagate the fault detection, which is the time for other nodes to detect the failure of the node.