-
公开(公告)号:US11107187B2
公开(公告)日:2021-08-31
申请号:US16541628
申请日:2019-08-15
Inventor: Min Soo Kim , Himchan Park
IPC: G06T3/40 , G06T1/20 , G06F16/901
Abstract: A graph upscaling method and apparatus is disclosed. The graph upscaling apparatus may store, in a main memory, original graph data including topological data including a vertex and an edge, determine a parent edge using a hash function and the original graph data, and generate a new edge based on the determined parent edge. The graph upscaling apparatus may store, in a main memory, original graph data including topological data including a vertex and an edge, allocate identities (IDs) of edges to be generated to cores included in a central processing unit (CPU) based on the number of the cores, and generate new edges based on the IDs of the edges using a hash function and the original graph data.
-
公开(公告)号:US10719906B2
公开(公告)日:2020-07-21
申请号:US15556411
申请日:2016-12-28
Inventor: Min Soo Kim , Kyu Hyeon An , Him Chan Park , Jin Wook Kim , Se Yeon Oh
IPC: G06T1/20 , G06T1/60 , G06F17/10 , G06F16/2455 , G06F16/23 , G06F12/1018
Abstract: A graph processing system may include at least one auxiliary memory configured to store graph data including phase data and attribute data, a main memory configured to store a portion of the graph data, a plurality of graphics processing units (GPUs) configured to process the graph data received from the main memory and perform synchronization and including cores and device memories, and a central processing unit (CPU) configured to manage query processing associated with the graph data performed by the GPUs and store, in the auxiliary memory, updatable attribute data of a result of the query processing.
-
公开(公告)号:US10089705B2
公开(公告)日:2018-10-02
申请号:US14658325
申请日:2015-03-16
Inventor: Min Soo Kim , Hyun Seok Seo , Jin Wook Kim
Abstract: The present invention relates to a system and method for processing a large scale graph using GPUs, and more particularly, to a system and method capable of processing larger-scale graph data beyond the capacity of device memory of GPUs using a streaming method. A large-scale graph processing system using GPUs according to an aspect of the present invention includes a main memory, device memories of a plurality of GPUs that process graph data transferred from the main memory; a loop controller that processes graph data transfer in a nested loop join scheme in the graph data transfer between the main memory and the device memory of the GPU, and a streaming controller that copies the graph data to the device memory of the GPU in a chunk or streaming manner using a GPU stream according to the nested loop join scheme.
-
公开(公告)号:US11687784B2
公开(公告)日:2023-06-27
申请号:US16281582
申请日:2019-02-21
Inventor: Hee Chul Lim , Min Soo Kim
Abstract: An artificial intelligence system and a method for searching for an optimal model are provided. A method for searching for a learning mode of an artificial intelligence system includes receiving, by an operator included in a first node, first channels, deriving, by the operator included in the first node, first parameter weight indexes corresponding to weights of first parameters by calculating the first parameters corresponding to each of the received first channels with the received first channels, generating and outputting a second channel group by combining the first channel with the other channel, receiving, by an operator included in a second node, second channels included in the second channel group, and deriving, by the operator included in the second node, second parameter weight indexes corresponding to weights of second parameters by calculating the second parameters corresponding to the received second channels with the received second channels.
-
公开(公告)号:US20200065939A1
公开(公告)日:2020-02-27
申请号:US16541628
申请日:2019-08-15
Inventor: Min Soo Kim , Himchan PARK
Abstract: A graph upscaling method and apparatus is disclosed. The graph upscaling apparatus may store, in a main memory, original graph data including topological data including a vertex and an edge, determine a parent edge using a hash function and the original graph data, and generate a new edge based on the determined parent edge. The graph upscaling apparatus may store, in a main memory, original graph data including topological data including a vertex and an edge, allocate identities (IDs) of edges to be generated to cores included in a central processing unit (CPU) based on the number of the cores, and generate new edges based on the IDs of the edges using a hash function and the original graph data.
-
6.
公开(公告)号:US11062790B2
公开(公告)日:2021-07-13
申请号:US14824678
申请日:2015-08-12
Inventor: Min Soo Kim , Jae Hyung Koo , Hye Rin Kim , Na Na Kang , Kang Wook Chon , Seon Ho Kim
Abstract: A method for designing all coverage of valid primer pairs, which satisfy various filtering constraints provided by users with respect to a given sequence database and has validated specificity to given sequences, is provided. By screening all suitable primer pairs present on a given DNA sequence database without omitting any one primer pair and also screening all primers having a coverage of 1 or more as well as primers having a coverage of 1, a user can be allowed to give rankings to the primers in order to easily select the primers having a high success rate in biological experiments from the resulting primers.
-
公开(公告)号:US10593080B2
公开(公告)日:2020-03-17
申请号:US15955914
申请日:2018-04-18
Inventor: Min Soo Kim , Himchan Park
Abstract: Disclosed is a graph generating method and apparatus, the graph generating apparatus that may recognize one source vertex among a plurality of vertices, obtain the target number of at least one edge to generate from the source vertex, among the total target number of edges to generate between the vertices, obtain a recursive vector to be used repeatedly to generate the at least one edge, in a scope in which an existence of an edge for the source vertex needs to be verified, and generate the at least one edge between the source vertex and at least one destination vertex based on the target number and the recursive vector.
-
8.
公开(公告)号:US20170369934A1
公开(公告)日:2017-12-28
申请号:US15497244
申请日:2017-04-26
Inventor: Min Soo Kim , HYERIN KIM , JAEHYUNG KOO , Na Na Kang , KyuHyeon An
CPC classification number: C12Q1/6811 , G16B20/00 , G16B30/00 , G16B35/00 , G16C20/60
Abstract: Disclosed is a method of designing a valid primer pair satisfying a specificity condition. The method includes searching for an identifier of a base sequence from a genetic information index based on a query language associated with a gene, searching for a candidate primer from a provided candidate primer set index to satisfy the specificity condition based on the identifier of the base sequence, filtering the candidate primer based on primer-related filtering conditions, and providing information about a primer pair satisfying the query language and the filtering conditions based on a result of the filtering.
-
公开(公告)号:US11286516B2
公开(公告)日:2022-03-29
申请号:US15497244
申请日:2017-04-26
Inventor: Min Soo Kim , Hyerin Kim , Jaehyung Koo , Na Na Kang , KyuHyeon An
Abstract: Disclosed is a method of designing a valid primer pair satisfying a specificity condition. The method includes searching for an identifier of a base sequence from a genetic information index based on a query language associated with a gene, searching for a candidate primer from a provided candidate primer set index to satisfy the specificity condition based on the identifier of the base sequence, filtering the candidate primer based on primer-related filtering conditions, and providing information about a primer pair satisfying the query language and the filtering conditions based on a result of the filtering.
-
公开(公告)号:US11068504B2
公开(公告)日:2021-07-20
申请号:US16327274
申请日:2017-01-11
Inventor: Yoon Min Nam , Dong Hyoung Han , Min Soo Kim
IPC: G06F16/27 , G06F16/2455 , G06F16/22 , G06F16/2453
Abstract: A relational database storage method according to one embodiment generates a join graph including tables and edges based on either a database schema including referential constraints among database tables or a query workload containing a set of join predicates, classifies the type of tables based on the cost of a join operation between the tables included in the join graph, classifies the type of edges in the join graph on the basis of the type of the tables connected to each other by the edge, adds a virtual edge between two tables satisfying the indirect join condition, and generates a database partitioning scheme for the join graph based on the set of tables in the join graph and their type, the set of edges in the join graph and their type, and virtual edges.
-
-
-
-
-
-
-
-
-