1. Using figure illustrate how address mapping takes place in a virtual memory u
ID: 3577871 • Letter: 1
Question
1. Using figure illustrate how address mapping takes place in a virtual memory using page table based the information given below:
a. 32-bit virtual address
b. 26-bit physical address
c. 2KB page
d. Byte addressable memory
e. 32-bit words
2. Repeat problem 2 if a 16-entry TLB is added for fast translation.
3. Using figure illustrate interactions among page table, TLB, and cache when cache mapping is done using the physical address. Assume:
a. 32-bit virtual address
b. 26-bit physical address
c. 2BB page
d. Byte addressable memory
e. 32-bit words
f. 16-entry fully-associative TLB
g. 2-way set associative cache with 32 8-word blocks.
4. How is speedup computed for a parallel system using Amdahl’s law?
5. Using figures illustrate shared memory and message passing multiprocessors. Describe their differences.
6. What are the difficulties of parallel programming?
Explanation / Answer
4)
The time taken by program to execute is referred as speed up. It is calculated by diving time taken for a program to execute on serial (single processor) with time taken by program to execute in parallel (i.e. with multiple processor)
Speedup = T(1)/Ti
where i is number of processors.
5) Difficulties faced in parallel programing are like some of the problems do not have such algorithm which can work efficiently in parallel programming without complicating computations. Another challenge is some of the problems do have algorithms but stability is quite doubtful and the third challenge occurs when there are algorithms with high level of parallelism and have significant amount of data then challenge becomes how to engineer them to achieve good amount of stability.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.