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

Ikhwan Lee

dblp:49/3490 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2012
—ORCID · none

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

Systems, architecture and hardware · 3 · 1 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
Distributed systems · 40% Memory systems · 17% Electronic design automation · 13%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › high-level synthesis › memory synthesis › memory partitioning
bank partitioning
0.112012
Balancing DRAM locality and parallelism in shared memory CMP systems · HPCA 2012
Distributed systems › fault tolerance
checkpointing
0.112012
Containment domains: a scalable, efficient, and flexible resilience scheme for exascale systems · SC 2012
Memory systems
DRAM
0.112012
Balancing DRAM locality and parallelism in shared memory CMP systems · HPCA 2012
Interconnection networks and networks-on-chip › error control
error detection and recovery
0.112012
Containment domains: a scalable, efficient, and flexible resilience scheme for exascale systems · SC 2012
High-performance computing › supercomputing
exascale computing
0.112012
Containment domains: a scalable, efficient, and flexible resilience scheme for exascale systems · SC 2012
Distributed systems
fault tolerance
0.112012
Containment domains: a scalable, efficient, and flexible resilience scheme for exascale systems · SC 2012
Distributed systems › fault tolerance
resilience
0.112012
Containment domains: a scalable, efficient, and flexible resilience scheme for exascale systems · SC 2012
Processor architecture and microarchitecture
chip multiprocessor
0.012012
Balancing DRAM locality and parallelism in shared memory CMP systems · HPCA 2012
Memory systems
shared memory
0.012012
Balancing DRAM locality and parallelism in shared memory CMP systems · HPCA 2012

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

trace-driven simulation · 0.1physical frame allocation · 0.1analytical modeling · 0.1
YearPublicationVenuePosition
2012 Balancing DRAM locality and parallelism in shared memory CMP systems
abstract
Modern memory systems rely on spatial locality to provide high bandwidth while minimizing memory device power and cost. The trend of increasing the number of cores that share memory, however, decreases apparent spatial locality because access streams from independent threads are interleaved. Memory access scheduling recovers only a fraction of the original locality because of buffering limits. We investigate new techniques to reduce inter-thread access interference. We propose to partition the internal memory banks between cores to isolate their access streams and eliminate locality interference. We implement this by extending the physical frame allocation algorithm of the OS such that physical frames mapped to the same DRAM bank can be exclusively allocated to a single thread. We compensate for the reduced bank-level parallelism of each thread by employing memory sub-ranking to effectively increase the number of independent banks. This combined approach, unlike memory bank partitioning or sub-ranking alone, simultaneously increases overall performance and significantly reduces memory power consumption.
Min Kyu Jeong, Doe Hyun Yoon, Dam Sunwoo, Michael B. Sullivan 0001, Ikhwan Lee, Mattan Erez
HPCA5
2012 Containment domains: a scalable, efficient, and flexible resilience scheme for exascale systems
abstract
This paper describes and evaluates a scalable and efficient resilience scheme based on the concept of containment domains. Containment domains are a programming construct that enable applications to express resilience needs and to interact with the system to tune and specialize error detection, state preservation and restoration, and recovery schemes. Containment domains have weak transactional semantics and are nested to take advantage of the machine and application hierarchies and to enable hierarchical state preservation, restoration, and recovery. We evaluate the scalability and efficiency of containment domains using generalized trace-driven simulation and analytical analysis and show that containment domains are superior to both checkpoint restart and redundant execution approaches.
Jinsuk Chung, Ikhwan Lee, Michael B. Sullivan 0001, Jeeho Ryoo, Dong-Wan Kim, Doe Hyun Yoon, Larry Kaplan, Mattan Erez
SC2
2006 PowerViP: Soc power estimation framework at transaction level
abstract
In this work, we propose a SoC power estimation framework built on our system-level simulation environment. Our framework provides designers with the system-level power profile in a cycle-accurate manner. We target the framework to run fast and accurately, which is enabled by adopting different modeling techniques depending on the power characteristics of various IP blocks. The framework can be applied to any target SoC design
Ikhwan Lee, Sungjoo Yoo, Eui-Young Chung, Kyu-Myung Choi, Jeong-Taek Kong, Soo-Kwan Eo
ASP-DAC1