MétaCan
Menu
Back to cohort
Record W4210400653 · doi:10.1090/fic/028/01

Predicting response times in processor-sharing queues

2000· other· en· W4210400653 on OpenAlexaff
Amy R. Ward, Ward Whitt

Bibliographic record

Venuenot available
Typeother
Languageen
FieldBusiness, Management and Accounting
TopicAdvanced Queuing Theory Analysis
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsQueueComputer scienceParallel computingComputer network

Abstract

fetched live from OpenAlex

Abstract. We investigate the possibility of reliably predicting response times in real time (e.g., at the time a job arrives) in the M/G/1 processor-sharing queue. The proposed prediction is the conditional mean given current state information. We consider several forms of state information, always including the remaining service requirement of the job of interest and the number of other jobs in the system. We consider three cases for the other jobs ’ service requirements: First, we assume that all the remaining service requirements are known; second, we assume that the amount of completed work of each customer in service is known; and third, we assume that nothing more is known. We thus are able to study the value of different kinds of information. We calculate the conditional mean and variance of the response time, given the state information, by numerically inverting Laplace transforms. We evaluate the reliability by looking at the ratio of the standard

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.005
metaresearch head score (Gemma)0.023
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.010
Threshold uncertainty score0.028

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.023
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.009
GPT teacher head0.238
Teacher spread0.228 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations17
Published2000
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Queuing Theory AnalysisFrench-language works237,207