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

Jin-Ha Kim

dblp:63/4735 · DBLP profile ↗
← Back
10ranked-venue papers
5as first author
0since 2021 · last 2008
—ORCID · none

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

Systems, architecture and hardware · 8 · 4 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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
4 papers
Cloud and datacenter computing · 47% Parallel and multicore computing · 24% Electronic design automation · 10%
Network and information security
1 paper
Network security · 100%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › datacenter services › online service systems › internet services
cluster-based web server
0.112007
An SSL Back-End Forwarding Scheme in Cluster-Based Web Servers · IEEE Trans. Parallel Distributed Syst. 2007
Parallel and multicore computing
load balancing
0.112007
An SSL Back-End Forwarding Scheme in Cluster-Based Web Servers · IEEE Trans. Parallel Distributed Syst. 2007
Cloud and datacenter computing › datacenter services › online service systems › internet services
web server architecture
0.112005
A multi-threaded PIPELINED Web server architecture for SMP/SoC machines · WWW 2005
Cloud and datacenter computing
cluster resource management and scheduling
0.012004
Coscheduling in Clusters: Is It a Viable Alternative? · SC 2004
Parallel and multicore computing › parallel scheduling
coscheduling
0.012004
Coscheduling in Clusters: Is It a Viable Alternative? · SC 2004
Embedded and real-time systems › real-time scheduling › multiprocessor scheduling
gang scheduling
0.012004
Coscheduling in Clusters: Is It a Viable Alternative? · SC 2004
Electronic design automation › high-level synthesis
scheduling
0.012004
Coscheduling in Clusters: Is It a Viable Alternative? · SC 2004
Network security › secure communication › secure communication protocol
TLS
0.012005
Improving Performance of Cluster-based Secure Application Servers with User-level Communication · ICDE 2005
Processor architecture and microarchitecture › multiprocessor architecture
symmetric multiprocessor
0.012005
A multi-threaded PIPELINED Web server architecture for SMP/SoC machines · WWW 2005
Integrated circuit design
system-on-chip
0.012005
A multi-threaded PIPELINED Web server architecture for SMP/SoC machines · WWW 2005
Energy-efficient computing
power-performance tradeoff
0.012004
Coscheduling in Clusters: Is It a Viable Alternative? · SC 2004

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

