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

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

SoC를 위한 다단 HW/SW 분할 알고리듬 (A Multi-Level HW/SW Partitioning Algorithm for SoCs)

  • 안병규;신봉식;정정화
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2004년도 하계종합학술대회 논문집(2)
    • /
    • pp.553-556
    • /
    • 2004
  • In this paper, we present a new efficient multi-level hardware/software partitioning algorithm for system-on-a-chip design. Originally the multi-level partitioning algorithm are proposed to enhance the performance of previous iterative improvement partitioning algorithm for large scale circuits. But when designing very complex and heterogeneous SoCs, the HW/SW partitioning decision needs to be made prior to refining the system description. In this paper, we present a new method, based on multi-level algorithm, which can cover SoC design. The different variants of algorithm are evaluated by a randomly generated test graph. The experimental results on test graphs show improvement average $9.85\%$ and $8.51\%$ in total communication costs over FM and CLIP respectively.

  • PDF

AN INTERFERENCE FRINGE REMOVAL METHOD BASED ON MULTI-SCALE DECOMPOSITION AND ADAPTIVE PARTITIONING FOR NVST IMAGES

  • Li, Yongchun;Zheng, Sheng;Huang, Yao;Liu, Dejian
    • 천문학회지
    • /
    • 제52권2호
    • /
    • pp.49-55
    • /
    • 2019
  • The New Vacuum Solar Telescope (NVST) is the largest solar telescope in China. When using CCDs for imaging, equal-thickness fringes caused by thin-film interference can occur. Such fringes reduce the quality of NVST data but cannot be removed using standard flat fielding. In this paper, a correction method based on multi-scale decomposition and adaptive partitioning is proposed. The original image is decomposed into several sub-scales by multi-scale decomposition. The region containing fringes is found and divided by an adaptive partitioning method. The interference fringes are then filtered by a frequency-domain Gaussian filter on every partitioned image. Our analysis shows that this method can effectively remove the interference fringes from a solar image while preserving useful information.

MEC 시스템에서 태스크 파티셔닝 기법의 성능 비교 (Performance Comparison of Task Partitioning Methods in MEC System)

  • 문성원;임유진
    • 정보처리학회논문지:컴퓨터 및 통신 시스템
    • /
    • 제11권5호
    • /
    • pp.139-146
    • /
    • 2022
  • 최근 사물 인터넷의 발전과 함께 차량과 IT 기술의 융합되어 자율주행과 같은 고성능의 어플리케이션들이 등장하면서 멀티 액세스 엣지 컴퓨팅(MEC)이 차세대 기술로 부상하였다. 이런 계산 집약적인 태스크들을 낮은 지연시간 안에 제공하기 위해, 여러 MEC 서버(MECS)들이 협력하여 해당 태스크를 수행할 수 있도록 태스크를 파티셔닝하는 기법들이 많이 제안되고 있다. 태스크 파티셔닝과 관련된 연구들은 모바일 디바이스에서 태스크를 파티셔닝하여 여러 MECS들에게 오프로딩을 하는 기법과 디바이스에서 MECS로 오프로딩한 후 해당 MECS에서 파티셔닝하여 다른 MECS들에게 마이그레이션하는 기법으로 나누어볼 수 있다. 본 논문에서는 오프로딩과 마이그레이션을 이용한 파티셔닝 기법들을 파티셔닝 대상 선정 방법 및 파티셔닝 개수 변화에 따른 서비스 지연시간, 거절률 그리고 차량의 에너지 소비량 측면에서의 성능을 분석하였다. 파티셔닝 개수가 증가할수록 지연시간의 성능은 향상하나, 거절률과 에너지 소모량의 성능은 감소한다.

On the k-coloring Problem

  • Park, Tae-Hoon;Lee, Chae Y.
    • 한국경영과학회지
    • /
    • 제19권3호
    • /
    • pp.219-233
    • /
    • 1994
  • A fixed k-coloring problem is introduced and dealt with by efficient heuristic algorithms. It is shown that the problem can be transformed into the graph partitioning problem. Initial coloring and improving methods are proposed for problems with and with and without the size restriction. Algorithm Move, LEE and OEE are developed by modifying the Kernighan-Lin's two way uniform partitioning procedure. The use of global information in the selection of the node and the color set made the proposed algorithms superior to the existing method. The computational result also shows that the superiority does not sacrifice the time demand of the proposed algorithms.

  • PDF

Boltzmann Machine을 이용한 그래프의 최적분할 (Optimal Graph Partitioning by Boltzmann Machine)

  • Lee, Jong-Hee;Kim, Jin-Ho;Park, Heung-Moon
    • 대한전자공학회논문지
    • /
    • 제27권7호
    • /
    • pp.1025-1032
    • /
    • 1990
  • We proposed a neural network energy function for the optimal graph partitioning and its optimization method using Boltzmann Machine. We composed a Boltzmann Machine with the proposed neural network energy function, and the simulation results show that we can obtain an optimal solution with the energy function parameters of A=50, B=5, c=14 and D=10, at the Boltzmann Machine parameters of To=80 and \ulcorner0.07 for a 6-node 3-partition problem. As a result, the proposed energy function and optimization parameters are proved to be feasible for the optimal graph partitioning.

  • PDF

