Kyongseok Park

dblp:135/2497 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0001-5164-7099ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 2Artificial intelligence and machine learning · 1 · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Software engineering, systems software and programming languages · 1Databases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Distributed and cloud data management · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
GPUs and heterogeneous computing · 50% High-performance computing · 50%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed and cloud data management › parallel data processing
distributed matrix computation
0.412019
DistME: A Fast and Elastic Distributed Matrix Computation Engine using GPUs · SIGMOD Conference 2019
GPUs and heterogeneous computing
GPU computing
0.112019
DistME: A Fast and Elastic Distributed Matrix Computation Engine using GPUs · SIGMOD Conference 2019

Methods — techniques the papers use, named apart from their topics

cuboid-based partitioning · 0.8GPU acceleration · 0.8
YearPublicationVenuePosition
2025 Pipeline parallelism with reduced network communication for efficient compute-intensive neural network training
Chanhee Yu, Kyongseok Park
J. Supercomput.2
2024 GLNAS: Greedy Layer-wise Network Architecture Search for low cost and fast network generation
Jiacang Ho, Kyongseok Park, Dae-Ki Kang
Pattern Recognit.2
2019 DistME: A Fast and Elastic Distributed Matrix Computation Engine using GPUs
abstract
Matrix computation, in particular, matrix multiplication is time-consuming, but essentially and widely used in a large number of applications in science and industry. The existing distributed matrix multiplication methods only focus on either low communication cost (i.e., high performance) with the risk of out of memory or large-scale processing with high communication overhead. We propose a distributed elastic matrix multiplication method called CuboidMM that achieves both high performance and large-scale processing. We also propose a GPU acceleration method that can be combined with CuboidMM. CuboidMM partitions matrices into cuboids for optimizing the network communication cost with considering memory usage per task, and the GPU acceleration method partitions a cuboid into subcuboids for optimizing the PCI-E communication cost with considering GPU memory usage. We implement a fast and elastic matrix computation engine called DistME by integrating CuboidMM with GPU acceleration on top of Apache Spark. Through extensive experiments, we have demonstrated that CuboidMM and DistME significantly outperform the state-of-the-art methods and systems, respectively, in terms of both performance and data size.
Donghyoung Han, Yoon-Min Nam, Kyongseok Park, Hyunwoo Kim 0003, Min-Soo Kim 0002
SIGMOD Conference4
2018 Accelerating a cross-correlation score function to search modifications using a single GPU
abstract
BACKGROUND: A cross-correlation (XCorr) score function is one of the most popular score functions utilized to search peptide identifications in databases, and many computer programs, such as SEQUEST, Comet, and Tide, currently use this score function. Recently, the HiXCorr algorithm was developed to speed up this score function for high-resolution spectra by improving the preprocessing step of the tandem mass spectra. However, despite the development of the HiXCorr algorithm, the score function is still slow because candidate peptides increase when post-translational modifications (PTMs) are considered in the search. RESULTS: We used a graphics processing unit (GPU) to develop the accelerating score function derived by combining Tide's XCorr score function and the HiXCorr algorithm. Our method is 2.7 and 5.8 times faster than the original Tide and Tide-Hi, respectively, for 50 Da precursor tolerance. Our GPU-based method produced identical scores as did the CPU-based Tide and Tide-Hi. CONCLUSION: We propose the accelerating score function to search modifications using a single GPU. The software is available at https://github.com/Tide-for-PTM-search/Tide-for-PTM-search .
Hyunwoo Kim 0003, Sunggeun Han, Jung-Ho Um, Kyongseok Park
BMC Bioinform.4
2017 Massive OceanColor Data Processing and Analysis System: TuPiX-OC
abstract
Satellite image data generated from remote sensors around the world have different resolutions and are processed at varying levels from Level 0 to Level 3, with each level containing vast amounts of information. Due to the problem of data size, many ocean science researchers use L3 images, which have a spatial resolution of 4 km or 9 km. However, in order to overcome problems such as red tides or to analyze the marine ecosystem based on ocean color satellite research, researchers must generate data by changing the parameters of images at various levels. There is also a need for immediate access to satellite image information using analytical and visualization tools. Considering those requirements, TuPiX-OC (Turning PiXels into knowledge and science-OceanColor) provides an environment to design and execute algorithms for data processing and analysis of satellite image data by data type. TuPix-OC, which has a distributed architecture, is an analytical platform that supports data import, level conversion, DB integration, analysis and processing, and visualization. TuPiX-OC stores satellite data in a massive storage device, and provides an online platform for satellite data conversion/analysis/ visualization. For satellite data processing, TuPiX-OC converts NASA-provided binary files into files that can be analyzed by users. Moreover, TuPiX-OC includes various algorithms for satellite data selection and utilization of satellite images. Preliminary Experiments of TuPiX-OC's satellite image data processing capability showed that it was able to process 35 times as many images as the open source software SeaDAS.
Jung-Ho Um, Sunggeun Han, Hyunwoo Kim 0003, Kyongseok Park
eScience4