• Title/Summary/Keyword: 재분배 기법

Search Result 74, Processing Time 0.02 seconds

Development of Resizing Techniques for Drift Designs of High-rise Buildings subjected to Lateral and Vertical Loads (횡하중과 연직하중을 받는 고층건물의 변위설계를 위한 재분배기법 개발)

  • 서지현;박효선
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.17 no.1
    • /
    • pp.49-58
    • /
    • 2004
  • Drift design of a high-rise building is a governing factor in the determination of structural weights and lateral resisting systems. However, high-rise buildings are composed of tens of thousands of structural member, designer can not know which members are active to lateral drift control and how much they contribute to lateral drifts. Resizing technique was proved to be a practical method for drift design of high-rise buildings. However, no resizing algorithm has been considered the effect of vertical loads in drift designs. Thus, in this paper, a resizing algorithm has been developed for drift designs of high-rise buildings subjected to both lateral and vertical loads. The drift design model has been applied to drift designs of two high-rise building examples.

Dynamic Method wiht a Maximum Difference [{1} over {2} logn] for Redistributing of Quantized Loads on Hypercubes (하이퍼큐브에서 최대오차가 [{1} over {2} logn] 인 양자화된 부하의 동적 재분배 기법)

  • Im, Hwa-Gyeong;Jang, Ju-Uk;Kim, Seong-Cheon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.9
    • /
    • pp.1064-1072
    • /
    • 1999
  • The well-known Dimension Exchange Method(DEM) to quantized loads may result in difference in assigned loads to processors as large as logn~units, in the worst case, after balancing for a hypercube of size n. In order to limit the increase of the accumulation of these differences, this paper proposes a method that limits the accumulation of the difference by redistributing an unit load (odd or even) of the same type, if possible, when there is a load distribution between two processors. We reduced the maximum difference to LCEIL logn over {2} RCEIL . The result shows the simulation experiments which show about 30% improvement in speedup compare to the DEM.

Design Method to Control Wind-Induced Vibration of High-Rise Buildings Using Resizing Algorithm (재분배기법을 이용한 고층건물의 풍응답 가속도 조절 설계기법)

  • Seo, Ji-Hyun;Park, Hyo-Seon
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.23 no.5
    • /
    • pp.465-473
    • /
    • 2010
  • As increase of height and slenderness of buildings, serviceability design criteria such as maximum lateral drift and wind-induced vibration level play an important role in structural design of high-rise buildings. Especially, wind-induced vibration is directly related to discomfort of occupants. However, no practical algorithm or design method is available for structural designers to control the acceleration level due to wind. This paper presented a control method for wind-induced vibration of high-rise buildings using the resizing algorithm. The level of vibration due to wind is calculated by well known estimation rules of ASCE 7-02, NBCC 95, SAA83, and Solari method. Based on the fact that the level of wind-induced vibration is inversely proportional to the magnitude of natural periods of buildings, in the design method, natural periods of a high-rise building are modified by redistribution of structural weight according to the resizing algorithm. The design method is applied to wind-induced vibration control design of real 42-story residential building and evaluated the efficiency and effectiveness.

A Dynamic Load Redistribution Method including Self-adjustable in Heterogeneous Distributed System (이질형 분산시스템에서의 자기조절능력을 포함하는 동적 부하재분배 방법)

  • Shim, Dong-Hee;Cho, Dong-Young
    • The Journal of Korean Association of Computer Education
    • /
    • v.9 no.1
    • /
    • pp.107-118
    • /
    • 2006
  • Load redistribution algorithm is a critical factor in computer system. In a receiver-initiated load redistribution algorithm, receiver(underloaded processor) continues to send unnecessary request messages for load transfer until a sender(overloaded processor) is found while the system load is light. Therefore, it yields many problems such as low cpu utilization and system throughput because of inefficient inter-processor communications until the receiver receives an accept message from the sender in this environment. This paper presents an approach based on genetic algorithm(GA) for dynamic load redistribution including self-adjustable in heterogeneous distributed systems. In this scheme the processors to which the requests are sent off are determined by the proposed GA to decrease unnecessary request messages.

  • PDF

A GA-Based Adaptive Task Redistribution Method for Intelligent Distributed Computing (지능형 분산컴퓨팅을 위한 유전알고리즘 기반의 적응적 부하재분배 방법)

  • 이동우;이성훈;황종선
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.10
    • /
    • pp.1345-1355
    • /
    • 2004
  • In a sender-initiated load redistribution algorithm, a sender(overloaded processor) continues to send unnecessary request messages for load transfer until a receiver(underloaded processor) is found while the system load is heavy. In a receiver-initiated load redistribution algorithm, a receiver continues to send unnecessary request messages for load acquisition until a sender is found while the system load is light. Therefore, it yields many problems such as low CPU utilization and system throughput because of inefficient inter-processor communications in this environment. This paper presents an approach based on genetic algorithm(GA) for adaptive load sharing in distributed systems. In this scheme, the processors to which the requests are sent off are determined by the proposed GA to decrease unnecessary request messages.

