MétaCan
Menu
Back to cohort
Record W2406521162

Multitenancy benefits in application servers

2015· article· en· W2406521162 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

VenueComputer Science and Software Engineering · 2015
Typearticle
Languageen
FieldComputer Science
TopicCloud Computing and Resource Management
Canadian institutionsIBM (Canada)University of New Brunswick
Fundersnot available
KeywordsComputer scienceServerMemory footprintCloud computingJavaOperating systemService (business)Application serverSoftwareFootprintShared resourceResource (disambiguation)Distributed computingComputer network
DOInot available

Abstract

fetched live from OpenAlex

Multitenancy enables sharing of resources between different users, also known as tenants and is a backbone feature of cloud computing. The tenants execute their code as if resources were held individually by them. The sharing is transparent; the tenants are isolated from each other and one tenant is not allowed to affect the performance of the rest by overusing a resource. We propose a theoretical model to describe and predict memory footprint reductions by different levels of multitenancy in application servers, including our multitenancy level, which enables even further sharing, acting as an Application-Server-as-a-Service (ASaaS). We confirm our model by implementing a small custom application server in Java and measuring its footprint for different multitenancy levels. We find that our ASaaS approach requires up to 65% less memory without any major response time overheads. Finally, we perform an analysis of potential memory sharing on an enterprise software stack between different levels of multitenancy, including our proposed ASaaS level, and the results support our findings.

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.001
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.490
Threshold uncertainty score0.415

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.001
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.201
Teacher spread0.189 · 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