411 research outputs found
Asymptotically optimal load balancing in large-scale heterogeneous systems with multiple dispatchers
We consider the load balancing problem in large-scale heterogeneous systems with multiple dispatchers. We introduce a general framework called Local-Estimation-Driven (LED). Under this framework, each dispatcher keeps local (possibly outdated) estimates of the queue lengths for all the servers, and the dispatching decision is made purely based on these local estimates. The local estimates are updated via infrequent communications between dispatchers and servers. We derive sufficient conditions for LED policies to achieve throughput optimality and delay optimality in heavy-traffic, respectively. These conditions directly imply delay optimality for many previous local-memory based policies in heavy traffic. Moreover, the results enable us to design new delay optimal policies for heterogeneous systems with multiple dispatchers. Finally, the heavy-traffic delay optimality of the LED framework also sheds light on a recent open question on how to design optimal load balancing schemes using delayed information
The Empirical Implications of Privacy-Aware Choice
This paper initiates the study of the testable implications of choice data in
settings where agents have privacy preferences. We adapt the standard
conceptualization of consumer choice theory to a situation where the consumer
is aware of, and has preferences over, the information revealed by her choices.
The main message of the paper is that little can be inferred about consumers'
preferences once we introduce the possibility that the consumer has concerns
about privacy. This holds even when consumers' privacy preferences are assumed
to be monotonic and separable. This motivates the consideration of stronger
assumptions and, to that end, we introduce an additive model for privacy
preferences that does have testable implications
Scheduling for today’s computer systems: bridging theory and practice
Scheduling is a fundamental technique for improving performance in computer systems. From web servers
to routers to operating systems, how the bottleneck device is scheduled has an enormous impact on the performance of the system as a whole. Given the immense literature studying scheduling, it is easy to think that we already understand enough about scheduling. But, modern computer system designs have highlighted a number of disconnects between traditional analytic results and the needs of system designers.
In particular, the idealized policies, metrics, and models used by analytic researchers do not match the policies, metrics, and scenarios that appear in real systems.
The goal of this thesis is to take a step towards modernizing the theory of scheduling in order to provide
results that apply to today’s computer systems, and thus ease the burden on system designers. To accomplish
this goal, we provide new results that help to bridge each of the disconnects mentioned above. We will move beyond the study of idealized policies by introducing a new analytic framework where the focus is on scheduling heuristics and techniques rather than individual policies. By moving beyond the study of individual policies, our results apply to the complex hybrid policies that are often used in practice. For example, our results enable designers to understand how the policies that favor small job sizes are affected by the fact that real systems only have estimates of job sizes. In addition, we move beyond the study of mean response time
and provide results characterizing the distribution of response time and the fairness of scheduling policies.
These results allow us to understand how scheduling affects QoS guarantees and whether favoring small job sizes results in large job sizes being treated unfairly. Finally, we move beyond the simplified models traditionally used in scheduling research and provide results characterizing the effectiveness of scheduling in multiserver systems and when users are interactive. These results allow us to answer questions about the how to design multiserver systems and how to choose a workload generator when evaluating new scheduling designs
Generalizing Kronecker graphs in order to model searchable networks
This paper describes an extension to stochastic
Kronecker graphs that provides the special structure required
for searchability, by defining a “distance”-dependent Kronecker
operator. We show how this extension of Kronecker graphs
can generate several existing social network models, such as
the Watts-Strogatz small-world model and Kleinberg’s latticebased
model. We focus on a specific example of an expanding
hypercube, reminiscent of recently proposed social network
models based on a hidden hyperbolic metric space, and prove
that a greedy forwarding algorithm can find very short paths
of length O((log log n)^2) for graphs with n nodes
Distance-Dependent Kronecker Graphs for Modeling Social Networks
This paper focuses on a generalization of stochastic
Kronecker graphs, introducing a Kronecker-like operator and
defining a family of generator matrices H dependent on distances
between nodes in a specified graph embedding. We prove
that any lattice-based network model with sufficiently small
distance-dependent connection probability will have a Poisson
degree distribution and provide a general framework to prove
searchability for such a network. Using this framework, we focus
on a specific example of an expanding hypercube and discuss
the similarities and differences of such a model with recently
proposed network models based on a hidden metric space. We
also prove that a greedy forwarding algorithm can find very short
paths of length O((log log n)^2) on the hypercube with n nodes,
demonstrating that distance-dependent Kronecker graphs can
generate searchable network models
- …