The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (1992 vol.41)
pp: 1420-1429
ABSTRACT
<p>A cost-effective combining structure to alleviate hot-spot contention is proposed. The key idea is that the combining function is separated from the routing function, so that a binary tree-based combining configuration becomes feasible. The combining element for realizing the new structure has only one wait buffer and one combining logic, involving less hardware than the element used in earlier combining networks. More importantly, the number of constituent combining elements in such a structure with size N is reduced to O(1/log/sub 2/ N) of that required in the previous design. The proposed combining structure in conjunction with a regular multistage interconnection network can remove hot-spot contention effectively in any sized system at a considerably lower cost, and appears readily suitable for use in some applications.</p>
INDEX TERMS
large-scale shared-memory multiprocessors; cost-effective combining structure; hot-spot contention; binary tree-based combining; multistage interconnection network; multiprocessor interconnection networks; shared memory systems.
CITATION
N.-F. Tzeng, "A Cost-Effective Combining Structure for Large-Scale Shared-Memory Multiprocessors", IEEE Transactions on Computers, vol.41, no. 11, pp. 1420-1429, November 1992, doi:10.1109/12.177312
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool