Mor Harchol-Balter’s Followers

None yet.

Mor Harchol-Balter

Combine Editions
Mor Harchol-Balter’s books

Average rating: 4.47 · 38 ratings · 3 reviews · 6 distinct works

	Performance Modeling and Design of Computer Systems: Queueing Theory in Action 4.57 avg rating — 35 ratings — published 2012 — 6 editions	Error rating book. Refresh and try again. Rate this book Clear rating 1 of 5 stars 2 of 5 stars 3 of 5 stars 4 of 5 stars 5 of 5 stars
	Introduction to Probability for Computing 3.33 avg rating — 3 ratings — 2 editions	Error rating book. Refresh and try again. Rate this book Clear rating 1 of 5 stars 2 of 5 stars 3 of 5 stars 4 of 5 stars 5 of 5 stars
	Task assignment with unknown duration 0.00 avg rating — 0 ratings	Error rating book. Refresh and try again. Rate this book Clear rating 1 of 5 stars 2 of 5 stars 3 of 5 stars 4 of 5 stars 5 of 5 stars
	Implementation of SRPT Scheduling in Web Servers 0.00 avg rating — 0 ratings	Error rating book. Refresh and try again. Rate this book Clear rating 1 of 5 stars 2 of 5 stars 3 of 5 stars 4 of 5 stars 5 of 5 stars
	In network of queues, M/M/1 can outperform M/D/1 0.00 avg rating — 0 ratings	Error rating book. Refresh and try again. Rate this book Clear rating 1 of 5 stars 2 of 5 stars 3 of 5 stars 4 of 5 stars 5 of 5 stars
	Implementation of SRPT scheduling in Web servers 0.00 avg rating — 0 ratings	Error rating book. Refresh and try again. Rate this book Clear rating 1 of 5 stars 2 of 5 stars 3 of 5 stars 4 of 5 stars 5 of 5 stars

More books by Mor Harchol-Balter…

Quotes by Mor Harchol-Balter (?)

“There is an easy way to remember the formula for Pblock by relating it to the Poisson distribution. Can you see what it is?”
― Mor Harchol-Balter, Performance Modeling and Design of Computer Systems: Queueing Theory in Action

1 likes

“A CTMC is a stochastic process with the property that every time it enters state i, the following hold: 1. The amount of time the process spends in state i before making a transition is Exponentially distributed with some rate (call it νi). 2. When the process leaves state i, it will next enter state j with some probability (call it pij) independent of the time spent at state i.”
― Mor Harchol-Balter, Performance Modeling and Design of Computer Systems: Queueing Theory in Action

0 likes

“Every time that the system empties (0 jobs), the process starts anew in state 0. We call this a “restart.” In a positive recurrent system, the system empties infinitely often.”
― Mor Harchol-Balter, Performance Modeling and Design of Computer Systems: Queueing Theory in Action

0 likes

See all Mor Harchol-Balter's quotes »

Is this you? Let us know. If not, help out and invite Mor to Goodreads.