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

Sung I. Hong

dblp:01/2100 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2000
—ORCID · none

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

Systems, architecture and hardware · 2 · 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
Memory systems · 59% Processor architecture and microarchitecture · 19% High-performance computing · 17%

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

TopicWeightPapersLastEvidence papers
Memory systems
DRAM
0.122000
Dynamic Access Ordering for Streamed Computations · IEEE Trans. Computers 2000
Access Order and Effective Bandwidth for Streams on a Direct Rambus Memory · HPCA 1999
Processor architecture and microarchitecture › memory system microarchitecture
memory ordering
0.012000
Dynamic Access Ordering for Streamed Computations · IEEE Trans. Computers 2000
Memory systems
memory bandwidth
0.011999
Access Order and Effective Bandwidth for Streams on a Direct Rambus Memory · HPCA 1999
High-performance computing › data-intensive computing
streaming computation
0.011999
Access Order and Effective Bandwidth for Streams on a Direct Rambus Memory · HPCA 1999
Memory systems › memory bandwidth
memory bandwidth optimization
0.012000
Dynamic Access Ordering for Streamed Computations · IEEE Trans. Computers 2000
Performance modeling and evaluation › performance model construction › memory system performance modeling
memory bottleneck analysis
0.011999
Access Order and Effective Bandwidth for Streams on a Direct Rambus Memory · HPCA 1999

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

stream memory controller · 0.0hardware prefetching · 0.0compile-time stream detection · 0.0streaming hardware · 0.0cacheline burst analysis · 0.0
YearPublicationVenuePosition
2000 Dynamic Access Ordering for Streamed Computations
abstract
Memory bandwidth is rapidly becoming the limiting performance factor for many applications, particularly for streaming computations such as scientific vector processing or multimedia (de)compression. Although these computations lack the temporal locality of reference that makes traditional caching schemes effective, they have predictable access patterns. Since most modern DRAM components support modes that make it possible to perform some access sequences faster than others, the predictability of the stream accesses makes it possible to reorder them to get better memory performance. We describe a Stream Memory Controller (SMC) system that combines compile-time detection of streams with execution-time selection of the access order and issue. The SMC effectively prefetches read-streams, buffers write-streams, and reorders the accesses to exploit the existing memory bandwidth as much as possible. Unlike most other hardware prefetching or stream buffer designs, this system does not increase bandwidth requirements. The SMC is practical to implement, using existing compiler technology and requiring only a modest amount of special purpose hardware. We present simulation results for fast-page mode and Rambus DRAM memory systems and we describe a prototype system with which we have observed performance improvements for inner loops by factors of 13 over traditional access methods.
Sally A. McKee, William A. Wulf, James H. Aylor, Robert H. Klenke, Maximo H. Salinas, Sung I. Hong, Dee A. B. Weikle
IEEE Trans. Computers6
1999 Access Order and Effective Bandwidth for Streams on a Direct Rambus Memory
abstract
Processor speeds are increasing rapidly and memory speeds are not keeping up. Streaming computations (such as multimedia or scientific applications) are among those whose performance is most limited by the memory bottleneck. Rambus hopes to bridge the processor/memory performance gap with a recently introduced DRAM that can deliver up to 1.6 Gbytes/sec. We analyze the performance of these interesting new memory devices on the inner loops of streaming computations, both for traditional memory controllers that treat all DRAM transactions as random cacheline accesses, and for controllers augmented with streaming hardware. For our benchmarks, we find that accessing unit-stride streams in cacheline bursts in the natural order of the computation exploits from 44-76% of the peak bandwidth of a memory system composed of a single Direct RDRAM device, and that accessing streams via a streaming mechanism with a simple access ordering scheme can improve performance by factors of 1.18 to 2.25.
Sung I. Hong, Sally A. McKee, Maximo H. Salinas, Robert H. Klenke, James H. Aylor, William A. Wulf
HPCA1