• 제목/요약/키워드: Partitioning method

검색결과 598건 처리시간 0.031초

Iterative mesh partitioning strategy for improving the efficiency of parallel substructure finite element computations

  • Hsieh, Shang-Hsien;Yang, Yuan-Sen;Tsai, Po-Liang
    • Structural Engineering and Mechanics
    • /
    • 제14권1호
    • /
    • pp.57-70
    • /
    • 2002
  • This work presents an iterative mesh partitioning approach to improve the efficiency of parallel substructure finite element computations. The proposed approach employs an iterative strategy with a set of empirical rules derived from the results of numerical experiments on a number of different finite element meshes. The proposed approach also utilizes state-of-the-art partitioning techniques in its iterative partitioning kernel, a cost function to estimate the computational cost of each submesh, and a mechanism that adjusts element weights to redistribute elements among submeshes during iterative partitioning to partition a mesh into submeshes (or substructures) with balanced computational workloads. In addition, actual parallel finite element structural analyses on several test examples are presented to demonstrate the effectiveness of the approach proposed herein. The results show that the proposed approach can effectively improve the efficiency of parallel substructure finite element computations.

Software Pipeline-Based Partitioning Method with Trade-Off between Workload Balance and Communication Optimization

  • Huang, Kai;Xiu, Siwen;Yu, Min;Zhang, Xiaomeng;Yan, Rongjie;Yan, Xiaolang;Liu, Zhili
    • ETRI Journal
    • /
    • 제37권3호
    • /
    • pp.562-572
    • /
    • 2015
  • For a multiprocessor System-on-Chip (MPSoC) to achieve high performance via parallelism, we must consider how to partition a given application into different components and map the components onto multiple processors. In this paper, we propose a software pipeline-based partitioning method with cyclic dependent task management and communication optimization. During task partitioning, simultaneously considering computation load balance and communication optimization can cause interference, which leads to performance loss. To address this issue, we formulate their constraints and apply an integer linear programming approach to find an optimal partitioning result - one that requires a trade-off between these two factors. Experimental results on a reconfigurable MPSoC platform demonstrate the effectiveness of the proposed method, with 20% to 40% performance improvements compared to a traditional software pipeline-based partitioning method.

관계형 데이터 베이스 설계에서 분지한계법을 이용한 수직분할문제 (Branch-and-bound method for solving vertical partitioning problems in the design of the relational database)

  • 윤병익;김재련
    • 산업경영시스템학회지
    • /
    • 제19권37호
    • /
    • pp.241-249
    • /
    • 1996
  • In this paper, a 0-1 integer programming model for solving vertical partitioning problem minimizing the number of disk accesses is formulated and a branch-and-bound method is used to solve the binary vertical partitioning problem. In relational databases, the number of disk accesses depends on the amount of data transferred from disk to main memory for processing the transactions. Vertical partitioning of the relation can often result in a decrease in the number of disk accesses, since not all attributes in a tuple are required by each transactions. The algorithm is illustrated with numerical examples and is shown to be computationally efficient. Numerical experiments reveal that the proposed method is more effective in reducing access costs than the existing algorithms.

  • PDF

COGNITIVE RADIO SPECTRUM ACCESS WITH CHANNEL PARTITIONING FOR SECONDARY HANDOVER CALLS

  • Lee, Yutae
    • Journal of applied mathematics & informatics
    • /
    • 제33권1_2호
    • /
    • pp.211-217
    • /
    • 2015
  • A dynamic spectrum access scheme with channel partitioning for secondary handover calls in cognitive radio networks is proposed to reduce forced termination probability due to spectrum handover failure. A continuous-time Markov chain method for evaluating its performance such as blocking probability, forced termination probability, and throughput is presented. Numerical and simulation results are provided to demonstrate the effectiveness of the proposed scheme with channel partitioning.

