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 Tartar

dblp:15/2796 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 1986
—ORCID · none

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

Systems, architecture and hardware · 2Human-computer interaction and ubiquitous computing · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 1Theory of computation · 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
Electronic design automation · 80% Processor architecture and microarchitecture · 20%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › logic synthesis
logic minimization
0.011986
A Statistical Analysis of PLA Folding · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1986
Electronic design automation › logic synthesis › logic optimization
PLA folding
0.011986
A Statistical Analysis of PLA Folding · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1986
Compilers and program optimization
instruction scheduling
0.011976
The Identification of Maximal Parallelism in Straight-Line Microprograms · IEEE Trans. Computers 1976
Compilers and program optimization › instruction scheduling
parallel microoperation identification
0.011976
The Identification of Maximal Parallelism in Straight-Line Microprograms · IEEE Trans. Computers 1976
Processor architecture and microarchitecture › instruction-level parallelism
microoperation parallelism
0.011976
The Identification of Maximal Parallelism in Straight-Line Microprograms · IEEE Trans. Computers 1976
Processor architecture and microarchitecture
microprogramming
0.011976
The Identification of Maximal Parallelism in Straight-Line Microprograms · IEEE Trans. Computers 1976

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

statistical analysis · 0.0probability density function · 0.0heuristic · 0.0optimality analysis · 0.0
YearPublicationVenuePosition
1986 A Statistical Analysis of PLA Folding
abstract
Current understanding of the PLA folding problem is limited to simple empirical evidence from studies of heuristic methods. This paper presents a theoretical approach through an analytical and statistical analysis. The problem is first mapped into a set theoretic model. Using a random selection heuristic as a basis, a probability density function (PDF) is derived for the expected number of folds under a set of simplifying assumptions. This PDF is derived in terms of the three fundamental properties of a PLA, r the number of rows, c the number of columns, and d the density. Empirical results obtained from folding thousands of randomly generated PLA's verify the accuracy of the derived probability density function. A technique is developed whereby the PDF can also be used to predict the size of optimal folding sets. A new folding heuristic is introduced which is shown to perform better than other heuristic algorithms in the literature, when applied to a set of randomly generated PLA's. This is the first folding heuristic to have an analytical basis for its expected results, as derived from the PDF function.
Darrell Makarenko, John Tartar
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2
1976 The Identification of Maximal Parallelism in Straight-Line Microprograms
abstract
We consider the problem of automatic identification of parallel microoperations in a given straight-line microprogram. Earlier work on this problem generally falls into two categories. While some work is fairly general in that it can be applied to both monophase and polyphase systems, it does not guarantee optimality of the output. Work in the second category attempts to optimize the output, but is restricted in application to monophase microprograms.
Subrata Dasgupta, John Tartar
IEEE Trans. Computers2
1975 On the Minimization of Control Memories
Subrata Dasgupta, John Tartar
Inf. Process. Lett.2
1973 A course in minicomputer systems
abstract
The study of minicomputer systems in a laboratory environment has been considered by both Electrical Engineering [1], and Computer Science [2] departments. In a summary of the COSINE Committee report on Digital Laboratories, Booth [1] points out that since minicomputers are becoming an integral part of many industrial systems, it is mandatory that students be made aware of the principles of such systems. Further, Booth suggests that the best way to accomplish this is in a projects-oriented laboratory environment. We certainly agree with his statement that “A successfully completed project thus gives the student a sense of accomplishment that is hard to duplicate in any other educational situation.”
T. Anthony Marsland, John Tartar
SIGCSE2
1972 Undergraduate education in computing science some immediate problems
abstract
The combination of a large number of students and a rapidly developing discipline imposes considerable responsibilities on those charged with providing curricula in computer or computing science. Rather than philosophize about the nature of the discipline itself in this paper, we intend to discuss at a pragmatic level the problems we see at the present time in our own case, and the steps we are taking to resolve them.
John Tartar, John P. Penny
SIGCSE1