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

Thomas S. Heines

dblp:61/4799 · DBLP profile ↗
← Back
2ranked-venue papers
2as 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 · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author

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 networks
1 paper
Network performance modeling · 100%

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

TopicWeightPapersLastEvidence papers
Network performance modeling › queueing analysis
buffer behavior
0.011979
Buffer Behavior in Computer Communication Systems · IEEE Trans. Computers 1979
Network performance modeling
queueing analysis
0.011979
Buffer Behavior in Computer Communication Systems · IEEE Trans. Computers 1979

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

queueing theory · 0.0poisson arrival model · 0.0
YearPublicationVenuePosition
1988 Compiler Performance Analysis Tools
abstract
Abstract Most of the performance bench‐marks for compilers do not give detailed performance characteristics that might be useful to a programmer. The goal of most bench‐marks seems to be to produce a single number. A set of bench‐mark tools that measure individual language features of C and generate a large number of measurements has been designed to create a detailed performance profile of any C compiler. There is an emphasis on the detailed statement‐level measurements of both CPU and I/O aspects of C, but there is also a range of routine and program‐level bench‐marks that seek to measure the interaction of CPU and I/O in actual application programs. The programs are portable, parametrized, and openended so that additional measurements can be added with little effort. With some additional effort, the tools could be adapted to other languages.
Thomas S. Heines, Paul J. Jalics
Softw. Pract. Exp.1
1979 Buffer Behavior in Computer Communication Systems
abstract
A buffer has been analyzed in a computer communication system with Poisson arrivals, periodic opportunities for service, and random blocking of service. The solution obtained reflects the waiting a customer must do until a service opportunity arises. Compared to previous solutions for this problem, the average queue length and the variance of queue length are larger by a factor which depends on the arrival rate.
Thomas S. Heines
IEEE Trans. Computers1