Abstract
In teaching of Parallel Algorithms, emphasis is usually placed on algorithms that are based on parallel random access machine (PRAM) model, but those algorithms may or may not be efficiently implementable on real parallel machines. In this paper we design parallel algorithms in relation with the actual parallel machine models and show the importance of integrating parallel algorithms with parallel machine models. We discuss this approach using traveling salesperson problem (TSP) as an example.
- 1 Brassard, G. and Bratley, P. 1988. Algorithmics: Theory and Practice. Prentice Hall. Google Scholar
Digital Library
- 2 Hartman, J. and Sanders, D. 1993. Data Parallel Programming: A Transition from Sequential to Parallel Computing. Proceedings of the 1993 ACM Computer Science Education Conference, pp.96-100. Google Scholar
Digital Library
- 3 Kumar, V. ~t. al. 1994. Introduction to Parallel Computing. The Benjamin/Cummings Publishing Co. Google Scholar
Digital Library
- 4 Jaja, J. 1992. An Introduction to Parallel Algorithms. Addison-Wesley Publishing Co. Google Scholar
Digital Library
- 5 Jin, L. et. al. 1992. Parallel Solution of Hough Transform and Convolution Problems- A Novel Multimodal Approach. Proceedings of the 1992 A CM/SIGAPP Symposium on Applied Computing, pp775-781. Google Scholar
Digital Library
- 6 Stone, H. S. 1993. High-Performance Computer Architecture. Addison-Wesley Publishing Co. Google Scholar
Digital Library
- 7 Yang, L. et. al. 1993. Solution of Traveling Salesperson Problem (TSP) on Parallel Machine Models. Computer Science Department Technical Report TR1993-07, Cal Poly Pomona.Google Scholar
Index Terms
Integrating parallel algorithm design with parallel machine models
Recommendations
Integrating parallel algorithm design with parallel machine models
SIGCSE '95: Proceedings of the twenty-sixth SIGCSE technical symposium on Computer science educationIn teaching of Parallel Algorithms, emphasis is usually placed on algorithms that are based on parallel random access machine (PRAM) model, but those algorithms may or may not be efficiently implementable on real parallel machines. In this paper we ...
Parallel compilation for a parallel machine
Proceedings of the SIGPLAN '89 symposium on Interpreters and interpretive techniquesAn application for a parallel computer with multiple, independent processors often includes different programs (functions) for the individual processors; compilation of such functions can proceed independently. We implemented a compiler that exploits ...
Parallel compilation for a parallel machine
PLDI '89: Proceedings of the ACM SIGPLAN 1989 conference on Programming language design and implementationAn application for a parallel computer with multiple, independent processors often includes different programs (functions) for the individual processors; compilation of such functions can proceed independently. We implemented a compiler that exploits ...







Comments