C H A P T E R 2 4
A
d
v
a
n
c
e
d
A
pp
li
c
a
t
i
o
n
D
e
v
e
l
o
p
m
e
n
t
E
x
e
r
c
i
s
e
s
24.1 Benchmarking: Suppose a system runs transaction type A at 50 transactions per
second (tps), and type B at 10 tps.
a. Given an equal mix of
transactions
of each type, what is the
effective
through– put
of the system (in tps), assuming a single CPU, all data is memory resi– dent, and
24.2 Show pictorially how a database can be modeled as a queueing system and
explain under what circumstances it is appropriate to use the queueing model.