DOC PREVIEW
UCD ECS 201A - ECS 201A Midterm Exam

This preview shows page 1-2-3 out of 8 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 8 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 8 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 8 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 8 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

1. True or False:(1) Semiconductor memory will not replace magnetic disks in desktop and server computersystems in the near future.(1) Computer systems achieve 99.999% availability ("fivenines"), as advertised.(1) Computer components fail suddenly,with little warning.(1) Amdahl’slaw applies to parallel computers.(1) You can predict cache performance of Program A by analyzing Program B.(1) Linear speedups are needed to makemultiprocessors cost-effective.(1) Scalability is almost free.2. (3) What is the goal of the memory heirarchy? What twoprinciples makeitwork?3. (10) What do the following acronyms stand for:SMT SMP MTTF SRAMCOMA ATM RAID DIMMNUMA MPP DSM ROMCMP WAN TLB CDMIMD SIMD DDR SDRAM PCI-1-Short Answers:4. (3) What is false sharing?5. (3) What is a cluster?6. (3) What is the difference between connection-oriented and connectionless communication?7. (3) Give three techniques used to reduce cache hit time.-2-8. (4) Explain the interaction between prefetching and increased block size in instruction caches.9. (4) What is Cache Coherence, and whyisitnecessary?10. (4) What is a victim cache, and howdoes it work?-3-11. (4) Briefly describe interleavedmemory and howitworks.12. (4) Describe the difference between shared memory and message passing machines. Includethe impact on design, cost, speed, and programming model.-4-13. (12) Giventhe following data:Hit time for direct-mapped L2 cache = 10 clock cyclesLocal miss rate for direct-mapped L2 cache = 25%Local miss rate for 2-way set associateive L2cache = 20%Miss penalty for L2 cache = 100 clock cyclesWhat is the impact of second-levelcache associativity on the miss penalty?-5-14. (12) Assume that an L2 cache has a block size four times that of an L1. Showhow a miss foran address that causes a replacement in L1 and L2 can lead to a violation of the inclusion prop-erty.-6-15. (12) Givenadisk with the following parameters:Av e rage seek time = 5msTransfer rate = 40MB/secRotation speed = 10,000 RPMController overhead = 0.1msAssuming there is no queueing delay,what is the average time to read or write a 512-byte sector?What is the time assuming the average seek time is 3 times that of the measured seek time?-7-16. (12) In this question you are to calculate the time to transfer 1000GB of data using 25 8mmtapes via an overnight delivery service, vs sending the data by FTP overthe internet. Makethefollowing 4 assumptions:The tapes are picked up at 4PM Pacific time and delivered 3000 miles awayat10AMEastern time (7AM Pacific)On electronic route A the slowest link is a T3 line, which transfers at 45M bits/secOn electronic route B the slowest link is a 100M bit/sec EthernetYoucan use half of the capacity of the slowest link between the twositesHowlong does it taketoelectronically transfer the information via route A?Route B?Using Overnight


View Full Document

UCD ECS 201A - ECS 201A Midterm Exam

Download ECS 201A Midterm Exam
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view ECS 201A Midterm Exam and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view ECS 201A Midterm Exam 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?