| |
May 03, 2024
|
|
|
|
|
CSCE 535 - Introduction to Data Parallel Algorithms and Architectures Credit Hours: 3
Lecture Contact Hours: 3 Lab Contact Hours: 0
Theory of systolic algorithms and architectures: (a) models of systolic computation, performance measures and theoretical bounds, (b) processors and interconnection networks: arrays, trees, hypercubes, mesh of trees, shuffle-exchange and butterfly, (c) algorithms for sorting, search, Fourier transforms, convolution, matrix computations and graph theory problems, (d) routing and graph embedding in massively parallel systems, scheduling and load balancing and (e) advanced topics: retiming, universal networks, PRAMS, DRAMS, and other new machine models.
Prerequisite(s): CMPS 430G and CSCE 500
Add to Catalog (opens a new window)
|
|
