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

Kyueun Yi

dblp:19/3895 · DBLP profile ↗
← Back
4ranked-venue papers
4as 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 · 4 · 4 first-author

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
Processor architecture and microarchitecture · 67% Memory systems · 33%
Computer networks
2 papers
Internet architecture and protocols · 100%

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

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture › special-purpose processor
network processor
0.322013
Importance of Coherence Protocols with Network Applications on Multicore Processors · IEEE Trans. Computers 2013
Network Applications on Simultaneous Multithreading Processors · IEEE Trans. Computers 2010
Memory systems
cache coherence
0.212013
Importance of Coherence Protocols with Network Applications on Multicore Processors · IEEE Trans. Computers 2013
Memory systems › cache coherence
cache coherence protocol
0.212013
Importance of Coherence Protocols with Network Applications on Multicore Processors · IEEE Trans. Computers 2013
Processor architecture and microarchitecture
chip multiprocessor
0.212013
Importance of Coherence Protocols with Network Applications on Multicore Processors · IEEE Trans. Computers 2013
Processor architecture and microarchitecture
instruction-level parallelism
0.112010
Network Applications on Simultaneous Multithreading Processors · IEEE Trans. Computers 2010
Processor architecture and microarchitecture › multithreading
simultaneous multithreading
0.112010
Network Applications on Simultaneous Multithreading Processors · IEEE Trans. Computers 2010
Internet architecture and protocols
packet processing
0.122013
Importance of Coherence Protocols with Network Applications on Multicore Processors · IEEE Trans. Computers 2013
Network Applications on Simultaneous Multithreading Processors · IEEE Trans. Computers 2010

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

simulation · 0.5IPC analysis · 0.2
YearPublicationVenuePosition
2013 Importance of Coherence Protocols with Network Applications on Multicore Processors
abstract
As Internet and information technology have continued developing, the necessity for fast packet processing in computer networks has also grown in importance. All emerging network applications require deep packet classification as well as security-related processing and they should be run at line rates. Hence, network speed and the complexity of network applications will continue increasing and future network processors should simultaneously meet two requirements: high performance and high programmability. We will show that the performance of single processors will not be sufficient to support future demands. Instead, we will have to turn to multicore processors, which can exploit the parallelism in network workloads. In this paper, we focus on the cache coherence protocols which are central to the design of multicore-based network processors. We investigate the effects of two main categories of various cache coherence protocols with several network workloads on multicore processors. Our simulation results show that token protocols have a significantly higher performance than directory protocols. With an 8-core configuration, token protocols improves the performance compared to directory protocols by a factor of nearly 4 on average.
Kyueun Yi, Won Woo Ro, Jean-Luc Gaudiot
IEEE Trans. Computers1
2010 Network Applications on Simultaneous Multithreading Processors
abstract
As network applications become increasingly sophisticated and Internet traffic is getting heavier, future network processors must continue processing computation-intensive network applications at line rates. Most programmable network processors on the market today, such as the Intel IXP2800, target relatively low performance (from 100 Mbps to 10 Gbps). However, low cost edge routers will find it hard to cope with the forthcoming sophistication of network applications to be processed at those speeds. Hence, new architectures should be designed for the programmable network processors of the future. The goal of this paper is to evaluate the applicability and efficiency of Simultaneous MultiThreaded (SMT) as the base architecture of a network processor. Indeed, the SMT model inherently allows the multiple parallel threads which must be dealt with in network processor applications. In this paper, we investigate the architectural implications of network applications on the SMT architecture. We demonstrate that, when executed as independent threads, applications chosen from different network layers show an improved Instructions Per Cycle (IPC) and cache behavior when compared with the situation where the program executed comes from a single network application. Finally, a new architectural solution to cope with packet dependency is proposed and evaluated.
Kyueun Yi, Jean-Luc Gaudiot
IEEE Trans. Computers1
2007 Architectural Support for Network Applications on Simultaneous MultiThreading Processors
abstract
As network applications become increasingly sophisticated and Internet traffic is getting heavier, future network processors must continue processing computation-intensive network applications at line rates. Most programmable network processors on the market today, such as the Intel IXP2800, target low performance (from 100 Mbps to 10 Gbps). However, low cost edge routers find it hard to cope with the forthcoming sophistication of network applications to be processed at those speeds. Hence, new architectures should be designed for the programmable network processors of the future. The goal of this paper is to evaluate the applicability and efficiency of simultaneous multi-threaded (SMT) as a network processor. Indeed, the SMT model inherently allows the multiple parallel threads which must be dealt with in network processor applications. In this paper, we investigate the architectural implications of network applications on the SMT architecture. We demonstrate that, when executed as independent threads, applications chosen from different network layers show an improved IPC and cache behavior when compared with the situation where the program executed comes from a single network application. Finally, a new architectural solution to cope with packet dependency is proposed and evaluated.
Kyueun Yi, Jean-Luc Gaudiot
IPDPS1
2007 Architectural Implications of Cache Coherence Protocols with Network Applications on Chip MultiProcessors
abstract
Network processors are specialized integrated circuits used to process packets in such network equipment as core routers, edge routers, and access routers. As predicted by Gilder’s law, Internet traffic has doubled each year since 1997 and this trend is showing no signs of abating. Since all emerging network applications which require deep packet classification and security-related processing should be run at line rates and since network speed and network applications complexity continue increasing, future network processors should simultaneously meet two requirements: high performance and high programmability. Single processor performance will not be sufficient to support the requirements which will be imposed on future network processors. In this paper, we consider the CMP model as the baseline architecture of future network processors. We investigate the architectural implications of cache coherence protocols with network workloads on CMPs. Our results show that the token protocol which uses the tokens to control read/write permission of shared data blocks shows better performance than the directory protocol by a factor of 13.4%. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Kyueun Yi, Jean-Luc Gaudiot
NPC1