Title
Reducing PE/Memory Traffic in Multiprocessors by the Difference Coding of Memory Addresses
Document Type
Article
Publication Date
1-1-1994
Abstract
A method of reducing the volume of data flowing through the network in a shared memory parallel computer (multiprocessor) is described. The reduction is achieved by difference coding the memory addresses in messages sent between processing elements (PE’s) and memories. In an implementation, each PE would store the last address sent to each memory, and vice versa. Messages that would normally contain an address instead contain the difference between the address associated with the current and most recent messages. Trace-driven simulation shows that only 70% or less of traffic volume (including data and overhead) is necessary, even in systems using coherent caches. The reduction in traffic could result in a lower cost or lower latency network. The cost of the hardware to achieve this is small, and the delay added is insignificant compared to network latency. © 1994 IEEE
Publication Source (Journal or Book title)
IEEE Transactions on Parallel and Distributed Systems
First Page
1156
Last Page
1168
Recommended Citation
Koppelman, D. (1994). Reducing PE/Memory Traffic in Multiprocessors by the Difference Coding of Memory Addresses. IEEE Transactions on Parallel and Distributed Systems, 5 (11), 1156-1168. https://doi.org/10.1109/71.329672