simulation · 0.1user-level communication · 0.1load balancing · 0.1performance analysis · 0.1spin block · 0.0periodic boost · 0.0gang scheduling · 0.0dynamic coscheduling · 0.0batch scheduling · 0.0
YearPublicationVenuePosition
2008 Coscheduled distributed-Web servers on system area network
Jin-Ha Kim, Gyu Sang Choi, Chita R. Das
J. Parallel Distributed Comput.1
2007 A comprehensive performance and energy consumption analysis of scheduling alternatives in clusters
Gyu Sang Choi, Jin-Ha Kim, Deniz Ersoz, Andy B. Yoo, Chita R. Das
J. Supercomput.2
2007 An SSL Back-End Forwarding Scheme in Cluster-Based Web Servers
abstract
State-of-the-art cluster-based data centers consisting of three tiers (Web server, application server, and database server) are being used to host complex Web services such as e-commerce applications. The application server handles dynamic and sensitive Web contents that need protection from eavesdropping, tampering, and forgery. Although the secure sockets layer (SSL) is the most popular protocol to provide a secure channel between a client and a cluster-based network server, its high overhead degrades the server performance considerably and, thus, affects the server scalability. Therefore, improving the performance of SSL-enabled network servers is critical for designing scalable and high-performance data centers. In this paper, we examine the impact of SSL offering and SSL-session-aware distribution in cluster-based network servers. We propose a back-end forwarding scheme, called ssl_with_bf, that employs a low-overhead user-level communication mechanism like virtual interface architecture (VIA) to achieve a good load balance among server nodes. We compare three distribution models for network servers, round robin (RR), ssl_with_session, and ssl_with_bf, through simulation. The experimental results with 16-node and 32-node cluster configurations show that, although the session reuse of ssl_with_session is critical to improve the performance of application servers, the proposed back-end forwarding scheme can further enhance the performance due to better load balancing. The ssl_with_bf scheme can minimize the average latency by about 40 percent and improve throughput across a variety of workloads.
Jin-Ha Kim, Gyu Sang Choi, Chita R. Das
IEEE Trans. Parallel Distributed Syst.1
2005 Exploiting NIC Memory for Improving Cluster-Based Webserver Performance
abstract
Improving the performance of Web servers has become a critical issue to handle the increasing demand on various network-based services. In this context, we exploit the local memory of programmable network interface cards (NICs) to improve the performance of cluster-based Web servers, which are increasingly used in designing Web server platforms. We use the NIC memory for caching recently accessed data blocks to improve server performance. We have implemented a prototype of the proposed NIC caching mechanism for a distributed Web server, based on PRESS (Carrera et al., 2002), on an 8-node, Myrinet-connected Linux cluster. Measurements with several server workloads show that NIC caching can enhance throughput by up to 27% compared to the original PRESS Web server without NIC caching, by minimizing the DMA and PCI bus overhead
Gyu Sang Choi, Jin-Ha Kim, Deniz Ersoz, Mazin S. Yousif, Chita R. Das
CLUSTER2
2005 A Load Balancing Scheme for Cluster-based Secure Network Servers
abstract
Although the secure sockets layer (SSL) is the most popular protocol to provide a secure channel between a client and a cluster-based network server, its high overhead degrades the server performance considerably, and thus, affects the server scalability. Therefore, improving the performance of SSL-enabled network servers is critical for designing scalable and high performance data centers. In this paper, we examine the impact of SSL offering and SSL-session aware distribution in cluster-based network servers. We propose a backend forwarding scheme, called ssl_with_bf that employs a low-overhead user-level communication mechanism like VIA to achieve good load balance among server nodes. We compare three distribution models for network servers: round robin (RR), ssl_with_session and ssl_with_bf through simulation. The experimental results with 16-node and 32-node cluster configurations show that while session reuse of ss_with_session is critical to improve the performance of application servers, the proposed backend forwarding scheme can further enhance the performance due to better load balancing. The ssl_with_bf scheme can minimize average latency by about 40% and improve throughput across a variety of workloads
Jin-Ha Kim, Gyu Sang Choi, Chita R. Das
CLUSTER1
2005 Improving Performance of Cluster-based Secure Application Servers with User-level Communication
abstract
In this paper, we have investigated the performance implications of SSL protocol for providing secure service in a cluster-based application server, and have proposed a backend forwarding scheme for improving server performance through better load balance. The proposed SSL/spl I.bar/with/spl I.bar/bf scheme exploits the underlying user-level communication minimizing the intra-cluster communication overhead. All results in this paper indicate that the proposed backend forwarding scheme is a viable mechanism for improving the performance of application servers in cluster-based data centers.
Jin-Ha Kim, Gyu Sang Choi, Chita R. Das
ICDE1
2005 A multi-threaded PIPELINED Web server architecture for SMP/SoC machines
abstract
Design of high performance Web servers has become a recent research thrust to meet the increasing demand of network-based services. In this paper, we propose a new Web server architecture, called multi-threaded PIPELINED Web server, suitable for Symmetric Multi-Processor (SMP) or System-on-Chip (SoC) architectures. The proposed PIPELINED model consists of multiple thread pools, where each thread pool consists of five basic threads and two helper threads. The main advantages of the proposed model are global information sharing by the threads, minimal synchronization overhead due to less number of threads, and non-blocking I/O operations, possible with the helper threads.We have conducted an in-depth performance analysis of the proposed server model along with four prior Web server models (Multi-Process (MP), Multi-Thread (MT), Single-Process Event-Driven (SPED) and Asynchronous Multi-Process Event-Driven (AMPED)) via simulation using six Web server workloads. The experiments are conducted to investigate the impact of various factors such as the memory size, disk speed and numbers of clients. The simulation results indicate that the proposed PIPELINED Web server architecture shows the best performance across all system and workload parameters compared to the MP, MT, SPED and AMPED models. Although the MT and AMPED models show competitive performance with less number of processors, the advantage of the PIPELINED model becomes obvious as the number of processors or clients in an SMP/SoC machine increases. The MP model shows the worst performance in most of the cases. The results indicate that the proposed server architecture can be used in future large-scale SMP/SoC machines to boost system performance.
Gyu Sang Choi, Jin-Ha Kim, Deniz Ersoz, Chita R. Das
WWW2
2004 Improving Response Time in Cluster-Based Web Servers through Coscheduling
abstract
Summary form only given. We investigate the feasibility of minimizing the response time of a Web server by exploiting the advantages of both user-level communication and coscheduling. We, thus, propose a coscheduled server model, based on the PRESS design where the remote cache accesses can be coscheduled on different nodes to reduce the response time. We experiment this concept using two known coscheduling techniques, called dynamic coscheduling (DCS) and DCS with immediate blocking. Extensive simulation of four server models (PRESS over TCP/IP, PRESS over VIA, coscheduled PRESS model with DCS, and with DCS and blocking) using 16-node and 32-node cluster configurations indicates that the average response time of a distributed server can be minimized significantly by coscheduling the communicating processes. The use of the DCS scheme reduced the average latency up to 80%, on an average 40%, compared to the PRESS over VIA model that uses only user-level communication, and by order of magnitude compared to the TCP/IP model. The throughput of the three user-level communication models is at least 25% better compared to the PRESS over TCP/IP model. Experiments with varying file size and cache size also confirmed the advantage of using a coscheduling mechanism for improving the response time behavior.
Jin-Ha Kim, Gyu Sang Choi, Deniz Ersoz, Chita R. Das
IPDPS1
2004 Coscheduling in Clusters: Is It a Viable Alternative?
abstract
In this paper, we conduct an in-depth evaluation of a broad spectrum of scheduling alternatives for clusters. These include the widely used batch scheduling, local scheduling, gang scheduling, all prior communication-driven coscheduling algorithms (Dynamic Coscheduling (DCS), Spin Block (SB), Periodic Boost (PB), and Co-ordinated Coscheduling (CC)) and a newly proposed HYBRID coscheduling algorithm on a 16-node, Myrinet-connected Linux cluster. Performance and energy measurements using several NAS, LLNL and ANL benchmarks on the Linux cluster provide several interesting conclusions. First, although batch scheduling is currently used in most clusters, all blocking-based coscheduling techniques such as SB, CC and HYBRID and the gang scheduling can provide much better performance even in a dedicated cluster platform. Second, in contrast to some of the prior studies, we observe that blocking-based schemes like SB and HYBRID can provide better performance than spin-based techniques like PB on a Linux platform. Third, the proposed HYBRID scheduling provides the best performance-energy behavior and can be implemented on any cluster with little effort. All these results suggest that blocking-based coscheduling techniques are viable candidates to be used in clusters for significant performance-energy benefits.
Gyu Sang Choi, Jin-Ha Kim, Deniz Ersoz, Andy B. Yoo, Chita R. Das
SC2
2003 Impact of Job Allocation Strategies on Communication-Driven Coscheduling in Clusters
Gyu Sang Choi, Jin-Ha Kim, Andy B. Yoo, Chita R. Das
Euro-Par3