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

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.8
• /
• pp.1311-1321
• /
• 1997

In multibody dynamics, differential and algebraic equations which can satisfy both equation of motion and kinematic constraint equation should be solved. To solve these equations, coordinate partitioning method and constraint stabilization method are commonly used. In the coordinate partitioning method, the coordinates are divided into independent and dependent and coordinates. The most typical coordinate partitioning method are LU decomposition, QR decomposition, and SVD (singular value decomposition). The objective of this research is to find an efficient coordinate partitioning method in the dynamic analysis of flexible multibody systems. Comparing two coordinate partitioning methods, i.e. LU and QR decomposition in the flexible multibody systems, a new hybrid coordinate partitioning method is suggested for the flexible multibody analysis.

• Journal of the Korean Society for Railway
• /
• v.5 no.3
• /
• pp.174-180
• /
• 2002

In multibody dynamics, DAE(Differential Algebraic Equations) that combine differential equations of motion and kinematic constraint equations should be solved. To solve these equations, either coordinate partitioning method or constraint stabilization method is commonly used. The most typical coordinate partitioning methods are LU decomposition, QR decomposition, and SVD(singular value decomposition). The objective of this research is to suggest a hybrid coordinate partitioning method in the dynamic analysis of multibody systems containing singular configurations. Two coordinate partitioning methods, i.e. LU decomposition and QR decomposition for constrained multibody systems, are combined for a new hybrid coordinate partitioning method. The proposed hybrid method reduces the simulation time while keeping accuracy of the solution.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2009.09a
• /
• pp.1372-1377
• /
• 2009

For the remediation of the subsurface contaminated by nonaqueous phase liquids(NAPLs), it is important to characterize the NAPL zone properly. Conventional characterization methods provide data at discrete points. To overcome the weak points of conventional characterization methods, the partitioning tracer method has been developed and studied. The average saturation of NAPL($S_n$), which is the representative and continuous saturation value within contaminated site, can be calculated by comparing the transport of the partitioning tracers to that of the conservative tracer in the partitioning tracer method. In this study, the application of the partitioning tracer method in heterogeneous media was investigated. To represent the heterogeneous condition of subsurface, a two-dimensional soil box was divided into four layers and each layer contained different sized soils. Soils in the soil box were contaminated by the mixture of kerosene and diesel, and partitioning tracer tests were conducted before and after the contamination using methanol as conservative tracer and 4-methyl-2-pentanol, 2-ethyl-1-butanol, and hexanol as partitioning tracers. The response curves of partitioning tracers from contaminated soils were separated and retarded in comparison with those from non-contaminated soils. The contamination of soils by NAPLs, therefore, can be detected by partitioning tracer method considering these retardations of tracers. From our experiment condition, the average saturation of NAPLs calculated by partitioning tracer method using the methanol as conservative tracer and hexanol as partitioning tracer showed the highest accuracy, though all results were underestimated. Further studies, therefore, were needed for improving the accuracy using the partitioning tracer test in heterogeneous media.

• International conference on construction engineering and project management
• /
• 2009.05a
• /
• pp.1036-1046
• /
• 2009

Many construction activities are related because they share the information of working methods and resources. Generally, the design information for coupled activities needs to be constantly collaborated in the different teams. To achieve the improvement in team collaboration, it is necessary to identify the relative coupled activities in the design teams. The activity and work partitioning arrangements are also required to accommodate the appropriate team members. This paper presents an integral method to be an evaluation in improving the collaboration for teams partitioning. A model, Team Partitioning Method (TPM) was developed to clarify the relationships between activities in a team. The results show the applicability of TPM model in team partitioning for design collaboration.

• Computers and Concrete
• /
• v.23 no.5
• /
• pp.311-320
• /
• 2019

The substructuring technique is one of the efficient methods for reducing computational effort and memory usage in the finite element method, especially in large-scale structures. Proper mesh partitioning plays a key role in the efficiency of the technique. In this study, new algorithms are proposed for mesh partitioning based on an element search technique. The computational cost function is optimized by aligning each element of the structure to a proper substructure. The genetic algorithm is employed to minimize the boundary nodes of the substructures. Since the boundary nodes have a vital performance on the mesh partitioning, different strategies are proposed for the few number of substructures and higher number ones. The mesh partitioning is optimized considering both computational and memory requirements. The efficiency and robustness of the proposed algorithms is demonstrated in numerous examples for different size of substructures.

• Journal of information and communication convergence engineering
• /
• v.5 no.4
• /
• pp.369-373
• /
• 2007

RFID systems large volume of data, it can lead to slower queries. To achieve better query performance, we can partition into active and some nonactive data. In this paper, we propose two approaches of partitioning for efficient query support. The one is average period plus delta partition and the other is adaptive average period partition. We also present the system architecture to manage active data and non-active data and logical database schema. The data manager check the active partition and move all objects from the active store to an archive store associated with an average period plus data and an adaptive average period. Our experiments show the performance of our partitioning methods.

• Journal of the Korean Society of Industry Convergence
• /
• v.4 no.1
• /
• pp.87-94
• /
• 2001

In multibody dynamics, differential and algebraic equations which can satisfy both equation of motion and kinematic constraint equation should be solved. To solve this equation, coordinate partitioning method and constraint stabilization method are commonly used. The coordinate partitioning method divides the coordinate into independent and dependent coordinates. The most typical coordinate partitioning method arc LU decomposition, QR decomposition, projection method and SVD(sigular value decomposition).The objective of this research is to find a efficient coordinate partitioning method in flexible multibody systems and a hybrid decomposition algorithm which employs both LU and projection methods is proposed. The accuracy of the solution algorithm is checked with a slider-crank mechanism.

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

• Journal of the Korea Convergence Society
• /
• v.6 no.3
• /
• pp.51-57
• /
• 2015

This paper proposes an efficient method such as Extended Three Region Partitioning Method for nested loops with irregular dependences for maximizing parallelism. Our approach is based on the Convex Hull theory, and also based on minimum dependence distance tiling, the unique set oriented partitioning, and three region partitioning methods. In the proposed method, we eliminate anti dependences from the nested loop by variable renaming. After variable renaming, we present algorithm to select one or more appropriate lines among given four lines such as LMLH, RMLH, LMLT and RMLT. If only one line is selected, the method divides the iteration space into two parallel regions by the selected line. Otherwise, we present another algorithm to find a serial region. The selected lines divide the iteration space into two parallel regions as large as possible and one or less serial region as small as possible. Our proposed method gives much better speedup and extracts more parallelism than other existing three region partitioning methods.