Coarse grained parallel computing on heterogeneous systems

Proceedings of the ACM Symposium on Applied Computing

Volumn 02-February-1998, Issue , 1998, Pages 628-634

  Morin, Pat ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

Bulk synchronous' parallel; Coarse grained multicomputer; Heterogeneous computing; Parallel algorithms

Indexed keywords

COMPUTATION THEORY; PARALLEL ALGORITHMS;

BULK SYNCHRONOUS' PARALLEL; COARSE-GRAINED PARALLELS; COMMUNICATION OPERATION; HETEROGENEOUS COMPUTING; HETEROGENEOUS SYSTEMS; MODEL OF COMPUTATION; MULTICOMPUTERS; NOCV1; TRADITIONAL APPROACHES;

COMPUTER SOFTWARE REUSABILITY;

EID: 85002170896     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/330560.331004     Document Type: Conference Paper

References (25)

1. D. Bader, D. Hellman, and J. JáJá. Parallel algorithms for personalized communication and sorting with an experimental study. In Proceedings of ACM Symposium on Parallel Algorithms and Architectures, pages 211-222, 1996.
2. A. Baumker, W. Dittrich, F. Meyer auf def Heide, and I. Rieping. Realistic parallel algorithms: Priority queue operations and selection for the BSP∗ model. In Proceedings of Euro-Par '96, pages 2729, 1996.
3. A. Beguelin, J. Dongarra, A. Geist, B. Manchek, and V. Sunderam. Solving computational grand challenges using a network of heterogeneous supercomputers. In Proceedings of the Fifth SIAM Conference on Parallel Processing for Scientific Computing, pages 596-601, 1991.
4. A. L. Cheung and A. P. Reeves. High performance computing on a cluster of workstations. In Proceedings of 1st International Symposium on High Performance Distributed Computing, pages 152-160, 1992.
5. M. Cierniak, W. Li, and M. J. Zaki. Loop scheduling for heterogeneity. In Proceedings of 4th International Symposium on High Performance Distributed Computing, 1995.
6. P. E. Crandall and M. J. Quinn. A decomposition advisory system for heterogeneous data-parallel processing. In Proceedings of 3rd International Symposium on High Performance Distributed Computing, pages 114-121, 1994.
7. D. Culler, R. Karp, D. Patterson, A. Sahay, K. E. Schauser, E. Snatos, R. Subramonian, and T. von Eicken. LogP: Towards a realistic model of parallel computation. In A CM Symposium on Principles and Practices of Parallel Programming, pages 112, 1993.
8. F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. Kokhar. A randomized parallel 3d convex hull algorithm for coarse grained multicomputers. In Proceedings of ACM Symposium on Parallel Algorithms and Architectures, pages 27-33, 1995.
9. F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable parallel computational geometry for coarse grained multicomputers. In Proceedings of ACM Symposium on Computational Geometry, pages 298-307, 1993.
10. A. Ferreira and S. Ubéda. Computing the medial axis transform with 8 scan operations. In IEEE International Conference on Image Processing, 1995.
11. A. V. Gerbessiotis and C. J. Siniolakis. Deterministic sorting and randomized median finding on the BSP model. In Proceedings of A CM Symposium on Parallel Algorithms and Architectures, 1996.
12. A. V. Gerbessiotis and C. J. Siniolakis. Selection on the bulk-synchronous parallel model with applications to priority queues. In Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA '96), 1996.
13. A. V. Gerbessiotis and L. Valiant. Direct bulk-synchronous parallel algorithms. In 3rd Scandinavian Workshop on Algorithm Theory, pages 1-18, 1992.
14. E. P. Markatos and T. J. LeBlanc. Using processor affinity in loop scheduling on shared-memory multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 5(4):379-400, April 1994.
15. Message Passing Interface Forum. MPI: A Message Passing Interface Standard, 1995.
16. P. Morin. The PLED A User's Guide. Carleton University, 1.0 edition, 1997.
17. S. Näher. The LEDA manual. Technical Report MPI-I-93-109, Max-Planck Institut für Informatik, 1993.
18. N. Nedeljkovic and M. J. Quinn. Data parallel programming on a network of heterogeneous workstations. Concurrency: Practice and Experience, 5(4):257-268, June 1993.
19. M. V. Nibhanupudi, C. D. Norton, and B. K. Szymanski. Plasma simulation on networks of workstations using the bulk-synchronous parallel model. In International Conference on Parallel and Distributed Techniques and Applications, 1995.
20. S. Orlando and R. Perego. A template for nonuniform parallel loops based on dynamic scheduling and prefetching techniques. In Proceedings of the 10th ACM International Conference on Super-computing, 1996.
21. B. Stroustrup. The C++ Programming Language. Addison Wesley, 3rd edition, 1997.
22. L. Valiant. A bridging model for parallel computation. Communications of the ACM, 33:103-111, 1990.
23. M. H. Willebeck-LeMair and A. P. Reeves. Strategies for dynamic load balancing on highly parallel computers. IEEE Transactions on Parallel and Distributed Systems, 4(9):979-993, September 1993.
24. Y. Yan, X. Zhang, and Y. Song. An effective and practical performance prediction model for parallel computing on non-dedicated heterogeneous NOW. Journal of Parallel and Distributed Computing, 38(l):63-80, 1996.
25. X. Zhang and Y. Yan. Modeling and characterizing parallel computing performance on heterogeneous networks of workstations. In Proceedings of the 7th IEEE Symposium on Parallel and Distributed Processing, pages 25-34, 1995.