MétaCan
Menu
Back to cohort
Record W2167499027 · doi:10.1109/icpp.2006.8

A Framework to Achieve Guaranteed QoS for Applications and High System Performance in Multi-Institutional Grid Computing

2006· article· en· W2167499027 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDistributed and Parallel Computing Systems
Canadian institutionsCarleton University
Fundersnot available
KeywordsComputer scienceDistributed computingQuality of serviceWorkloadShared resourceGridResource (disambiguation)Grid computingSet (abstract data type)Component (thermodynamics)Task (project management)Resource allocationResource management (computing)Computer networkOperating system

Abstract

fetched live from OpenAlex

Providing QoS guarantees to the applications in a multi-institutional grid is a challenging task. Although advance reservations (ARs) can provide QoS guarantees for the applications, they often seriously degrade system performance for resource owners. In this paper, we present a framework for AR based resource sharing that not only provides QoS guarantees for the applications but also ensures high utilization of the resources. This paper focuses on the application-to-resource mapping component of the framework as our results show that traditional mapping algorithms used with best effort jobs do not perform well for ARs. The paper proposes a set of algorithms for mapping ARs and investigates their performance in detail. The paper then presents a novel algorithm that outperforms a number of other algorithms in almost every respect for a wide range of workload parameters. Rigorous experimentation proves the efficacy of our algorithm and brings important insights into the dynamics of the system

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: none
Teacher disagreement score0.890
Threshold uncertainty score0.553

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.0000.000
Scholarly communication0.0000.000
Open science0.0000.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.017
GPT teacher head0.255
Teacher spread0.237 · 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