Abstract
Parallel algorithms are often introduced to students by describing the geometric topologies formed by communicating processes and often the geographic relationships between them. However, the two most common message passing environments used in teaching, PVM and MPI, each provide only rudimentary support for the specification and execution of process topologies. There is a strong need for better syntactic and semantic support for process topologies in these environments, so that students may concentrate on the algorithms being studied, and not have to wrestle with the environments' infrastructure. This paper first motivates, and then describes the use of additional support within PVM and MPI which addresses this need.
- 1 Cunha, J.C., and Lourenco, J. An Integrated Course on Parallel and Distributed Processing, in Proceedings of ACM Computer Science Education Technical Symposium'98, Atlanta, Georgia, Mar. 1998, pp217-221. Google Scholar
Digital Library
- 2 Jin, L., and Yang, L. A Laboratory for Teaching Parallel Computing on Parallel Structures, in Proceedings of ACM Computer Science Education Technical Symposium'95, Nashville, Tennessee, Mar. 1995, pp71-75. Google Scholar
Digital Library
- 3 The Message Passing Interface Forum, MPh A Message- Passing Interface Standard, 1994, Available from http : //www. mcs. anl. gov/mpi.Google Scholar
- 4 The Message Passing Interface Forum, MPI-2: Extensions to the Message-Passing Interface, 1997, Available from http : //www. mpi- forum, org.Google Scholar
- 5 Geist A., Bequelin, A., Dongarra, J., Jiang, W., Mancheck, R., and Sunderam, V. PVM 3 User's Guide and Reference Manual, Available from http : //www. netl lb. org/pvm3 /ug3. ps, 1994.Google Scholar
- 6 Geist A., Bequelin, A., Dongarra, J., Jiang, W., Mancheck, R., and Sunderam, V. PVM: Parallel Virtual Machine, A User Guide and Tutorial for Networked Parallel Computing, MIT Press, Cambridge, Massachusetts, ISBN 0-262-57108-0, 1994. Google Scholar
Digital Library
- 7 Schaller, N.C., and Kitchen, A.T., Experiences in Teaching Parallel Computing - Five Years Later, SIGCSE Bulletin, Vol 27, No. 3, Sept. 1995, pp15-20. Google Scholar
Digital Library
- 8 Tosten, R.S., and Tymann, P. Using and Teaching Workstation-Based Parallelism, Workshop presentation at ACM Computer Science Education Technical Symposium'96, Philadelphia, PA. Feb. 1996, abstract in SIGCSE Bulletin, Vol 28, No. 1, p423.Google Scholar
Index Terms
Teaching parallel algorithm with process topologies
Recommendations
Teaching parallel algorithm with process topologies
SIGCSE '00: Proceedings of the thirty-first SIGCSE technical symposium on Computer science educationParallel algorithms are often introduced to students by describing the geometric topologies formed by communicating processes and often the geographic relationships between them. However, the two most common message passing environments used in teaching,...
Teaching how to teach computational thinking
ITiCSE 2018: Proceedings of the 23rd Annual ACM Conference on Innovation and Technology in Computer Science EducationComputational Thinking is argued to be an essential skill for the workforce of the 21st century. As a skill, Computational Thinking should be taught in all schools, employing computational ideas integrated into other disciplines. Up until now, questions ...
Teaching shared memory parallel concepts with OpenMP
Curriculum 2013 brings parallelism into the CS curricular mainstream. This hands-on workshop lets faculty with little or no background in parallel computing explore parallel concepts using OpenMP. OpenMP is a platform independent, industry-standard ...







Comments