Performance Modeling and Design of Computer Systems Queueing Theory in Action

ISBN-10: 1107027500
ISBN-13: 9781107027503
Edition: 2012
List price: $57.00 Buy it from $30.36
eBook available
This item qualifies for FREE shipping

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

New Starting from $83.13
eBooks Starting from $68.00
Buy
what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!
You could win $10,000

Get an entry for every item you buy, rent, or sell.

Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
Italian Grammar Online content $4.95 $1.99
Add to cart
Study Briefs
Portuguese Grammar Online content $4.95 $1.99
Add to cart
Study Briefs
Spanish Grammar Online content $4.95 $1.99
Add to cart
Study Briefs
German Grammar Online content $4.95 $1.99

Customers also bought

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $57.00
Copyright year: 2012
Publisher: Cambridge University Press
Publication date: 2/18/2013
Binding: Hardcover
Pages: 576
Size: 7.09" wide x 10.24" long x 1.18" tall
Weight: 2.2
Language: English

Mor Harchol-Balter is an Associate Professor in the Computer Science Department at Carnegie Mellon University. She is a recipient of the McCandless Chair, the NSF CAREER award, the NSF Postdoctoral Fellowship in the Mathematical Sciences, multiple best paper awards, and several teaching awards, including the Herbert A. Simon Award for Teaching Excellence and the campus-wide Teaching Effectiveness Award. She is a leader in the ACM SIGMETRICS/Performance community, for which she recently served as Technical Program Chair, and has served on the Technical Program Committee twelve times. Harchol-Balter's work integrates queueing theoretic analysis with low-level computer systems implementation. Her research is on designing new resource allocation policies (load balancing policies, power management policies, and scheduling policies) for server farms and distributed systems in general, where she emphasizes integrating measured workload distributions into the problem solution.

Introduction to Queueing
Motivating examples
Queueing theory terminology
Necessary Probability Background
Probability review
Generating random variables
Sample paths, convergence, and averages
The Predictive Power of Simple Operational Laws: 'What If' Questions and Answers
Operational laws
Modification analysis
From Markov Chains to Simple Queues
Discrete-time Markov Chains
Ergodicity theory
Real-world examples: Google, Aloha
Generating functions for Markov Chains
Exponential distributions and Poisson Process
Transition to continuous-time Markov Chains
M/M/1 and PASTA
Server Farms and Networks: Multi-server, Multi-queue Systems
Server farms: M/M/k and M/M/k/k
Capacity provisioning for server farms
Time-reversibility and Burke's Theorem
Jackson network of queues
Classed network of queues
Closed networks of queues
Real-World Workloads: High-Variability and Heavy Tails
Tales of tails: real-world workloads
Phase-type workloads and matrix-analytic
Networks of time-sharing (PS) servers
M/G/I queue and inspection paradox
Task assignment for server farms
Transform analysis
M/G/I transform analysis
Power optimization application
Smart Scheduling
Performance metrics
Non-preemptive, non-size-based policies
Preemptive, non-size-based policies
Non-preemptive, size-based policies
Preemptive, size-based policies
Scheduling: SRPT and fairness

×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×