Author:
Bianco Mauro,Pucci Geppino
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. D. Bailey, E. Barszcz, J.T. Barton, tet al. The NAS parallel benchmarks. Int. J. Supercomputer Appl., 5(3):63–73, 1991.
2. K.E. Batcher. Sorting networks and their applications. In Proc. of the AFIPS Spring Joint Computer Conf., pages 307–314, 1968.
3. O. Bonorden, B. Juurlink, I. von Otte, and I Rieping. The Paderborn university BSP (PUB) Library-Design, Implementation and Performance In Proc. of the 2nd merged IPPS/SPDP Symp., pages 99–104, San Juan, Puerto Rico, April 1999.
4. G. Blelloch, C.E. Leiserson, B.M. Maggs, et al. A comparison of sorting algorithms for the connection machine CM-2. In Proc. of the 3rd ACM Symp. on Parallel Algorithms and Architectures, pages 3–16, Hilton Head SC, USA, 1991.
5. G. Bilardi, A. Pietracaprina, and G. Pucci. A quantitative measure of portability with application to bandwidth-latency models for parallel computing. In Proc. EURO-PAR’99-Parallel Processing, pages 543–551, Toulouse, F, Aug./Sep 1999.