|
|
|
|
|
|
|
3. Design a SECDED (Hamming type) coding scheme for a memory with data word size of 18 bits. Show placement of each check bit and give logic equations for its action. |
|
|
|
|
|
|
|
|
4. A pipelined processor has a peak performance of 40 MIPS (decoding one instruction per cycle). It creates 0.90 instruction references/instr, 0.30 data reads, and 0.10 data writes per instruction. The memory system has: |
|
|
|
 |
|
|
|
|
Suppose it is possible to partition memory so that instruction references go to instruction memory and data references go to data memory. No cache is used. |
|
|
|
 |
|
|
|
|
Using the open-queue model, compute: |
|
|
|
 |
|
|
|
|
(a) The allocation of modules to instruction and data. |
|
|
|
 |
|
|
|
|
(b) Effective Tw per reference (overall). |
|
|
|
 |
|
|
|
|
(c) Queue size. |
|
|
|
 |
|
|
|
|
(d) Comparison to a single integrated (I and D) memory system (select m, a power of 2) using the same model. |
|
|
|
|
|
|
|
|
5. Suppose two processors (in a multiprocessor system) make a total of exactly two references to memory every memory cycle (Tc = 100 ns). The memory consists of eight low-order interleaved memory modules with Taccess = 120 ns. Find: |
|
|
|
 |
|
|
|
|
(a) Expected waiting time (Tw). |
|
|
|
 |
|
|
|
|
(b) Total access time. |
|
|
|
 |
|
|
|
|
(c) Mean total number of queued (waiting) requests. |
|
|
|
 |
|
|
|
|
(d) Offered memory bandwidth (references/sec). |
|
|
|
 |
|
|
|
|
(e) Achieved memory bandwidth (references/sec) according to above model. |
|
|
|
 |
|
|
|
|
(f) Achieved memory bandwidth using Strecker's model. |
|
|
|
|
|
|
|
|
6. The processor defined in problem 4 now uses an integrated memory system of eight modules. |
|
|
|
 |
|
|
|
|
Compare performance (B, Bw, Qt, and Tw) projections based on: |
|
|
|
 |
|
|
|
|
(a) Hellerman's model. |
|
|
|
 |
|
|
|
|
(b) Strecker's model. |
|
|
|
 |
|
|
|
|
(c) Open-queue model. |
|
|
|
 |
|
|
|
|
(d) Simple closed binomial model. |
|
|
|
 |
|
|
|
|
Compute achieved bandwidth, buffer size, and Tw for each; state all assumptions. |
|
|
|
|
|
|
|
|
7. Evaluate the processor defined in problem 4 with single integrated memory and m = 8, using the d-binomial model. Find the achieved processor performance. |
|
|
|
|
|