Patricia A. Jacobs

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 VLDB 2026 / reviewers in the wild / expert

dblp:58/14 · DBLP profile ↗

← Back

1ranked-venue papers

0as first author

0since 2021 · last 1986

—ORCID · none

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

Theory 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

1 paper

Performance modeling and evaluation · 80% Embedded and real-time systems · 20%

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

Topic	Papers	Last	Evidence papers
Performance modeling and evaluation gaussian approximation	1	1986	Processor-Shared Time-Sharing Models in Heavy Traffic · SIAM J. Comput. 1986
Performance modeling and evaluation › queueing models heavy-traffic analysis	1	1986	Processor-Shared Time-Sharing Models in Heavy Traffic · SIAM J. Comput. 1986
Performance modeling and evaluation › queueing models processor sharing	1	1986	Processor-Shared Time-Sharing Models in Heavy Traffic · SIAM J. Comput. 1986
Performance modeling and evaluation queueing models	1	1986	Processor-Shared Time-Sharing Models in Heavy Traffic · SIAM J. Comput. 1986
Embedded and real-time systems › real-time scheduling › schedulability analysis response time analysis	1	1986	Processor-Shared Time-Sharing Models in Heavy Traffic · SIAM J. Comput. 1986

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

probability model · 0.0heavy-traffic analysis · 0.0

Year	Publication	Venue	Position
1986	Processor-Shared Time-Sharing Models in Heavy Traffic abstract Probability models are presented for computer systems with processor-shared (time-sliced) service discipline. The response (sojourn) time of an arriving job that requires T units of processing time is shown to be approximately Gaussian/normal under moderately heavy traffic conditions, e.g. when the number of terminals is large. Donald P. Gaver, Patricia A. Jacobs	SIAM J. Comput.	2