그래프 분할을 이용한 시스템 레벨 결함 진단 기법 (System-Level Fault Diagnosis using Graph Partitioning)

  • 전광일;조유근
    • 한국정보과학회논문지:시스템및이론
    • /
    • 제26권12호
    • /
    • pp.1447-1457
    • /
    • 1999
  • 본 논문에서는 일반적인 네트워크에서 적응력 있는(adaptive) 분산형 시스템 레벨 결함 진단을 위한 분할 기법을 제안한다. 적응력 있는 분산형 시스템 레벨 결함 진단 기법에서는 시스템의 형상이 변경될 때마다 시험 할당 알고리즘이 수행되므로 적응력 없는 결함 진단 기법에 비하여 결함 감지를 위한 시험의 갯수를 줄일 수 있다. 기존의 시험 할당 알고리즘들은 전체 시스템을 대상으로 하는 비분할(non-partitioning) 방식을 이용하였는데, 이 기법은 불필요한 과다한 메시지를 생성한다. 본 논문에서는 전체 시스템을 이중 연결 요소(biconnected component) 단위로 분할한 후, 시험 할당은 각 이중 연결 요소 내에서 수행한다. 이중 연결 요소의 관절점(articulation point)의 특성을 이용하여 각 시험 할당에 필요한 노드의 수를 줄임으로서, 비분할 기법들에 비해 초기 시험 할당에 필요한 메시지의 수를 감소시켰다. 또한 결함이 발생한 경우나 복구가 완료된 경우의 시험 재 할당은 직접 영향을 받는 이중 연결 요소내로 국지화(localize) 시켰다. 본 논문의 시스템 레벨 결함 진단 기법의 정확성을 증명하였으며, 기존 비분할 방식의 시스템 레벨 결함 진단 기법과의 성능 분석을 수행하였다.Abstract We propose an adaptive distributed system-level diagnosis using partitioning method in arbitrary network topologies. In an adaptive distributed system-level diagnosis, testing assignment algorithm is performed whenever the system configuration is changed to reduce the number of tests in the system. Existing testing assignment algorithms adopt a non-partitioning approach covering the whole system, so they incur unnecessary extra message traffic and time. In our method, the whole system is partitioned into biconnected components, and testing assignment is performed within each biconnected component. By exploiting the property of an articulation point of a biconnected component, initial testing assignment of our method performs better than non-partitioning approach by reducing the number of nodes involved in testing assignment. It also localizes the testing reassignment caused by system reconfiguration within the related biconnected components. We show that our system-level diagnosis method is correct and analyze the performance of our method compared with the previous non-partitioning ones.

변형률분할법에 의한 12Cr 단조강의 열피로 수명예측 (Thermal-mechanical Fatigue Life Prediction of 12Cr Forged Steel Using Strain Range Partitioning method)

  • 하정수;옹장우;고승기
    • 대한기계학회논문집
    • /
    • 제18권5호
    • /
    • pp.1192-1202
    • /
    • 1994
  • Fatigue behavior and life prediction were presented for thermal-mechanical and isothermal low cycle fatigue of 12Cr forged steel used for high temperature applications. In-phase and out-of-phase thermal-mechanical fatigue test at 350 to 600.deg. C and isothermal low cycle fatigue test at 600.deg. C were conducted using smooth cylindrical hollow specimen under strain-control with total strain ranges from 0.006 to 0.015. Cyclic softening behavior was observed regardless of thermal-mechanical and isothermal fatigue tests. The phase difference between temperature and strain in thermal-mechanical fatigue resulted in significantly shorter fatigue life for out-of-phase than for in-phase. The difference in fatigue lives was dependent upon the magnitudes of inelastic strain ranges and mean stresses. Increase in inelastic strain range showed a tendency of intergranular cracking and decrease in fatigue life, especially for out-of-phase thermal-mechanical fatigue. Thermal-mechanical fatigue life prediction was made by partitioning the strain ranges of the hysteresis loops and the results of isothermal low cycle fatigue tests which were performed under the combination of slow and fast strain rates. Predicted fatigue lives for out-of-phase using the strain range partitioning method showed an excellent agreement with the actual out-of-phase thermal-mechanical fatigue lives within a factor of 1.5. Conventional strain range partitioning method exhibited a poor accuracy in the prediction of in-phase thermal-mechanical fatigue lives, which was quite improved conservatively by a proposed strain range partitioning method.

허프 변환을 이용한 VVC의 기하학 분할 모드 및 블록 분할 고속 결정 방법 (Fast Decision Method of Geometric Partitioning Mode and Block Partitioning Mode using Hough Transform in VVC)

  • 이민훈;박준택;방건;임웅;심동규;오승준
    • 방송공학회논문지
    • /
    • 제25권5호
    • /
    • pp.698-708
    • /
    • 2020
  • 현재 차세대 부호화 표준으로 진행 중인 VVC (Versatile Video Coding)는 재귀적 블록 분할 구조 및 GPM (Geometric Partitioning Mode)과 같은 다양한 예측 방법들의 채택으로 HEVC (High Efficiency Video Coding)대비 RA (Random Access) 환경에서 약 34%와 LDB (Low-Delay B) 환경에서 약 30%의 부호화 성능 향상을 보이지만 부호화 복잡도는 약 10배, 7배 증가를 보인다. 본 논문에서는 VVC의 부호화 복잡도 개선을 위하여 블록 내 방향성을 이용한 GPM 모드 고속 결정 및 블록 분할 고속 결정 방법을 제안한다. 제안하는 방법은 현재 블록에 허프 변환을 적용하여 블록 내의 방향성을 파악하고, 이를 통해 율-왜곡 비용 탐색 과정에서 생략할 GPM 모드와 특정 블록 분할 방법을 결정하는 방법이다. 실험 결과로써 제안하는 방법은 VTM8.0 대비 RA 환경에서 2.48%의 부호화 성능 감소와 31.01%의 부호화 시간 감소의 효과를 얻고 LDB 환경에서 2.69%의 부호화 성능 감소와 29.84%의 부호화 시간 감소의 효과를 얻었다.

