Hyokyung Bahn

Prof. Hyokyung Bahn

Department of Computer Engineering, Ewha University, Seoul 03760, Korea
orcid

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
7 August 2002 in Computer
Verified
Journal Article
Closed access
Hyokyung BahnHyokyung Bahn
Hyokyung Bahn
KKKern Koh
Kern Koh
SNS.H. Noh
S.H. Noh
SLS.M. Lyul
S.M. Lyul
Cache performance depends heavily on replacement algorithms, which dynamically select a suitable subset of objects for caching in a finite space. Developing such algorithms for wide-area distributed environments is challenging because, unlike traditional paging systems, retrieval costs and object sizes are not necessarily uniform. In a uniform caching environment, a replacement algorithm generally seeks to reduce cache misses, usually by replacing an object with the least likelihood of re-reference. In contrast, reducing total cost incurred due to cache misses is more important in nonuniform caching environments. The authors present the least-unified value algorithm, which performs better than existing algorithms for replacing nonuniform data objects in wide-area distributed environments.

28 June 2004 in IEEE Transactions on Consumer Electronics
Verified
Journal Article
Closed access
KYKeun Soo Yim
Keun Soo Yim
Hyokyung BahnHyokyung Bahn
Hyokyung Bahn
KKKern Koh
Kern Koh
Flash memory based SmartMedia card is becoming increasingly popular as data storage for mobile consumer electronics. Since flash memory is an order of magnitude more expensive than magnetic disks, data compression can be effectively used in managing flash memory based storage systems. However, compressed data management in flash memory is challenging because it only supports page-based I/Os. For example, when the size of compressed data is smaller than the page size, internal fragmentation occurs and this degrades the effectiveness of compression seriously. In this paper, we developed a flash compression layer (FCL) for the SmartMedia card systems. FCL stores several small compressed pages into one physical page by using a write buffer. Based on prototype implementation and simulation studies, we show that the proposed system offers the storage of flash memory more than 140% of its original size and expands the write bandwidth significantly.

22 March 2021 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
SYSuhyeon Yoo
Suhyeon Yoo
YJYewon Jo
Yewon Jo
Hyokyung BahnHyokyung Bahn
Hyokyung Bahn
With the recent advances in Internet of Things and cyber-physical systems technologies, smart industrial systems support configurable processes consisting of human interactions as well as hard real-time functions. This implies that irregularly arriving interactive tasks and traditional hard real-time tasks coexist. As the characteristics of the tasks are heterogeneous, it is not an easy matter to schedule them all at once. To cope with this situation, this article presents a new task scheduling policy that uses the notion of “virtual real-time task” and two-phase scheduling. As hard real-time tasks must keep their deadlines, we perform offline scheduling based on genetic algorithms beforehand. This determines the processor's voltage level and memory location of each task and also reserves the virtual real-time tasks for interactive tasks. When interactive tasks arrive during the execution, online scheduling is performed on the time slot of the virtual real-time tasks. As interactive workloads evolve over time, we monitor them and periodically update the offline scheduling. Experimental results show that the proposed policy reduces the energy consumption by 66.8% on average without deadline misses and also supports the waiting time of less than 3 (s) for interactive tasks.

1 January 2013 in The Scientific World Journal
Verified
Journal Article
Open access
PDF file
ELEunji Lee
Eunji Lee
Hyokyung BahnHyokyung Bahn
Hyokyung Bahn
With the recent advances in smart grid technologies as well as the increasing dissemination of smart meters, the electricity usage of every moment can be detected in modern smart building environments. Thus, the utility company adopts different price of electricity at each time slot considering the peak time. This paper presents a new electricity usage scheduling algorithm for smart buildings that adopts real‐time pricing of electricity. The proposed algorithm detects the change of electricity prices by making use of a smart device and changes the power mode of each electric device dynamically. Specifically, we formulate the electricity usage scheduling problem as a real‐time task scheduling problem and show that it is a complex search problem that has an exponential time complexity. An efficient heuristic based on genetic algorithms is performed on a smart device to cut down the huge searching space and find a reasonable schedule within a feasible time budget. Experimental results with various building conditions show that the proposed algorithm reduces the electricity charge of a smart building by 25.6% on average and up to 33.4%.

3 January 2023 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
SKSoomin Ki
Soomin Ki
GBGyuri Byun
Gyuri Byun
KCKyungwoon Cho
Kyungwoon Cho
Hyokyung BahnHyokyung Bahn
Hyokyung Bahn
Energy saving is one of the most important missions in the design of battery-based mobile systems. Many ideas have been suggested for saving energy in different system layers. Specifically: 1) lowering the supply voltage for idle CPU time slots; 2) using hybrid memory to save DRAM refresh power; and 3) task offloading to edge/cloud servers are well-acknowledged techniques used in CPU, memory, and network subsystems. In this article, we show that co-optimizing these three techniques is necessary for further reducing the energy consumption of mobile real-time systems. To this end, we present an extended task model and formulate the effect of dynamic voltage/frequency scaling (DVFS), hybrid memory allocation, and task offloading problems as a unified measure. We then present a new real-time task scheduling scheme, called Co-TOMS, to co-optimize the energy-saving techniques in CPU, memory, and network subsystems by considering the given task set and resource conditions. The main contributions of our study can be summarized as follows. First, we optimize three energy-saving techniques across different system layers and find that they have significant influence on each other. For example, the effect of DVFS alone is limited in mobile systems, but combining it with offloading greatly amplifies its efficiency. Second, previous studies on offloading usually define a deadline as the maximum allowable latency at the application level, but we focus on hard real-time systems that must meet task-level deadlines. Third, we design a steady-state genetic algorithm that allows fast convergence with reasonable computation overhead under various resource and workload conditions.

1 September 2016 in Pervasive and Mobile Computing
Verified
Journal Article
Closed access
DKDohee Kim
Dohee Kim
SLSoyoon Lee
Soyoon Lee
Hyokyung BahnHyokyung Bahn
Hyokyung Bahn