Performance Modeling and Design of Computer Systems: Queueing Theory in Action

By Mor Harchol-Balter. 2013

621 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/30cb8a4d51fa78eec1bec3db9f53bffca403df12

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Borg: the next generation (2020, unknown): “The (relatively) straight lines on the log-log scale in Figure 12 tell us that resource-hour consumption has a power-law distribution; specifically, it is Pareto(α) distributed [18]:”
A Tutorial on Ultrareliable and Low-Latency Communications in 6G: Integrating Domain Knowledge Into Deep Learning (2021, methodology): “To analyze the performance of a wireless network, a variety of theoretical tools have been developed in the existing literature [24], [25].”
Rateless codes for near-perfect load balancing in distributed matrix-vector multiplication (2018, methodology): “Then we simply apply the PollaczekKhinchine formula [25] for the mean response time of M/G/1 queues.”
Algorithms with predictions (2020, background): “rade-os between these two concepts in the context of ski-rental and online scheduling. A good general reference for queueing theory, including derivations for SJF and SRPT with exact information, is Harchol-Balter (2013). In scheduling for queues, some works have looked at the eects of using impreci”
Path ORAM: an extremely simple oblivious RAM protocol (2012, unknown): “It is well-known that if a stochastic process is regenerative (empirically verified to be the case for Path ORAM), the time average over a single run is equivalent to the ensemble average over multiple runs (see Chapter 5 of [19]).”
On the Delay-Storage Trade-Off in Content Download from Coded Distributed Storage Systems (2013, background): “Our approach of immediate dispatching of requests to local queues is used by most server farms to facilitate fast acknowledgement response to customers [20].”
Spatio-Temporal Analysis for SINR Coverage in Small Cell Networks (2019, unknown): “The active probability in the steady state then follows from the Little’s law [37].”
Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound (2015, background): “This methodology is well-founded, since it is well-known that if a stochastic process is regenerative, the time average over a single run is equivalent to the ensemble average over multiple runs (see Chapter 5 of HarcholBalter [26]).”