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

Leonard J. Shustek

dblp:02/1273 · also Len Shustek · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 1977
—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 · 1Graphics, computer vision, multimedia, augmented reality and games · 1Human-computer interaction and ubiquitous 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
2 papers
Processor architecture and microarchitecture · 46% Hardware accelerators and domain-specific architectures · 40% Memory systems · 14%
Theoretical computer science
1 paper
Algorithms and data structures · 100%
Computer graphics and multimedia
1 paper
Rendering · 100%

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

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture
pipelining
0.011977
An Instruction Timing Model of CPU Performance · ISCA 1977
Rendering
raster graphics
0.011976
The design of a low cost video graphics terminal · SIGGRAPH 1976
Algorithms and data structures › similarity search › nearest neighbor search
k-nearest neighbors
0.011975
An Algorithm for Finding Nearest Neighbors · IEEE Trans. Computers 1975
Algorithms and data structures › similarity search
nearest neighbor search
0.011975
An Algorithm for Finding Nearest Neighbors · IEEE Trans. Computers 1975
Memory systems
cache
0.011977
An Instruction Timing Model of CPU Performance · ISCA 1977

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

vector command mapping · 0.0microprocessor control · 0.0program behavior analysis · 0.0performance analysis · 0.0distance calculation pruning · 0.0
YearPublicationVenuePosition
1977 An Instruction Timing Model of CPU Performance
abstract
A model of high-performance computers is derived from instruction timing formulas, with compensation for pipeline and cache memory effects. The model is used to predict the performance of the IBM 370/168 and the Amdahl 470 V/6 on specific programs,/and the results are verified by comparison with actual performance. Data collected about program behavior is combined with the performance analysis to highlight some of the problems with high-performance implementations of such architectures.
Bernard L. Peuto, Leonard J. Shustek
ISCA2
1976 The design of a low cost video graphics terminal
abstract
We have designed and built a computer terminal that provides low cost, high quality graphics and programmable text processing by taking advantage of the latest memory and microprocessor technology. A microprocessor control element allows most of the control functions to be programmed so that all of the control electronics require less than 100 integrated circuits. The graphic image is generated by a microprocessor which accepts vector commands intended for a Tektronix storage tube display terminal. The microprocessor maps those vector commands into a random access memory, and the resulting bit map of the graphic image is displayed on a standard TV monitor. Reasonable resolution in the graphic image requires a large number of bits in the bit map, but with the use of 4K memory chips, less than 100 integrated circuits are required for the bit map memory in our design. At 1975 small-quantity prices, the parts cost for the terminal is approximately $2000.
Forest Baskett, Leonard J. Shustek
SIGGRAPH2
1975 An Algorithm for Finding Nearest Neighbors
abstract
An algorithm that finds the k nearest neighbors of a point, from a sample of size N in a d-dimensional space, with an expected number of distance calculations is described, its properties examined, and the validity of the estimate verified with simulated data.
Jerome H. Friedman, Forest Baskett, Leonard J. Shustek
IEEE Trans. Computers3