Workgreen2011

On the power of (even a little) centralization in distributed processing

35 citations0/0 files storedACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS)

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Distributed and Parallel Computing Systems Optimization and Search Problems

Abstract

We propose and analyze a multi-server model that captures a performance trade-off between centralized and distributed processing. In our model, a fraction p of an available resource is deployed in a centralized manner (e.g., to serve a most loaded station) while the remaining fraction 1-p is allocated to local servers that can only serve requests addressed specifically to their respective stations.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 35 citations exist upstream.

References

2001The power of two choices in randomized load balancing 1998State space collapse with application to heavy traffic limits for multiclass queueing networks 1978A Basic Dynamic Routing Problem and Diffusion 2010Randomized load balancing with general service time distributions

Cited by

2018Size expansions of mean field approximation: Transient and steady-state analysis 2013The Supermarket Game 2013The supermarket game 2019A little redundancy goes a long way: Convexity in redundancy systems 2013Partial Flexibility in Routeing and Scheduling

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.