A Genetic Approach for Intelligent Load Redistribution Method in Heterogeneous Distributed System (이질형시스템에서 지능적인 부하재분배를 위한 유전적 접근방법)

  • Lee Seong-Honn
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.6 no.6
    • /
    • pp.506-512
    • /
    • 2005
  • Load redistribution algorithm is a critical factor in computer system. In a receiver-initiated Toad redistribution algorithm, receiver(underloaded processor) continues to send unnecessary request messages for load transfer until a sender(overloaded processor) is found while the system load is light. Therefore, it yields many problems such as low cpu utilization and system throughput because of inefficient inter-processor communications until the receiver receives an accept message from the sender in this environment. This paper presents an approach based on genetic algorithm(GA) for dynamic load redistribution including self-adjustable in heterogeneous distributed systems. In this scheme the processors to which the requests are sent off are determined by the proposed GA to decrease unnecessary request messages.

  • PDF

Optimum of Reinforced Concrete Framed Structures by Multilevel Decomposition (다단계분할법에 의한 철근콘크리트 뼈대구조의 최적화에 관한 연구)

  • 변근주;최홍식
    • Magazine of the Korea Concrete Institute
    • /
    • v.1 no.1
    • /
    • pp.87-94
    • /
    • 1989
  • 철근콘크리트 뼈대구조와 같이 설계변수가 과다하고, 제약조건식이 복잡한 구조물의 최적화를 위하여는 구조물을 여러개의 부분구조물로 분할하여 최적해를 구하는 분할법이 많이 사용되고 있다. 그러나 기존의 분할법에 의한 최적화는 구조해석과정과 고정된 부재력에대한 단면설계변수의 부분최적화 과정만으로 이루어지기 때문에, 최적해를 구하려면 반복적인 재해석과정만을 수행하지 않으면 안된다. 따라서 본 연구에서는 다단계분할법에 의하여 철근콘크리트 뼈대구조의 최적화 문제를 3단계로 형성하고, 분할된 부분최적화문제의 최적화시 전체구조의 강성 및 부재력 변화가 반영되어 부분 구조물의 결합을 유지시킬 수 있는 최적화 알고리즘을 제안하였다. 최적화 문제에서 설계변수로는 단면의 크기, 철근량, 모멘트 재분배율등을 취하고,목적함수는 경비함수, 제약조건으로는 강도설계법에 의한 부재강도, 시방서의 요구사항등을 고려하여 문제를 형성하였다. 본 연구에서 개발한 다단계 최적화과정의 첫째 단계에서는 탄성해석에 의하여 재분배모멘트의 설계공간을 형성한다. 이 때 부재력변화량추정(forece approximation technique)에 의하여 단면치수의 변화에 따른 부재력의 변화를 제약조건식 내에 포함시킬 수 있도록 하였다. 둘째 단면에서는 첫째 단계에서 구한 부재력변화량추정이 포함된 제약조건식 내에서 무제약최소화기법에 의하여 단면치수를 최적화하도록 하였다. 셋째 단계에서는 재분배 모멘트를 최적화하였으며, 이 때 재분배모멘트의 변화에 따른 단면설계 변수의 변화는 둘째 단계에서 구한 설계민감도(design sensitivity)를 이용하여 반영시키도록 하였다. 제안된 알고리즘을 1층 2경간 및 2층 1경간 뼈대구조에 적용하여 알고리즘의 타당성과 효율성을 입증하였다. 따라서 본 연구의 알고리즘은 철근 콘크리트 뼈대구조의 최적설계에 안정성있게 적용할 수 있을 것으로 판단된다.

A Genetic Approach for Dynamic Load Redistribution in Heterogeneous Distributed Systems (이질형 분산시스템에서의 동적 부하재분배를 위한 유전적 접근법)

  • Lee, Seong-Hoon;Han, Kun-Hee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.11 no.1 s.39
    • /
    • pp.1-10
    • /
    • 2006
  • Load redistribution algorithm is a critical factor in computer system. In a receiver-initiated load redistribution algorithm, receiver(underloaded processor) continues to send unnecessary request messages for load transfer until a sender(overloaded processor) is found while the system load is light. Therefore, it yields many problems such as low CPU utilization and system throughput because of inefficient inter-processor communications until the receiver receives an accept message from the sender in this environment. This paper presents an approach based on genetic. algorithm(GA) for dynamic load redistribution in heterogeneous distributed systems. In this scheme the processors to which the requests are sent off are determined by the proposed GA to decrease unnecessary request messages.

  • PDF

Domain Key Based Efficient Redistribution Mechanism of Scalable Contents (도메인 키 기반의 효율적인 스케일러블 콘텐츠 재분배 메커니즘)

  • Park, Su-Wan;Shin, Sang-Uk
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.20 no.1
    • /
    • pp.129-134
    • /
    • 2010
  • In this paper, we propose a redistribution mechanism of the content that is adapted to devices, which may have different display size and computing capabilities, in home network. The proposed system introduces a mechanism that the encrypted content compressed by H.264/SVC(Scalable Video Coding) scheme which has been standardized recently is provided to the device into a level of content suitable to each device capability. To efficiently superdistribute SVC content, this paper defines three requirements and proposes redistribution mechanism which satisfies these requirements using another licence that it is called 'Ticket'. Our system allows devices to redistribute the content freely in the domain using domain key.