in Others edited by
398 views
0 votes
0 votes

Consider a memory system having address spaced at a distance of $m, T=$ Bank cycle time and $n$ number of banks, then the average data access time per word access in synchronous organization is

  1. $ t=\left\{\begin{array}{l} m, \frac{T}{n} \text { for } m\ll n \\ T \text { for } m \gg n \end{array}\right.$   
  2. $ t=\left\{\begin{array}{l} T / n \text { for } m\ll n \\ T \text { for } m\gg n \end{array}\right. $ 
  3. $ t=\left\{\begin{array}{l} m . T \text { for } m \ll n \\ T \text { for } m \gg n \end{array}\right. $
  4. $ t=\left\{\begin{array}{l} m \cdot T \text { for } m \ll n \\ m / T \text { for } m\gg n \end{array}\right. $
in Others edited by
by
398 views

1 Answer

0 votes
0 votes
  • When the distance at which address is spaced is very less than the number of banks, that is, m << n, then the average data access time per word access is - m ⋅ T n

  • • When the distance at which address is spaced is much more than the number of banks, that is, m >> n, then the average data access time per word access is - T

  • • Combining above two points, we get the average data access time per word access in m ⋅ Tn for m << n synchronous organisation as Option 1

by

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true