The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - April (1991 vol.2)
pp: 253-256
ABSTRACT
<p>A method for analyzing the lengths of memory queues when the network is conflict-free isdescribed. An algorithm based on this method is shown to efficiently determine the upperand lower bounds of the queue length. Analysis indicates that the strategy of usinghashing to spread data across memory modules is a good one. Results show that if thesize of the system is increased while maintaining a constant ratio of numbers ofprocessors to memories, then, asymptotically, the slowdown in performance from conflictsat the memory modules is Theta (log m/log log m). For m and n less than 100000 andlambda between 0.25 and 4.0, the graphical data confirm this growth rate.</p>
INDEX TERMS
Index Termsshared memory; parallel computer; memory queues; conflict-free; queue length; hashing;file organisation; parallel architectures; performance evaluation
CITATION
K. Donovan, "Performance of Shared Memory in a Parallel Computer", IEEE Transactions on Parallel & Distributed Systems, vol.2, no. 2, pp. 253-256, April 1991, doi:10.1109/71.89070
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool