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

Brian W. Thomson

dblp:07/5716 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 1990
—ORCID · none

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

Security and privacy · 2 · 1 first-authorComputer networks · 1Software 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 · 66% Processor architecture and microarchitecture · 34%
Computer networks
1 paper
Internet architecture and protocols · 50% Optical networks · 50%
Software engineering, system software, and programming languages
1 paper
Runtime systems and virtual machines · 100%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation
analytical modeling
0.011988
HUBNET performance measurement · IEEE J. Sel. Areas Commun. 1988
Performance modeling and evaluation
network performance measurement
0.011988
HUBNET performance measurement · IEEE J. Sel. Areas Commun. 1988
Performance modeling and evaluation › simulation › communication system simulation
network simulation
0.011988
HUBNET performance measurement · IEEE J. Sel. Areas Commun. 1988
Processor architecture and microarchitecture
instruction set architecture
0.011986
Swamp: A Fast Processor for Smalltalk-80 · OOPSLA 1986
Processor architecture and microarchitecture
microprogramming
0.011986
Swamp: A Fast Processor for Smalltalk-80 · OOPSLA 1986
Optical networks
fiber optic local area network
0.011988
HUBNET performance measurement · IEEE J. Sel. Areas Commun. 1988
Internet architecture and protocols
local area network
0.011988
HUBNET performance measurement · IEEE J. Sel. Areas Commun. 1988

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

queueing analysis · 0.0experimental load testing · 0.0micro-address prediction · 0.0bit-slice ALU · 0.0
YearPublicationVenuePosition
1990 An Architecture for a Trusted Network
E. Stewart Lee, Brian W. Thomson, Peter I. P. Boulton, Michael Stumm
ESORICS2
1990 Using Deducibility in Secure Network Modelling
Brian W. Thomson, E. Stewart Lee, Peter I. P. Boulton, Michael Stumm, David M. Lewis
ESORICS1
1988 HUBNET performance measurement
abstract
Media-access delays in HUBNET, a high-performance local area network, are examined. An experimental technique for loading such a network with data up to 97.5% of its nominal bit rate is described. The results of a series of measurements of the packet-access delay in a network operating at loads up to 87.5% of capacity are presented. A modeling technique for this process is developed, and the results of calculations based on that model are compared to the experimental results. Extremely good agreement is obtained. The model is then used to examine the network behavior comprehensively over an extensive range of parameters.>
E. Stewart Lee, Peter I. P. Boulton, Brian W. Thomson
IEEE J. Sel. Areas Commun.3
1986 Swamp: A Fast Processor for Smalltalk-80
abstract
A processor for the Smalltalk-80↑ programming language is described. This machine is implemented using a standard bit slice ALU and sequencer, TTL MSI, and NMOS LSI RAMS. It executes an instruction set similar to the Smalltalk-80 virtual machine instruction set. The data paths of the machine are optimized for rapid Smalltalk-80 execution by the inclusion of a context cache, tag checking, and a hardware method cache. Each context is only partly initialized when created, and has no memory allocated for it until a possibly non-LIFO reference to it is created. The machine is microprogrammed, and uses a simple next micro-address prediction strategy to obtain most of the performance of pipelining without the attendant complexity. The machine can execute simple instructions at over 7M bytecodes per second and has a predicted average throughput of 1.9M bytecodes per second.
David M. Lewis, David R. Galloway, Robert J. Francis, Brian W. Thomson
OOPSLA4