| |
| | The Effects of Latency, Occupancy, and Bandwidth in Distributed Shared Memory Multiprocessors |
 | | Latency can be hidden by various techniques, all of which exploit the availability of additional bandwidth and require that the processor allows multiple outstanding references. |
 | | We define communication latency as the round-trip latency, assuming no contention, for a remote miss that is satisfied by the main memory of the home node (computed as 2l+4o+6k in Section 2). |
 | | Note that the bandwidth numbers in Table 4.1 are moderate, and in all cases are much less than our node-to-network bandwidth of 400 MB/s (even with burstiness, we find network bandwidth not to be a bottleneck, as mentioned earlier). |
| www-flash.stanford.edu /architecture/papers/dsm (9662 words) |
|