Frequency and Subcarrier Reuse Partitioning for FH-OFDMA Cellular Systems

  • Lee, Yeonwoo;Kim, Kyung-Ho
    • 한국멀티미디어학회논문지
    • /
    • 제16권5호
    • /
    • pp.601-609
    • /
    • 2013
  • One of the most serious factors constraining the next generation cellular mobile consumer communication systems will be the severe co-channel interference experienced at the cell edge. Such a capacity-degrading impairment combined with the limited available spectrum resource makes it essential to develop more spectrally efficient solutions to enhance the system performance and enrich the mobile user's application services. This paper proposes a unique hybrid method of frequency hopping (FH) and subcarrier-reuse-partitioning that can maximize the system capacity by efficiently utilizing the available spectrum while at the same time reduce the co-channel interference effect. The main feature of the proposed method is that it applies an optimal combination of different frequency reuse factors (FRF) and FH-subcarrier allocation patterns into the partitioned cell regions. From the simulation results, it is shown that the proposed method can achieve the optimum number of subcarrier subsets according to the frequency-reuse distance and results in better performance than the fixed FRF methods, for a given partitioning arrangement. The results are presented in the context of both blocking probability and BER performances. It will also be shown how the proposed scheme is well suited to FH-OFDMA based cellular systems aiming at low co-channel interference performance and optimized number of subcarriers.

식품 성분과 식품 포장용 인쇄 잉크 용매의 화학적 구조가 분배작용에 미치는 영향 (Effect of chemical and physical structure on partitioning behavior of representative printing ink solvents and various food ingredients)

  • 안덕준
    • 한국포장학회지
    • /
    • 제10권1호
    • /
    • pp.7-14
    • /
    • 2004
  • Migration behavior of selected solvents and food samples showed differences of the chemical structures and polarities, the food samples which have similar polar expresses more higher affinity than different polar degrees. Water which is polar has a highest partitioning coefficient values on polar isopropanol, and oil which is nonpolar has highest partitioning value on non-polar toluene. The increasing order of partitioning values was accord with increasing water contents in food samples. It is showed that the wheat flour with 13.2% moisture content has the highest partitioning coefficient values on the isopropanol with -OH. Kp value of sugar showed remarkable lower partitioning coefficient values than other food samples due to high degree crystallinity. This phenomenon can be predictable with ${\delta}$ values, because order of partitioning coefficient values which comes out through the experiment and the sequence of Hildebrand solubility parameter value difference between food sample and printing ink solvent correspond almost. This Hildebrand solubility parameter value can be easily applied to the food package industry because the effect of food-safety can be considered without passing through complicated steps by using this method.

  • PDF

다중블록/다중영역분할 기법을 이용한 유동해석 코드 병렬화 (Parallelization of Multi-Block Flow Solver with Multi-Block/Multi-Partitioning Method)

  • 주완돈;이보성;이동호;홍승규
    • 한국항공우주학회지
    • /
    • 제31권7호
    • /
    • pp.9-14
    • /
    • 2003
  • 본 연구에서는 다중블록 격자를 병렬화 하기 위해서 다중블록/다중영역분할 기법을 제안하였다. 이 방법은 각 블록을 사용하고자 하는 프로세서의 개수만큼 나눔으로써 전체 프로세서에 대해서 균일한 로드 밸런싱을 유지할 수 있는 장점이 있다. 영역분할 기법에 따른 병렬화 효율 및 속도 향상률을 비교하기 위해서 다중블록/단일 영역분할 기법과 다중블록/다중 영역분할 기법을 서로 비교 하였으며, 블록간의 격자수가 크게 다른 경우 다중영역 분할 기법이 로드 밸런싱에 있어서 보다 안정적임을 확인 할 수 있었다. 또한 이를 CFDS에 적용함으로써 다중블록 다중영역분할 기법의 효용성을 검증하였다. 3차원 계산의 경우 프로세서 16개를 사용하는 경우 약 12배의 속도 향상률을 보였으며, 다중블록을 병렬화 하는데 있어서 다중블록/다중영역 분할 기법이 효율적인 도구가 될 수 있음을 보였다.