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

Shing I. Kong

dblp:58/4225 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1992
—ORCID · none

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

Systems, architecture and hardware · 2Software engineering, systems software and programming languages · 2

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 · 60% Processor architecture and microarchitecture · 26% Performance modeling and evaluation · 13%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

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

TopicWeightPapersLastEvidence papers
Memory systems › memory management › virtual memory
address translation
0.011992
Tradeoffs in Supporting Two Page Sizes · ISCA 1992
Memory systems › memory management › virtual memory
page size
0.011992
Tradeoffs in Supporting Two Page Sizes · ISCA 1992
Memory systems › memory management › virtual memory › address translation
TLB
0.011992
Tradeoffs in Supporting Two Page Sizes · ISCA 1992
Memory systems › memory management
virtual memory
0.011992
Tradeoffs in Supporting Two Page Sizes · ISCA 1992
Processor architecture and microarchitecture
instruction set architecture
0.011991
An Analysis of SPARC and MIPS Instruction Set Utilization on the SPEC Benchmarks · ASPLOS 1991
Processor architecture and microarchitecture › instruction set architecture
RISC
0.011991
An Analysis of SPARC and MIPS Instruction Set Utilization on the SPEC Benchmarks · ASPLOS 1991
Performance modeling and evaluation
workload characterization
0.011991
An Analysis of SPARC and MIPS Instruction Set Utilization on the SPEC Benchmarks · ASPLOS 1991
Compilers and program optimization
code generation
0.011991
An Analysis of SPARC and MIPS Instruction Set Utilization on the SPEC Benchmarks · ASPLOS 1991

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

dynamic instruction counting · 0.0simulation · 0.0
YearPublicationVenuePosition
1992 Tradeoffs in Supporting Two Page Sizes
abstract
As computer system main memories get larger and processor cycles-per-instruction (CPIs) get smaller, the time spent in handling translation lookaside buffer (TLB) misses could become a performance bottleneck. We explore relieving this bottleneck by (a) increasing the page size and (b) supporting two page sizes.
Madhusudhan Talluri, Shing I. Kong, Mark D. Hill, David A. Patterson 0001
ISCA2
1991 An Analysis of SPARC and MIPS Instruction Set Utilization on the SPEC Benchmarks
abstract
Copyright 1991, Association for Computing Machinery, Inc. Reprinted by permission. This paper originally appeared in Proceedings of the Fourth International Conference on Architecture Support for Programming Languages and Operating Systems (ASPLOS), Santa Clara, California, April 8-11, 1991. The dynamic instruction counts on MIPS and SPARC are compared using the SPEC benchmarks. MIPS typically executes more user-level instructions than SPARC. This difference can be counted for by architectural differences, compiler differences, and library differences. The most significant differences are that SPARC's double-precision floating point load/store is an architectural advantage in the SPEC floating point benchmarks while MIPS's compare-and-branch instruction is an architectural advantage in the SPEC integer benchmarks. After the differences in the two architectures are isolated, it appears that although MIPS and SPARC each have strengths and weaknesses in their compilers and library routines, the combined effect of compilers and library routines does not give either MIPS or SPARC a clear advantage in these areas.
Robert F. Cmelik, Shing I. Kong, David R. Ditzel, Edmund J. Kelly
ASPLOS2