This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Performance of Shared Memory in a Parallel Computer
April 1991 (vol. 2 no. 2)
pp. 253-256

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.

[1] K. Donovan, "Performance of shared memory in a parallel computer," Tech. Rep. 498, Dep. Comput. Sci., New York University, 1990.
[2] P. Flajolet, "On the performance evaluation of extendible hashing and trie searching,"Acta Informatica, vol. 20, pp. 345-369, 1983.
[3] G. H. Gonnet, "Expected length of the longest probe sequence in hash code searching,"J. ACM, vol. 28, no. 2, pp. 289-304, Apr. 1981.

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 and Distributed Systems, vol. 2, no. 2, pp. 253-256, April 1991, doi:10.1109/71.89070
Usage of this product signifies your acceptance of the Terms of Use.