Question
Consider a main memory system that consists of 8 memory modules attached to the system bus, which is one word wide. When a write request is made, the bus is occupied for 100 nanoseconds (ns) by the data, address, and control signals. During the same 100 ns, and for 500 ns thereafter, the addressed memory module executes one cycle accepting and storing the data. The (internal) operation of different memory modules may overlap in time, but only one request can be on the bus at any time. The maximum number of stores (of one word each) that can be initiated in 1 millisecond is _____.
Official answer and solution
- Official answer
- 10000
- From
- Official GATE 2014 answer key
Solution
Determine the limiting bottleneck between the system bus transmission time and the interleaved memory module cycle time.
-
Timing Parameters:
- Bus occupancy per write request = ns.
- Module cycle time per write = ns (with bus) ns (thereafter) = ns total.
- Total number of memory modules = .
-
Bottleneck Analysis:
- During the ns that one memory module is busy completing a store, the system bus is only occupied for the first ns.
- The bus is free for the remaining ns and can initiate stores to other available memory modules.
- In ns, the bus can initiate:
- Since there are modules available and , the memory modules do NOT saturate or stall the bus.
- Therefore, the system bus is the sole throughput bottleneck.
-
Maximum Initiations in 1 ms:
- The bus can initiate a new store every ns continuously.
- Time duration = .
- Maximum number of stores initiated:
10000
Assuming the module cycle time of 600 ns constrains the initiation rate; because memory is 8-way interleaved, module operations overlap completely.
The answer is the one in the official GATE answer key. The solution is this site's own explanation.
Source
- Paper
- GATE 2014 Computer Science and Information Technology (CS) Session 2
- Question
- 65 of 65, printed as CS Q.55
- Section
- Computer Science and Information Technology
Report an error in this question
GATE questions are the work of the organising institutes. This site is independent and is not affiliated with them.