scispace - formally typeset
Open AccessBook

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

Reads0
Chats0
TLDR
Tackling the questions that systems designers care about, this book brings queueing theory decisively back to computer science and helps readers acquire the skills needed to model, analyze, and design large-scale systems with good performance and low cost.
Abstract
Computer systems design is full of conundrums: Given a choice between a single machine with speed s, or n machines each with speed s/n, which should we choose? If both the arrival rate and service rate double, will the mean response time stay the same? Should systems really aim to balance load, or is this a convenient myth? If a scheduling policy favors one set of jobs, does it necessarily hurt some other jobs, or are these "conservation laws" being misinterpreted? Do greedy, shortest-delay, routing strategies make sense in a server farm, or is what's good for the individual disastrous for the system as a whole? How do high job size variability and heavy-tailed workloads affect the choice of a scheduling policy? How should one trade off energy and delay in designing a computer system? If 12 servers are needed to meet delay guarantees when the arrival rate is 9 jobs/sec, will we need 12,000 servers when the arrival rate is 9,000 jobs/sec? Tackling the questions that systems designers care about, this book brings queueing theory decisively back to computer science. The book is written with computer scientists and engineers in mind and is full of examples from computer systems, as well as manufacturing and operations research. Fun and readable, the book is highly approachable, even for undergraduates, while still being thoroughly rigorous and also covering a much wider span of topics than many queueing books. Readers benefit from a lively mix of motivation and intuition, with illustrations, examples, and more than 300 exercises - all while acquiring the skills needed to model, analyze, and design large-scale systems with good performance and low cost. The exercises are an important feature, teaching research-level counterintuitive lessons in the design of computer systems. The goal is to train readers not only to customize existing analyses but also to invent their own.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Path ORAM: an extremely simple oblivious RAM protocol

TL;DR: Path ORAM as discussed by the authors is the most practical oblivious RAM protocol for small client storage known to date, which requires log 2 N / log X bandwidth overhead for block size B = X log N. Path ORAM has been adopted in the design of secure processors since its proposal.
Journal ArticleDOI

Path ORAM: An Extremely Simple Oblivious RAM Protocol

TL;DR: It is formally proved that Path ORAM has a O(log N) bandwidth cost for blocks of size B = Ω (log2 N) bits, and is asymptotically better than the best-known ORAM schemes with small client storage.
Journal ArticleDOI

On the Delay-Storage Trade-Off in Content Download from Coded Distributed Storage Systems

TL;DR: This work uses a novel fork-join queueing framework to model multiple users requesting the content simultaneously, and derive bounds on the expected download time, demonstrating the fundamental trade-off between the expected downloading time and the amount of storage space.
Journal ArticleDOI

A Tutorial on Ultrareliable and Low-Latency Communications in 6G: Integrating Domain Knowledge Into Deep Learning

TL;DR: In this paper, the authors discuss the potential of applying supervised/unsupervised deep learning and deep reinforcement learning in ultrareliable and low-latency communications (URLLCs) in future 6G networks.
Posted Content

Circuit ORAM: On Tightness of the Goldreich-Ostrovsky Lower Bound.

TL;DR: The proposed new tree-based ORAM scheme, Circuit ORAM, achieves (almost) optimal circuit size both in theory and in practice for realistic choices of block sizes and is an ideal candidate for secure multi-party computation applications.