MétaCan
Menu
Back to cohort
Record W2775486426 · doi:10.11575/prism/24736

A Framework for Improving Systems Performance by Minimizing Burstiness

2017· dissertation· en· W2775486426 on OpenAlex
Amir Kalbasi

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.

fundA Canadian funder is recorded on the work.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenuePRISM (University of Calgary) · 2017
Typedissertation
Languageen
FieldComputer Science
TopicEvolutionary Algorithms and Applications
Canadian institutionsnot available
FundersAlberta InnovatesAlberta Innovates - Technology Futures
KeywordsBurstinessComputer scienceComputer network

Abstract

fetched live from OpenAlex

The principal goal of this work is to support performance management for systems that utilize resources in complex ways. Typically, performance evaluation has been carried out for such systems using simulation tools. However, such tools require expert model builders to create and maintain abstract business process models of the system under study. This can lead to a lack of representativeness, specifically, when many unique scenarios are to be modelled. This thesis presents a new simulation approach, Simulation By Example, which guides the simulation directly using events extracted from traces, i.e., examples. This work demonstrates and evaluates this new approach using three case studies from healthcare systems. These studies establish the advantages of SBE over traditional simulation methods and its ability to support a variety of performance management exercises. Next, this thesis focuses on improving the performance of systems subjected to bursty workloads. Burstiness in resource service demands has previously been shown to have an adverse impact on system performance. This thesis proposes AMIR, an Analytic Method for Improving Responsiveness by reducing burstiness. AMIR considers a system with multiple classes of users and multiple resources that service user sessions in tandem. Batch processing systems, fabrication and manufacturing environments, micro-service systems, and patient operating rooms can be described in this way. Given the service demands distributions placed by all classes for the system's resources and the number of session arrivals for each class, AMIR decides an ordering of sessions that minimizes burstiness and improves system responsiveness metrics including session wait time, and total schedule processing time. A key aspect of the technique is an order O schedule burstiness metric β^O, which represents the mean joint probability that O+1 consecutive sessions in the schedule have resource demands at the bottleneck resource greater than the mean bottleneck resource demand of the schedule. For a given O, AMIR uses integer linear programming to produce schedules that progressively minimize β^i for all i in {1,...O}. Extensive simulation results show that AMIR significantly outperforms baseline policies such as shortest first and random scheduling. The results also provide insights on the conditions under which the technique is most effective.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.962
Threshold uncertainty score0.860

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.012
GPT teacher head0.226
Teacher spread0.214 · 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