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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Kenneth Lloyd Rider

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

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

Applied, interdisciplinary, general and emerging computing · 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 architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 67% Electronic design automation · 33%

Topics — the 3 heaviest of 3, 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.011976
A Simple Approximation to the Average Queue Size in the Time-Dependent M/M/1 Queue · J. ACM 1976
Performance modeling and evaluation
queueing models		 0.011976
A Simple Approximation to the Average Queue Size in the Time-Dependent M/M/1 Queue · J. ACM 1976
Electronic design automation › circuit simulation
transient analysis		 0.011976
A Simple Approximation to the Average Queue Size in the Time-Dependent M/M/1 Queue · J. ACM 1976

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

approximation · 0.0
YearPublicationVenuePosition
1976 A Simple Approximation to the Average Queue Size in the Time-Dependent M/M/1 Queue
abstract
The time-dependent equations for the M/M/1 queue can be reduced to a single equation for the expected queue size, but the equation is dependent on P 0 ( t ), the probability of no jobs in the system. An exact equation for the behavior of P 0 ( t ) under special conditions is derived and an approximation relating P 0 ( t ) to Q ( t ), the expected queue size at time t , is derived for the case when the change in queue size is slow compared to the service rate. It is found that the approximation affords a significant improvement over the use of a steady state approximation to the time-dependent queue and is simpler to use than the exact equations.
Kenneth Lloyd Rider
 J. ACM1