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

James R. Slager

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

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

Systems, architecture and hardware · 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
Processor architecture and microarchitecture · 67% Integrated circuit design · 33%

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

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture › microprocessor design
bit-slice architecture
0.011970
Efficient MSI Partitioning for a Digital Computer · IEEE Trans. Computers 1970
Processor architecture and microarchitecture › microprocessor design › processor core design
control unit design
0.011970
Efficient MSI Partitioning for a Digital Computer · IEEE Trans. Computers 1970
Integrated circuit design
digital circuit design
0.011970
Efficient MSI Partitioning for a Digital Computer · IEEE Trans. Computers 1970

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

state graph implementation · 0.0look-ahead carry · 0.0
YearPublicationVenuePosition
1970 Efficient MSI Partitioning for a Digital Computer
abstract
An efficient partitioning scheme based on current capability of MOS MSI technology was evolved in which four functional building blocks were defined for implementing computer digital architecture. The partitioning employs a bit slice concept to define registers and a universal logic gate for general two-or three-variable logic. A look-ahead carry for fast arithmetic and a heavily buffered OR gate structure for the control section complete the partitioning elements. Microsequencing for instruction decoding is accomplished with a state graph implemented with register FBB flip-flops.
George V. Podraza, Roland S. Gregg Jr., James R. Slager
IEEE Trans. Computers3