Weak Coupling Method를 이용한 계통 축약 (A Network Reduction using Weak Coupling Method)

  • 이한민;노규민;권세혁
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1999년도 하계학술대회 논문집 C
    • /
    • pp.1067-1069
    • /
    • 1999
  • This paper presents a network reduction using weak coupling method. Weak coupling method of identifying coherent generator groups are proposed. The partitioning technique used in this paper is based on a property of sparse matrix factorization. When a matrix has been factorized, a system is divided into study area, boundary buses and external area. A reduction process for external system starts with the load bus elimination and coherent generator aggregation. An identification of coherent generator group, network partitioning and network reduction are presented.

  • PDF

고장검출이 용이한 Built-In Test 방식의 설계 (Testable Design on the Built In Test Method)

  • ;임인칠
    • 대한전자공학회논문지
    • /
    • 제24권3호
    • /
    • pp.535-540
    • /
    • 1987
  • This paper proposes a circuit partitioning method and a multifunctional BILBO which can perform the multimodule test in the case of testing VLSI circuits. By using these circuit partitioning method and multifunctional BILBO, test time and cost can be reduced greatly by performing the pipeline test method. And the quantity of circuit that shold be added for testing is also reduced in half by interposing only one BILBO between each module. Also, we confirmed that the multifunctional BILBO proposed here has high error detection capability by analyzing error detection capability of this multifunctional BILBO in mathematics.

  • PDF

LNAPLs 오염 지반에 분배성 추적자 시험법 적용 시 유기물질의 영향에 관한 연구 (The Interference of Organic Matter in the Characterization of Aquifers Contaminated with LNAPLs by Partitioning Tracer Method)

  • 칸쉐린;이성수;박준범
    • 한국지반공학회논문집
    • /
    • 제24권9호
    • /
    • pp.13-21
    • /
    • 2008
  • 분배성 추적자 시험법은 LNAPLs(light nonaqueous phase liquids)로 오염된 지반을 조사하는데 아주 유용한 방법이다. 하지만 토양 내 유기물질로 흡착되는 분배성 추적자는 잠재적으로 분배성 추적자 시험법의 정확성에 영향을 끼칠 수 있다. 연구 결과, 추적자의 액상-LNAPL 간 분배 계수는 선형 관계를 보였다. 토양의 흠착능력을 평가하기 위해 흡착 등은 실험을 수행한 결과, Freundlich 흡착 등은 양상과 거의 일치하였고, 추적자의 흡착 정도는 토양 내 유기물질 함량이 증가함에 따라 증가하였다. 또한, 토양 유기물의 흡착능에 따른 잠재적 영향을 판단하고, 추적자 시험법에 의한 LNAPLs 예측의 오차를 수정하기 위해 서로 다른 유기물 함량을 가진 4개의 컬럼 실험을 수행하였다. 컬럼 실험 결과, 오염물질이 없더라도 주문진 표준사와 유기물질이 섞인 컬럼에서는 추적자의 분리 현상이 발생하였다. 오염물질로 케로진을 주입한 이후에 다시 추적자 시험법을 수행하여 파괴곡선을 구한 결과, 토양 유기물질에 대한 추적자의 흡착으로 인해 추적자의 지연계수(R)가 커졌고 LNAPLs의 오염도가 과대평가 되었다. 또한 컬럼 실험 결과를 바탕으로 유기물 함량과 LNAPLs의 예측도 사이의 관계식을 제안하였다.

Interactive Effect of Food Compositions on the Migration Behavior of Printing Ink Solvent

  • An, Duek-Jun
    • Preventive Nutrition and Food Science
    • /
    • 제14권4호
    • /
    • pp.310-315
    • /
    • 2009
  • The partitioning behavior of the five printing ink solvents in nine lab-made cookies with various sugar and water content at 25${^{\circ}C}$ was studied to find out the presence and effects of interaction between the two ingredients on partitioning behavior in cookies. Solvents were ethyl acetate, hexane, isopropanol, methyl ethyl ketone and hexane. It was observed that the partition coefficient (the solvent concentration in food compared to that in air, Kp) decreased as sugar increased in all case and increased as water content increased for all compounds except toluene. Statistical analysis by the F-test method was used to determine the significance of sugar-water interactions, as well as other single factors on partitioning behavior of each solvent. Sugar content alone had no significant effects, but the crystallinity of sugar, as changed by water content, affected the partitioning behavior of the five solvents significantly. Parameter estimation for each significant factor by SAS program yielded a regression equation, which was used to predict the partitioning behavior in the finished cookie. Kp values from the regression equation could be determined more precisely by applying a correction term for the interaction between sugar and water to the Kp values of each ingredient after baking.

철도차량소요계획에 대한 집합분할문제 접근에서 후보운용생성을 위한 열거알고리즘 (An Enumeration Algorithm for Generating the Candidate Routings in a Set Partitioning Problem Approach to the Rolling Stock Requirement Plan)

  • 김성호;김동희;최태성
    • 한국철도학회논문집
    • /
    • 제7권4호
    • /
    • pp.326-331
    • /
    • 2004
  • A routing is the path that an actual trainset follows as it moves from one train to another train in a timetable. The number of routings is equivalent to the number of trainsets required to cover the timetable. The primary factors of rolling stock requirement plan include evaluating the minimum number of routings. This can be formulated as a set partitioning problem and solved using enumeration method or column generation method. In this paper we presents an enumeration algorithm which is useful to implement the enumeration method for the rolling stock requirement plan.