JongHyuk Lee
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
JongHyuk Lee has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Heonchang Yu
Department of Computer Science and Engineering, Korea University, Seoul, Republic of Korea
2 shared publications - Joon-Min Gil
Jeju National University
2 shared publications - Taeweon Suh
Korea University
2 shared publications JoonMin Gil
Catholic University of Daegu
1 shared publicationJoon‐Min Gil
School of Information Technology Engineering Catholic University of Daegu 13‐13 Hayang‐ro, Hayang‐eup, Gyeongsan‐si, Gyeongbuk 712‐702 South Korea
1 shared publication- Lei Xu
Kent State University, Kent, USA
1 shared publication
Latest Publications
- 23 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 6 (2) , 478-491
Architectural Protection of Application Privacy against Software and Physical Attacks in Untrusted Cloud Environment
In cloud computing, it is often assumed that cloud vendors are trusted; the guest Operating System (OS) and the Virtual Machine Monitor (VMM, also called Hypervisor) are secure. However, these assumptions are not always true in practice and existing approaches cannot protect the data privacy of applications when none of these parties are trusted. We investigate how to cope with a strong threat model which is that the cloud vendors, the guest OS, or the VMM, or both of them are malicious or untrusted, and can launch attacks against privacy of trusted user applications. This model is relevant because applications may be small enough to be formally verified, while the guest OS and VMM are too complex to be formally verified. Specifically, we present the design and analysis of an architectural solution which integrates a set of components on-chip to protect the memory of trusted applications from potential software and hardware based attacks from untrusted cloud providers, compromised guest OS, or malicious VMM. Full-system performance evaluation results show that the design only incurs 9 percent overhead on average, which is a small performance price that is paid for the substantial security gain.
- 23 December 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 6 (2) , 478-491
Architectural Protection of Application Privacy against Software and Physical Attacks in Untrusted Cloud Environment
In cloud computing, it is often assumed that cloud vendors are trusted; the guest Operating System (OS) and the Virtual Machine Monitor (VMM, also called Hypervisor) are secure. However, these assumptions are not always true in practice and existing approaches cannot protect the data privacy of applications when none of these parties are trusted. We investigate how to cope with a strong threat model which is that the cloud vendors, the guest OS, or the VMM, or both of them are malicious or untrusted, and can launch attacks against privacy of trusted user applications. This model is relevant because applications may be small enough to be formally verified, while the guest OS and VMM are too complex to be formally verified. Specifically, we present the design and analysis of an architectural solution which integrates a set of components on-chip to protect the memory of trusted applications from potential software and hardware based attacks from untrusted cloud providers, compromised guest OS, or malicious VMM. Full-system performance evaluation results show that the design only incurs 9 percent overhead on average, which is a small performance price that is paid for the substantial security gain.
- 10 October 2014
- Published by Springer Nature in Frontiers of Computer Science
- Vol. 8 (5) , 847-857
A scheduling algorithm with dynamic properties in mobile grid
- 10 October 2014
- Published by Springer Nature in Frontiers of Computer Science
- Vol. 8 (5) , 847-857
A scheduling algorithm with dynamic properties in mobile grid
- 4 December 2013
- Published by Wiley in International Journal of Communication Systems
- Vol. 27 (6) , 918-930
Task scheduling scheme based on resource clustering in desktop grids
SUMMARY: Desktop grids are platforms for grid computing that incorporate desktop resources into a grid infrastructure. The purpose of this computing paradigm is to process a massive computational tasks by exploiting the donated resources connected over the Internet. In desktop grids, it is important to guarantee fast turnaround time in the presence of dynamic properties, such as volatility and heterogeneity. To achieve this objective, we propose a task scheduling scheme based on resource clustering that can selectively allocate tasks to those resources that are most suitable for the current situation of a desktop grid environment. As a classifier of resources, thek‐means clustering algorithm is introduced to classify resources according to their own task execution availability and result‐return probability. The experimental results show that our scheduling scheme is more efficient than existing scheduling schemes with respect to reducing both the turnaround time and the quantity of resources consumed. Copyright © 2013 John Wiley & Sons, Ltd.
- 4 December 2013
- Published by Wiley in International Journal of Communication Systems
- Vol. 27 (6) , 918-930
Task scheduling scheme based on resource clustering in desktop grids
SUMMARY: Desktop grids are platforms for grid computing that incorporate desktop resources into a grid infrastructure. The purpose of this computing paradigm is to process a massive computational tasks by exploiting the donated resources connected over the Internet. In desktop grids, it is important to guarantee fast turnaround time in the presence of dynamic properties, such as volatility and heterogeneity. To achieve this objective, we propose a task scheduling scheme based on resource clustering that can selectively allocate tasks to those resources that are most suitable for the current situation of a desktop grid environment. As a classifier of resources, thek‐means clustering algorithm is introduced to classify resources according to their own task execution availability and result‐return probability. The experimental results show that our scheduling scheme is more efficient than existing scheduling schemes with respect to reducing both the turnaround time and the quantity of resources consumed. Copyright © 2013 John Wiley & Sons, Ltd.
- 20 November 2012
- Published by Springer Nature
- p. 889-895
Task Replication and Scheduling Based on Nearest Neighbor Classification in Desktop Grids
- 20 November 2012
- Published by Springer Nature
- p. 889-895
Task Replication and Scheduling Based on Nearest Neighbor Classification in Desktop Grids
- 1 January 2012
- Published by Springer Nature
- p. 485-492
A Mobile Device Group Based Fault Tolerance Scheduling Algorithm in Mobile Grid
- 1 January 2012
- Published by Springer Nature
- p. 485-492
A Mobile Device Group Based Fault Tolerance Scheduling Algorithm in Mobile Grid