This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Scaling Parallel Programs for Multiprocessors: Methodology and Examples
July 1993 (vol. 26 no. 7)
pp. 42-50

Models for the constraints under which an application should be scaled, including constant problem-size scaling, memory-constrained scaling, and time-constrained scaling, are reviewed. A realistic method is described that scales all relevant parameters under considerations imposed by the application domain. This method leads to different conclusions about the effectiveness and design of large multiprocessors than the naive practice of scaling only the data set size. The primary example application is a simulation of galaxies using the Barnes-Hut hierarchical N-body method.

Citation:
Jaswinder Pal Singh, John L. Hennessy, Anoop Gupta, "Scaling Parallel Programs for Multiprocessors: Methodology and Examples," Computer, vol. 26, no. 7, pp. 42-50, July 1993, doi:10.1109/MC.1993.274941
Usage of this product signifies your acceptance of the Terms of Use.