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

Gary R. Beall

dblp:165/0619 · 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

Computer networks · 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
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Performance modeling and evaluation › queueing models › single server queue
m/m/1 queue
0.011988
Transient M/M/1 queue variance computation using generalized Q functions · IEEE Trans. Commun. 1988
Performance modeling and evaluation
queueing models
0.011988
Transient M/M/1 queue variance computation using generalized Q functions · IEEE Trans. Commun. 1988

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

parl's method · 0.0generalized q-function · 0.0error bounding · 0.0
YearPublicationVenuePosition
1988 Transient M/M/1 queue variance computation using generalized Q functions
abstract
A generalized Q function representation for the transient M/M/1 queue variance is developed. The expression is highly accurate and computationally efficient, and an upper bound on the error is easily calculated. For a Q function relative error of 2*10-/sup 12/ using Parl's method, the relative error of the variance is generally less than 10/sup -9/. Average execution time is of the order of 70 ms per point on a VAX 11/750, but faster execution times can be obtained by using larger Q function relative errors.>
Pierce E. Cantrell, Gary R. Beall
IEEE Trans. Commun.2