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

John D. Bruner

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

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

Systems, architecture and hardware · 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
1 paper
Electronic design automation · 67% Parallel and multicore computing · 33%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › logic synthesis
logic network design
0.011980
Efficient Function Implementation for Bit-Serial Parallel · IEEE Trans. Computers 1980
Electronic design automation
logic synthesis
0.011980
Efficient Function Implementation for Bit-Serial Parallel · IEEE Trans. Computers 1980

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

logic design methodology · 0.0heuristic design algorithms · 0.0
YearPublicationVenuePosition
1983 : A Parallel P-Code for Parallel Pascal and Other High Level Languages
Anthony P. Reeves, John D. Bruner
ICPP2
1980 Efficient Function Implementation for Bit-Serial Parallel
abstract
Parallel processors with bit-serial processing elements (PE's) usually implement arithmetic functions by a sequence of word-level arithmetic operations; however, basic operations must be specified at the bit level. In this correspondence the possibility of more efficiently implementing a function with a special tailored sequence of bit-serial operations is considered. A general scheme is described for generating efficient programs to implement arbitrary functions on bit-serial-arithmetic processors. This scheme is based on logic design methodology and involves designing a logic network to realize a desired function. The parallel processor is then used to efficiently simulate a set of these networks. Heuristic design algorithms are used to generate the logic networks; several algorithms are described and compared with some benchmark functions. Several efficient PE designs are described and analyzed.
Anthony P. Reeves, John D. Bruner
IEEE Trans. Computers2