MétaCan
Menu
Back to cohort
Record W2096684081 · doi:10.1109/icpp.2000.876130

Techniques for achieving high performance Web servers

2002· article· en· W2096684081 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 scienceServerBottleneckWeb serverServer farmWeb pageRound-robin DNSOperating systemStatic web pageLoad balancing (electrical power)File serverBandwidth (computing)Computer networkDistributed computingClient–server modelWorld Wide WebThe InternetEmbedded system

Abstract

fetched live from OpenAlex

With increasing bandwidth available to the client and the number of users growing at an exponential rate the Web server can become a performance bottleneck. This paper considers the parallelization of requests to Web pages each of which is composed of a number of embedded objects. The performance of systems in which the embedded objects are distributed across multiple backend servers are analyzed. Parallelization of Web requests gives rise to a significant improvement in performance. Replication of servers is observed to be beneficial especially when the embedded objects in a Web page are not evenly distributed across servers. Load balancing policies used by the dispatcher of Web page requests are investigated. A simple round robin policy for backend server selection gives a better performance compared to the default random policy used by the Apache server.

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: Empirical · Consensus signal: none
Teacher disagreement score0.867
Threshold uncertainty score0.356

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.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.021
GPT teacher head0.220
Teacher spread0.199 · 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