|
- Professor
-
David S. Wise,
Email
Office hours: 11am--12n MTW and by appointment.
Lindley Hall 330H; 855-4866.
- Prerequisite M301 and C343 and C311 or equivalent,
and some single graduate-level course in Computer Science,
or consent of instructor.
- Seminar:
- Section 28346, MW, 1:00 - 2:15pm, Woodburn WH 116
|
This seminar course will build from current practice of array
problems in your favorite programming language toward a
block-recursive, divide-and-conquer perspective of these problems.
Tools broadly available:
- Representations of dense arrays.
- Matrices as 2D arrays: the common case.
- Classic programming paradigms and the algorithms they suggest.
- Generic programming and the Matrix Template Library (MTL4).
- Divide-and-conquer recursion.
- A new programming paradigm and newer algorithms??
- Representations of sparse arrays.
The issues to be confronted are broad, (and span many areas into
which some folks may partition the field computing.)
- Algorithms.
- Data Structures.
- Processor architecture: caching and multiple cores.
- Impact of communications: shared caching and distributed memories.
- Abstract Analyses of performance.
- How to visualize performance..
- Compiling tools that may or may not help.
The course will be structured as two coordinated sequences
of readings, and of assignments. The programming
assignments will build from familiar programming into state-of-the-art material,
and will culminate in a semester project.
The projects will be carried out by groups of two or three
students working and graded as teamwork.
Last modified: Sun Apr 6
David S. Wise