• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.31 no.10
• /
• pp.1-9
• /
• 2003

In GRID environments, an efficient load balancing algorithm should be adopted since the system performances of GRID system are not homogeneous. In this work, a new two-step mesh-partitioning scheme based on the graph-partitioning scheme was introduced to consider the difference of system performance. In the two-step mesh-partitioning scheme, the system performance weights were calculated to reflect the effect of heterogeneous system performances and WEVM(Weighted Edge and vertex Method) was adopted to minimize the increase' of communications. Numerical experiments were carried out in multi-cluster environment and WAN (Wide Area Network) environment to investigate the effectiveness of the two-step mesh-partitioning scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5491-5505
• /
• 2017

Use of the Gaussian inverse Wishart PHD (GIW-PHD) filter has demonstrated promise as an approach to track an unknown number of extended targets. However, the partitioning approaches used in the GIW-PHD filter, such as distance partition with sub-partition (DP-SP), prediction partition (PP) and expectation maximization partition (EMP), fails to provided accurate partition results when targets are spaced closely together and performing maneuvers. In order to improve the performance of a GIW-PHD filter, this paper presents a cooperation partitioning (CP) algorithm to solve the partitioning issue when targets are spaced closely together. In the GIW-PHD filter, the DP-SP is insensitive to target maneuvers but sensitive to the differences in target sizes, while EMP is the opposite. The proposed CP algorithm is a fusion approach of DP-SP and EMP, which employs EMP as a sub-partition approach after DP. Therefore, the CP algorithm will be sensitive to neither target maneuvers nor differences in target sizes. The simulation results show that the use of the proposed CP algorithm will improve the performance of the GIW-PHD filter when targets are spaced closely together.

• Journal of Korea Game Society
• /
• v.13 no.4
• /
• pp.25-34
• /
• 2013

Spatial partitioning trees are needed for processing collision detections efficiently. In order to select split planes for spatial partitioning trees, the tree balance and the number of polygons overlapped with the split plane should be considered. In this paper, the heuristic algorithm controlling weight values of tree build criteria is proposed for spatial partitioning trees of 3D games. As the weight values are changed, tree build time, T-junction elimination time which can cause visual artifacts in splitting polygons overlapped with the split plane, rendering speed (frame per second: FPS) according to tree balance are analysed under 3D game simulations.

• ETRI Journal
• /
• v.37 no.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.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2891-2902
• /
• 1997

This paper presents an analysis on the optimal partitioning configuration of cache (memory) for meeting deadlines of periodic and aperiodic real-time task set. Our goal is not only to decrease the deadline missing ratio of each task by minimizing the task utilization, but also to allocate another tasks to idle spaces of cache. For this reason, we suggest an algorithm so that tasks could be allocated to cache segments. Here, the set of cache segments allocated tasks is called a cache partitioning configuration. Based on how tasks allocate to cache segments, we can get various cache partitioning configurations. From these configurations, we obtain the boundary of task utilization that tasks are possible to schedule, and analyze the cache optimal partitioning configuration that can be executed to minimize the task utilization.

• The Journal of the Korea Contents Association
• /
• v.21 no.7
• /
• pp.164-170
• /
• 2021

In VLSI design, partitioning is a task of clustering objects into groups so that a given objective circuit is optimized. It is used at the layout level to find strongly connected components that can be placed together in order to minimize the layout area and propagation delay. The most popular algorithms for partitioning include the Kernighan-Lin algorithm, Fiduccia-Mattheyses heuristic and simulated annealing. In this paper, we propose a adapted genetic algorithm searching solution space for the circuit partitioning problem, and then compare it with simulated annealing and genetic algorithm by analyzing the results of implementation. As a result, it was found that an adaptive genetic algorithm approaches the optimal solution more effectively than the simulated annealing and genetic algorithm.

• Journal of Microbiology and Biotechnology
• /
• v.2 no.2
• /
• pp.135-140
• /
• 1992

The partitioning of recombinant human interleukin-2(rhII-2) in PEG 8000-dextran 38800 aqueous two-phase system has been investigated using three different sources of rhIL-2. In the case of pure rhIL-2, the solubility in a PEG-dextran two-phase system was low and most of rhIL-2 was partitioned into the bottom phase. For the recovery of rhIL-2 from insoluble protein aggregates, the inclusion bodies of recombinant E. coli were solubilized by the treatment with sodium dodecyl sulfate (SDS). The addition of SDS significantly enhanced not only the solubility of rhIL-2 but also the partitioning of rhIL-2 to the top phase. When the ratio of SDS to rhIL-2 was 2.0, the partition coefficient(K) and the recovery yield(Y) at the top phase were 4.5 and 88%, respectively, at pH 6.8. In order to reduce the recovery steps further, SDS was directly added to the intact recombinant E. coli cells and then partitioned into the PEG/dextran aqueous two-phase system. The observed partition coefficient ($K{\cong{3.0$) and recovery yield ($Y{\geq}80%$ )of this method were comparable to the rhIL-2 recovery from insoluble protein aggregates. The results obtained in this work indicate that PEG-dextran two-phase partitioning might provide a simple way for the recovery and partial purification of recombinant proteins which are produced as inclusion bodies.

• Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
• /
• v.21 no.3
• /
• pp.397-410
• /
• 2023

This study examined the efficacy of various chlorinating agents in partitioning light water reactor spent fuel, with the aim of optimizing the chlorination process. Through thermodynamic equilibrium calculations, we assessed the outcomes of employing MgCl₂, NH₄Cl, and Cl₂ as chlorinating agents. A comparison was drawn between using a single agent and a sequential approach involving all three agents (MgCl₂, NH₄Cl, and Cl₂). Following heat treatment, the utilization of MgCl₂ as the sole chlorinating agent resulted in a moderate separation. Specifically, this method yielded a solid separation with 96.9% mass retention, 31.7% radioactivity, and 44.2% decay heat, relative to the initial spent fuel. In contrast, the sequential application of the chlorinating agents following heat treatment led to a final solid separation characterized by 93.1% mass retention, 5.1% radioactivity, and 15.4% decay heat, relative to the original spent fuel. The findings underscore the potential effectiveness of a sequential chlorination strategy for partitioning spent fuel. This approach holds promise as a standalone technique or as a complementary process alongside other partitioning processes such as pyroprocessing. Overall, our findings contribute to the advancement of spent fuel management strategies.

• 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.

• International Journal of Contents
• /
• v.1 no.1
• /
• pp.40-44
• /
• 2005

This paper introduces region partitioning method of non-perfect nested loops with non-uniform dependences. This kind of loop normally can't be parallelized by existing parallelizing compilers and transformations. Even when parallelized in rare instances, the performance is very poor. Based on the Convex Hull theory which has adequate information to handle non-uniform dependences, this paper proposes an enhanced region partitioning method which divides the iteration space into minimum parallel regions where all the iterations inside each parallel region can be executed in parallel by using variable renaming after copying.