M.Morris Mano Book Solution

Hi All,
I am a student of Advance Computer Architecute.We are studying M.Morris Mano's book Computer System Architecture.Can i get this books exercise Questions solution.Please let me know if anyone can help me.I am facing a problem in solving some of the numericals and for that i need its solution.Thanks.

I need the solutions of chapter 9 which is Pipeline and vector processing and of chapter Twelve Memory Organization...I heard it from someone long time ago that solved exercises of these well known books are mostly available on net.I tried to search it but didnt find any.So i thought someone here could help me.

q:the access time of cache memory is 100 ns and that of main memory
1000 ns. it is estimated that 80% of the memory requests are for read
and the remaining 20% for write. the hit ratio for read access only is
0.9. a write -through procedure is used.
a- what is the average access time of the system considring only
memory read cycles?
b-what is the average access time of the system for both read asn
write requests?
c-what is the hit ratio taking into consideration the write cycles?
please, we are appreciating any response .

Sometimes I find questions like this easier to work through if I use actual numbers. So let's say there are 100 memory accesses. How many read and how many write will there be (this is easy)? How long will a single read take, if it comes from cache? How long will a single read take if it comes from main memory? How long will a write take? Now add them all up to produce a time for the 100 memory accesses. Then divide by the number of accesses and that should give you the answer you're looking for (for b. a is of course easier than that.)

c also sounds easy, what's the problem? Do you know how to calculate hit ratios? Let's say I'm playing darts and I throw 10 darts and 4 hit the board (that would be doing well for me). What would my hit ratio be? Do you get 0.4?

Sometimes I find questions like this easier to work through if I use actual numbers. So let's say there are 100 memory accesses. How many read and how many write will there be (this is easy)? How long will a single read take, if it comes from cache? How long will a single read take if it comes from main memory? How long will a write take? Now add them all up to produce a time for the 100 memory accesses. Then divide by the number of accesses and that should give you the answer you're looking for (for b. a is of course easier than that.)

c also sounds easy, what's the problem? Do you know how to calculate hit ratios? Let's say I'm playing darts and I throw 10 darts and 4 hit the board (that would be doing well for me). What would my hit ratio be? Do you get 0.4?

thanks
you are on a right, a is simple. but regarding b isn't.
because in this case ,we should consider write operation too. so, it must be there hit ratio for write as for read,but in question there isn't hit ratio for write .
of course, I know how to calculate hit ratio. it is hit\ miss +hit.
please tell me ,how I can know the no. of hits and no. of misses?
I can't guess what hit ratio as you did with your darts.
I think, the author supposed that mention of hit ration for write it isn't necessary , because the write through policy is depended here.
because of in both miss and hit there is access to memory.
im not sure .
I hope to get more comments from you.