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

Michael J. Carlton

dblp:14/457 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1993
—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 · 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
Performance modeling and evaluation · 36% Memory systems · 36% Processor architecture and microarchitecture · 24%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
benchmarking
0.011993
Micro benchmark analysis of the KSR1 · SC 1993
Memory systems
cache
0.011993
Micro benchmark analysis of the KSR1 · SC 1993
Performance modeling and evaluation › benchmarking
microbenchmarking
0.011993
Micro benchmark analysis of the KSR1 · SC 1993
Memory systems
shared memory
0.011993
Micro benchmark analysis of the KSR1 · SC 1993
Processor architecture and microarchitecture
instruction set architecture
0.011990
Fast Prolog with an Extended General Purpose Architecture · ISCA 1990
Interconnection networks and networks-on-chip
ring network
0.011993
Micro benchmark analysis of the KSR1 · SC 1993
Compilers and program optimization › compiler construction
prolog compilation
0.011990
Fast Prolog with an Extended General Purpose Architecture · ISCA 1990

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

simulation · 0.0microbenchmarks · 0.0
YearPublicationVenuePosition
1993 Micro benchmark analysis of the KSR1
abstract
A new approach, micro benchmarks, has recently been developed. Using this technique, we have analyzed the KSR1, and in particular the "ALLCACHE" memory architecture and ring interconnection. We have been able to elucidate many facets of memory performance. The technique has enabled us to identify and characterize parts of the memory design not described by Kendall Square Research. Our results show that a miss in the local cache can incur a penalty ranging from 7.5 microseconds to 500 microseconds (when a dirty "page" in the local cache must be evicted). The programmer must be very careful in placement and accessing of data to obtain maximum performance from the KSR1; the data presented here will help in understanding the performance actually obtained. 1. Introduction The KSR1 from Kendall Square Research is a novel new parallel computer. It is the first commercial machine embodying a scalable all cache form of shared memory architecture. In addition, there are a number of other inter...
Rafael H. Saavedra, R. Stockton Gaines, Michael J. Carlton
SC3
1990 Fast Prolog with an Extended General Purpose Architecture
abstract
Most Prolog machines have been based on specialized architectures. Our goal is to start with a general purpose architecture and determine a minimal set of extensions for high performance Prolog execution. We have developed both the architecture and optimizing compiler simultaneously, drawing on results of previous implementations. We find that most Prolog specific operations can be done satisfactorily in software; however, there is a crucial set of features that the architecture must support to achieve the best Prolog performance. The emphasis of this paper is on our architecture and instruction set. The costs and benefits of the special architectural features and instructions are analyzed. Simulated performance results are presented and indicate a peak compiled Prolog performance of 3.68 million logical inferences per second.
Bruce K. Holmer, Barton Sano, Michael J. Carlton, Peter Van Roy, Ralph Clarke Haygood, William R. Bush, Alvin M. Despain, Joan M. Pendleton, Tep P. Dobry
ISCA3