Instructor: Prof. Tao Yang, Department of Computer Science
(tyang@cs.ucsb.edu, office Eng I 2151, phone 4384.)
Office hours: TR 4:50-5:50pm.
TA: Daniel A. Andresen, dandrese@cs.ucsb.edu.
Office hours TW, 2:30-3:30, at room 101C, Trailer 380.
Location and time: Lec. TR 3:30-4:45, Phelp 2518. Dis. F12:00-12:50
(Engr 1132 enroll #08615)
Text Book: Introduction to Parallel Computing, Vipin Kumar, A. Grama, A. Gupta, G. Karypis, Benjamin/Cummings Pub, 1994.
The additional materials are in the AS notes on campus under
name COMPSC-110B.
Reference books (reserved in the library):
Richard L. Burden, J. Douglas Faires.
Numerical analysis,
4th ed. Boston : PWS-KENT Pub. Co., c1989.
Topics:
Collect names of students (account names in CSIL, social security numbers are also needed to get the INTEL accounts).
TA (Jan 6): Review the concepts of algorithm, how to count operations, basic complexity analysis. Review Taylor expansion, linear algebra.
(Jan 13) Give examples of data dependence and find data dependence in a program. Given examples of task graphs and the schedule.
TA (Jan 20): Discuss how to use the Meiko CS-2 in lab, demonstrate the login, show the parallel machine, compile and run a program.
TA (Jan 27): explain an example on how to do parallel programming the Meiko CS-2.
TA (Feb 3, 10, 17,24): Review the concept of matrix multiplication, direct and iterative methods for solving a linear system. Explain the example of how parallel Gaussian Elimination work.
TA (March 3): Explain how to access INTEL Paragon. (March 10): Review the homework solutions for final exams.
Grading: Six homework/programming assignments (30%),
Midterm (30%), Final (40%).