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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Paul Vaughan

dblp:89/1412 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1988
—ORCID · none

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

Systems, architecture and hardware · 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
1 paper
Parallel and multicore computing · 87% Interconnection networks and networks-on-chip · 13%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel architecture
SIMD and MIMD architectures		 0.011988
A Fetch-And-Op Implementation for Parallel Computers · ISCA 1988
Parallel and multicore computing › synchronization
synchronization mechanisms		 0.011988
A Fetch-And-Op Implementation for Parallel Computers · ISCA 1988
Interconnection networks and networks-on-chip › network topology › tree networks
binary tree network		 0.011988
A Fetch-And-Op Implementation for Parallel Computers · ISCA 1988
YearPublicationVenuePosition
1988 A Fetch-And-Op Implementation for Parallel Computers
abstract
A fetch-and-op circuit is described. A bit-serial circuit-switched implementation requires only five gates per node in a binary tree. This circuit is also capable of test-and-set primitives (priority circuits) and swap operators, as well as AND and OR operations used in SIMD (single-instruction, multiple-data-stream) tests such as branch on all carries set. It provides an alternative implementation for the combining fetch-and-add circuit to the one designed for the Ultracomputer project; this implementation is suited to SIMD computing and can be adapted to MIMD (multiple-instruction, multiple-data stream) computing.>
G. Jack Lipovski, Paul Vaughan
 ISCA2