Hi
First edition questions are:
1. Tanenbaum, Chapter 1, Exercises 1, 9, 11, 14, 15, 18, 19.
2. Tanenbaum, Chapter 2, Exercises 3, 4, 9, 15, 16, 19, 21, 22,
23, 24.
3. Tanenbaum, Chapter 3, Exercises 1, 2, 7, 9, 11, 12, 15, 17, 18,
20, 21, 23, 24.
Equivalent 2nd ed questions are: 1st edition numbers are in brackets
Chpt 1
(1) see question 2,
(9)A multicomputer with 256 CPUs is organised as a 16 x 16 grid. What is the worst case delay(in hops) that a message might have to take?
(11)What is the difference between a distributed operating system and a network operating system?
(14)What is the reason for devloping distributed shared memory systems? What do you see as the main problem hindering efficient implementations?
(15) Explain what false sharing is in distributed shared memory systems. What possible solutions do you see.
(18)What is the difference between a vertical distribution and horizontal distribution?
(19) consider a chain of processes P1, P2, .. Pn implementing a multitierd client-server architecture. Process Pi is client of process Pi+1 and Pi will return a reply to Pi-1 only when receiving a reply from Pi+1. what are the main problems with this organisation when taking alook at the request-reply performance at Process P1?
Chapter2 in 1st edition = chapter 4 in 2nd edition
(3) questions same in both eds
(4) questions same in both eds
(9) Give an example implementation of an object reference that allows a client to bind to a transient remote object
(15) see question 12 in 2nd edition
(16) see question 13 in 2nd edition
(19) look at question 16 in second edition, just change WebSpher to IBM MQSeries
(21) see q 17 in 2nd ed
(22) see q 18 in 2nd ed
(23) see q 19 in 2nd ed
(24) see q 21 in 2nd ed
see next message for chpt 3 questions as my internet connection is going wonky