Abstract
Parallel computing teaching has an important difficulty, there are few tools to directly learn the behavior of the parallel algorithms and the parallel architectures. Normally the student is formed to think in sequential algorithms running in sequential machines. We present PSEE, a tool to reduce the gap between the basic concepts and its utilization. PSEE is an integrated and interactive graphic environment which allows to simulate and evaluate the performance of parallel algorithms in parallel architectures. PSEE permits to manage the main characteristic parameters involved in the system in order to show the tuning grade of the algorithm/architecture couple. PSEE includes a graphic editor for algorithms and architectures in modelled form, an interactive simulator to run (simulate) the algorithm on the architecture and a performance evaluation instrument.
- 1 BOLAS VO.2 "User's Manual" Dept Informatica. Computer Architecture and Operating Systems Unit. Universitat Autonoma de Barcelona 1991 (in English).Google Scholar
- 2 M.A. Mayosky, E. Luque and j. Sorribes "Behavioral Simulation of Link-Oriented Architectures" Proceedings of the ISMM international Symposium. pgs 212-215. Lugano. 1990.Google Scholar
- 3 Suppi R. "Entomo de Visualizacibn y Procesamiento de Informaci6n en la simulaci6n de Arquitecturas y Algoritmos Paraletos" MS. Thesis, Dept Informatica. Computer Architecture and Operating Systems Unit. Universitat Autonoma de Barcelona 1991 (in Spanish).Google Scholar
- 4 A.H. Veen. "Dataflow Machine Architecture". Computing Surveys, vol. 18, n.4, December 1986. Google Scholar
Digital Library
- 5 P.C. Treleaven, D.R. Brownbridge, R.P. Hopkins. "Data-driven and demand-driven computer architecture". Computing surveys, Vol. 14, n. 1, March 1982. Google Scholar
Digital Library
- 6 G.M. Papadopoulos. "Implementation of a General Purpose Dataflow Multiprocessor". Technical Report MIT / LCS / TR-432. August 1988.Google Scholar
- 7 Arvind, K.P. Gostelow. "The U-interpreter". IEEE COMPUTER, 15(2). February 1982.Google Scholar
- 8 W.W. Chu, L.J. Holloway, M.T. Lan, K. Efe. "Task allocation in distributed data processing". IEEE COMPUTER November 1980.Google Scholar
- 9 S.H. Bokhari. "On the mapping problem". IEEE Transactions on Computers, vol. C-30, n.3, March 1981.Google Scholar
- 10 C.C. Shen, W.H. Tsai. "A graph matching approach to optimal task assignment in distributed computing systems using a minimax criterion". IEEE Transactions on Computers, Vol. C-34, March 1985.Google Scholar
- 11 Y. Lan, A. Espahanan. "Relay approach Message Routing in Hypercube Multiprocessors" Proceedings of the Third International Conference on Supercomputing. 1988.Google Scholar
- 12 B. Melamed, R.J.T. Morris. "Visual Simulation: The Performance Analysis Workstation". IEEE COMPUTER Aug. 1985.Google Scholar
- 13 K.M. Nichols, J.T. Edmark. "Evaluating Muiticomputers Systems with PARET". IEEE COMPUTER, May 1988. Google Scholar
Digital Library
- 14 Lehr et alter 'Visualizing Performance Debugging" IEEE Computer, pgs 38-51. October 1989. Google Scholar
Digital Library
Index Terms
A quantitative approach for teaching parallel computing
Recommendations
A quantitative approach for teaching parallel computing
SIGCSE '92: Proceedings of the twenty-third SIGCSE technical symposium on Computer science educationParallel computing teaching has an important difficulty, there are few tools to directly learn the behavior of the parallel algorithms and the parallel architectures. Normally the student is formed to think in sequential algorithms running in sequential ...
Teaching Parallel Computing Concepts with OpenMP (Abstract Only)
SIGCSE '16: Proceedings of the 47th ACM Technical Symposium on Computing Science EducationOpenMP is an industry-standard, platform-independent parallel programming library built into all modern C and C++ compilers. Unlike complex parallel platforms, OpenMP is designed to make it relatively easy to add parallelism to existing sequential ...






Comments