Approximate MVA for client-server systems with nonpreemptive priority
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
A new approximate algorithm for the Stochastic Rendezvous Network (SRVN) model with nonpreemptive priority scheduling is introduced in this paper. SRVN is a performance model for client-server systems with synchronous communication which is different from Queueing Network models in two ways: it allows for nested services, and offers two phases of service (the first executed while the client is blocked and the second in parallel with the client). Earlier SRVN solutions have used a kind of approximate MVA based on heuristic assumptions to determine the queues properties at the instants of service request arrivals. More recently a new strategy called "Task-Directed Aggregation" (TDA) was introduced for the derivation of the arrival-instant probabilities equations for FIFO servers. The present paper applies TDA to nonpreemptive priority scheduling, thus demonstrating the value of this new strategy for models with no product-form solution. Experimental results show that the accuracy of the algorithm is good if the server is not saturated, and if a reasonable fraction of the load is available for the low-priority clients. The accuracy of the algorithm is consistent with results known for QN priority approximations.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it