• Title/Summary/Keyword: partitioning method

Search Result 598, Processing Time 0.027 seconds

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

  • Ahn, Byung-Gyu;Sihn, Bong-Sik;Chong, Jong-Wha
    • Proceedings of the IEEK Conference
    • /
    • 2004.06b
    • /
    • 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
    • Journal of The Korean Astronomical Society
    • /
    • v.52 no.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.

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

  • Moon, Sungwon;Lim, Yujin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.11 no.5
    • /
    • pp.139-146
    • /
    • 2022
  • With the recent development of the Internet of Things (IoT) and the convergence of vehicles and IT technologies, high-performance applications such as autonomous driving are emerging, and multi-access edge computing (MEC) has attracted lots of attentions as next-generation technologies. In order to provide service to these computation-intensive tasks in low latency, many methods have been proposed to partition tasks so that they can be performed through cooperation of multiple MEC servers(MECSs). Conventional methods related to task partitioning have proposed methods for partitioning tasks on vehicles as mobile devices and offloading them to multiple MECSs, and methods for offloading them from vehicles to MECSs and then partitioning and migrating them to other MECSs. In this paper, the performance of task partitioning methods using offloading and migration is compared and analyzed in terms of service delay, blocking rate and energy consumption according to the method of selecting partitioning targets and the number of partitioning. As the number of partitioning increases, the performance of the service delay improves, but the performance of the blocking rate and energy consumption decreases.

On the k-coloring Problem

  • Park, Tae-Hoon;Lee, Chae Y.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.19 no.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

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

  • Lee, Jong-Hee;Kim, Jin-Ho;Park, Heung-Moon
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.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

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

  • Lee, H.M.;Rho, K.M.;Kwon, S.H.
    • Proceedings of the KIEE Conference
    • /
    • 1999.07c
    • /
    • 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

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

  • Seung Ryong Rho
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.24 no.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

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

  • Khan, Sherin Momand;Rhee, Sung-Su;Park, Jun-Boum
    • Journal of the Korean Geotechnical Society
    • /
    • v.24 no.9
    • /
    • pp.13-21
    • /
    • 2008
  • Partitioning tracer method is a useful tool to characterize large domains of the aquifers contaminated with light nonaqueous phase liquids (LNAPLs). Sorption of the partitioning tracers to the organic matter content of soil can potentially influence the efficacy of partitioning tracer method. LNAPL-water partitioning coefficients of tracers ($K_{nw}$), measured by static method, showed linear relationship. Sorption isotherm tests were conducted to evaluate the sorption capacity of the soils packed in the columns and the results were appropriately represented by Freundlich sorption isotherm. The sorption of tracers proportionally increased with the increase of the organic matter content of the soil. Laboratory experiments were conducted in four columns each packed with soils of different organic matter contents to determine the potential interference effects of sorption to soil organic matter content and correction factors for the errors in estimation of LNAPLs by partitioning tracer method. Though there were no contaminants added, breakthrough curves from columns packed with mixture of Jumunjin standard sand and organic matter showed separation of tracers. Columns were then contaminated to residual saturation with kerosene and breakthrough curves were obtained. The results show that sorption of tracers to soil organic matter leads to an increase in the retardation factor (R) and hence, to an overestimation of the saturation of LNAPLs. A relation between the percentage of organic matter content and the corresponding percentage error in the estimation of NAPLs has been developed.

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

  • An, Duek-Jun
    • Preventive Nutrition and Food Science
    • /
    • v.14 no.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 (철도차량소요계획에 대한 집합분할문제 접근에서 후보운용생성을 위한 열거알고리즘)

  • 김성호;김동희;최태성
    • Journal of the Korean Society for Railway
    • /
    • v.7 no.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.