Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jaegyoon Hahm

dblp:12/2574 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

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

Systems, architecture and hardware · 2Computer networks · 1Security and privacy · 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.

Computer architecture, parallel and distributed computing, and storage systems
2 papers
Parallel and multicore computing · 42% Cloud and datacenter computing · 34% Distributed systems · 18%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › task scheduling
DAG scheduling
0.112007
Push-Pull: Deterministic Search-Based DAG Scheduling for Heterogeneous Cluster Systems · IEEE Trans. Parallel Distributed Syst. 2007
Cloud and datacenter computing › cluster resource management and scheduling › cluster scheduling
heterogeneous cluster scheduling
0.112007
Push-Pull: Deterministic Search-Based DAG Scheduling for Heterogeneous Cluster Systems · IEEE Trans. Parallel Distributed Syst. 2007
Parallel and multicore computing
task scheduling
0.112007
Push-Pull: Deterministic Search-Based DAG Scheduling for Heterogeneous Cluster Systems · IEEE Trans. Parallel Distributed Syst. 2007
Distributed systems
grid computing
0.012004
GRASP: A Grid Resource Allocation System based on OGSA · HPDC 2004
Cloud and datacenter computing
resource allocation
0.012004
GRASP: A Grid Resource Allocation System based on OGSA · HPDC 2004
Performance modeling and evaluation
simulation
0.012007
Push-Pull: Deterministic Search-Based DAG Scheduling for Heterogeneous Cluster Systems · IEEE Trans. Parallel Distributed Syst. 2007
Distributed systems
service-oriented architecture
0.012004
GRASP: A Grid Resource Allocation System based on OGSA · HPDC 2004

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

simulation · 0.1guided search · 0.1
YearPublicationVenuePosition
2013 A SLA driven VM auto-scaling method in hybrid cloud environment
Hyejeong Kang, Jung-In Koh, Yoonhee Kim, Jaegyoon Hahm
APNOMS4
2011 HERO Web Portal: On-Demand Portal for Co-allocating Computing and Network Resources on Top of TIGRIS Middleware Platform
abstract
Cloud computing is a model for the delivery of IT resources as a service than a product. One of the essential characteristics in the cloud computing is on-demand computing. It can be explained that users can reserve and utilize IT capabilities, such as computing or network resources, at a certain time they want. As a part of HERO project, we developed HERO web portal which has on-demand capabilities of co-allocating computing and network resources. It is on top of TIGRIS middleware platform, which is developed based on Globus Toolkit 4 WSRF-compatible Grid services. With HERO web portal, Users can utilize HPC clusters and high-performance network between them in an on-demand manner.
Jae-Hyuck Kwak, Junweon Yoon, Yonghwan Jung, Jaegyoon Hahm, Dongin Park
DASC4
2007 Push-Pull: Deterministic Search-Based DAG Scheduling for Heterogeneous Cluster Systems
abstract
Consider directed acyclic graph (DAG) scheduling for a large heterogeneous system, which consists of processors with varying processing capabilities and network links with varying bandwidths. The search space of possible task schedules for this problem is immense. One possible approach for this optimization problem, which is NP-hard, is to start with the best task schedule found by a fast deterministic task scheduling algorithm and then iteratively attempt to improve the task schedule by employing a general random guided search method. However, such an approach can lead to extremely long search times, and the solutions found are sometimes not significantly better than those found by the original deterministic task scheduling algorithm. In this paper, we propose an alternative strategy, termed Push-Pull, which starts with the best task schedule found by a fast deterministic task scheduling algorithm and then iteratively attempts to improve the current best solution using a deterministic guided search method. Our simulation results show that given similar runtimes, the Push-Pull algorithm performs well, achieving results similar to or better than all of the other algorithms being compared.
Sang Cheol Kim, Sunggu Lee, Jaegyoon Hahm
IEEE Trans. Parallel Distributed Syst.3
2004 GRASP: A Grid Resource Allocation System based on OGSA
Oh-Kyoung Kwon, Jaegyoon Hahm, Jong-Suk Ruth Lee
HPDC2