A Cost Model for Communication on a Symmetric MultiProcessor

作者: Andrea Pietracaprina , Nancy M. Amato , Geppino Pucci , Lucia K. Dale , Jack Perdue

DOI:

关键词:

摘要: In this paper we conduct an in-depth study of the communication costs programs when run on a typical Symmetric MultiProcessor, SGI Power Challenge, characterized by powerful off-the-shelf microprocessors communicating through shared memory via shared-bus interconnect. Our is based extensive set experiments designed to assess relative impact number parameters cost accesses. We provide evidence that interaction with hierarchy affects in such substantial way none models previously considered literature can guarantee reasonable level accuracy since they do not take into account. then determine two prediction functions are very accurate predictors best and worst performance respect hierarchy. These interval be employed obtain lower upper bounds actual application, evaluate degree locality access patterns involved.

参考文章(17)
J.S. Huang, Y.C. Chow, Parallel sorting and data partitioning by sampling IEEE Computer Society Press,Silver Spring, MD. ,(1983)
Friedhelm Meyer auf der Heide, Armin Bäumker, Wolfgang Dittrich, Truly Efficient Parallel Algorithms: c-Optimal Multisearch for an Extension of the BSP Model (Extended Abstract) european symposium on algorithms. pp. 17- 30 ,(1995)
John L. Hennessy, David A. Patterson, Computer Architecture: A Quantitative Approach ,(1989)
Frank Dehne, Andreas Fabri, Andrew Rau-Chaplin, Scalable parallel geometric algorithms for coarse grained multicomputers Proceedings of the ninth annual symposium on Computational geometry - SCG '93. pp. 298- 307 ,(1993) , 10.1145/160985.161154
John H. Reif, Leslie G. Valiant, A logarithmic time sort for linear size networks Journal of the ACM. ,vol. 34, pp. 60- 76 ,(1987) , 10.1145/7531.7532
Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha, A comparison of sorting algorithms for the connection machine CM-2 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures - SPAA '91. pp. 3- 16 ,(1991) , 10.1145/113379.113380
Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran, Can shared-memory model serve as a bridging model for parallel computation? acm symposium on parallel algorithms and architectures. pp. 72- 83 ,(1997) , 10.1145/258492.258500
Jaswinder Pal Singh, Edward Rothberg, Anoop Gupta, Modeling communication in parallel algorithms Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures - SPAA '94. pp. 189- 199 ,(1994) , 10.1145/181014.181329
Gianfranco Bilardi, Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci, Paul Spirakis, BSP vs LogP acm symposium on parallel algorithms and architectures. pp. 25- 32 ,(1996) , 10.1145/237502.237504
W. D. Frazer, A. C. McKellar, Samplesort: A Sampling Approach to Minimal Storage Tree Sorting Journal of the ACM. ,vol. 17, pp. 496- 507 ,(1970) , 10.1145/321592.321600