Myeonggyun Han

Myeonggyun Han

Auto-generated profile, based on publicly available information

Myeonggyun Han

UNIST

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 October 2019 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
MHMyeonggyun Han
Myeonggyun Han
JHJihoon Hyun
Jihoon Hyun
SPSeongbeom Park
Seongbeom Park
WBWoongki Baek
Woongki Baek

23 November 2020 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
MHMyeonggyun Han
Myeonggyun Han
JPJinsu Park
Jinsu Park
WBWoongki Baek
Woongki Baek
Heterogeneous multiprocessing (HMP) is an emerging technology for high-performance and energy-efficient computing. While task parallelism is widely used in various computing domains, such as embedded, big-data, and machine-learning computing domains, it still remains unexplored to investigate the efficient runtime support that effectively utilizes the criticality of the tasks of the target application and the heterogeneity of the underlying HMP system with full resource management. To bridge this gap, we propose CHRT, a criticality- and heterogeneity-aware runtime system for task-parallel applications. CHRT dynamically estimates the performance and power consumption of the target task-parallel application and robustly manages the full HMP system resources (i.e., core types, counts, and voltage/frequency levels) to maximize the overall efficiency. Our quantitative evaluation based on widely-used task parallel benchmarks and two full HMP systems (i.e., the XU3 and HiKey970 HMP systems) demonstrates the effectiveness of CHRT in that CHRT achieves significantly higher energy (e.g., 60.4\% and 57.2\% on average on the XU3 system) and energy-delay product (e.g., 52.2\% and 44.0\% on average on the HiKey970 system) efficiency than the baseline runtime system that employs the breadth-first scheduler and the state-of-the-art criticality-aware runtime system and incurs low performance overheads.

18 September 2020 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
MHMyeonggyun Han
Myeonggyun Han
WBWoongki Baek
Woongki Baek
Workload consolidation is a widely-used technique to improve the resource utilization of services computing systems by consolidating latency-critical (LC) and batch workloads on the same physical server. The resource manager for workload consolidation dynamically allocates hardware resources (e.g., cores, caches) to the workloads to maximize the resource utilization while satisfying the service-level objective (SLO) of the LC workloads. Since security-critical hardware resources are dynamically allocated across consolidated workloads, information leakages can be created among workloads through microarchitectural side-channel (SC) attacks. Despite extensive prior works, it is yet to investigate efficient system software support for achieving high resource utilization without compromising the SLO and security of consolidated workloads. To bridge this gap, we propose SDRP, secure and dynamic resource partitioning for safe, efficient, and SLO-aware workload consolidation. As with the state-of-the-art techniques, SDRP dynamically allocates hardware resources to enhance the resource utilization and provide the SLO guarantees. In contrast to the state-of-the-art techniques, SDRP dynamically sanitizes security-critical hardware resources to robustly defeat microarchitectural SC attacks. Our quantitative evaluation demonstrates that SDRP achieves high resource sanitization quality, introduces low performance overheads, delivers high resource utilization with the SLO and security guarantees, and defeats the last-level cache (LLC)-based SC attack.

24 November 2023 in IEEE Access
Verified
Journal Article
Open access
MHMyeonggyun Han
Myeonggyun Han
EPEunseong Park
Eunseong Park
YSYoungsam Shin
Youngsam Shin
DODeok-Jae Oh
Deok-Jae Oh
YCYeongon Cho
Yeongon Cho
WBWoongki Baek
Woongki Baek
With the rapid growth in memory demands, the slowdown of DRAM scaling, and the DRAM price fluctuations, DRAM has become one of the critical resources in cloud computing systems and datacenters. The compressed memory swap (CMS) is a promising technique that improves the effective memory capacity of the underlying computer system by compressing and storing a subset of pages in memory instead of the disk swap. While prior works have extensively investigated resource management techniques for workload consolidation, they lack the capability of dynamically allocating cores, memory, andCMSto the consolidated applications in a controlled and efficient manner. To bridge this gap, this work presents the in-depth characterization of the impact of cores, memory, and CMS on the QoS and throughput of the consolidated latency-critical (LC) and batch applications. Guided by the characterization results, we propose COSMOS, a software-based runtime system for coordinated management of cores, memory, and CMS for QoS-aware and efficient workload consolidation for memory-intensive applications. COSMOS dynamically collects the runtime data from the consolidated applications and the underlying system and allocates the resources to the consolidated applications in a way that achieves high throughput with strong QoS guarantees. Our quantitative evaluation based on a real system and widely-used memory-intensive benchmarks demonstrates the effectiveness of COSMOS in that it robustly satisfies the QoS and achieves high throughput across all the evaluatedworkload mixes and scenarios and significantly reduces the number of explored system states.

1 September 2019
Verified
Conference Paper
Closed access
Jinsu ParkJinsu Park
Jinsu Park
SPSeongbeom Park
Seongbeom Park
MHMyeonggyun Han
Myeonggyun Han
WBWoongki Baek
Woongki Baek
Thread packing (TP) is a widely-used technique to improve the efficiency of parallel systems. Despite extensive prior works, relatively little work has been done to investigate its performance inefficiencies. To bridge this gap, we quantify its performance impact on synchronization-intensive applications and identify the root causes of its performance inefficiencies.