Course Syllabus Course Title: Advanced Computer Architecture Page 1 Page 1 of 5
Philadelphia University Faculty of Information Technology Department of Computer Science …

We propose COSMA: a parallel matrix-matrix multiplication algorithm that is near
communication-optimal for all combinations of matrix dimensions, processor counts, and …

A three-dimensional (3D) matrix multiplication algorithm for massively parallel processing
systems is presented. The P processors are configured as a “virtual” processing cube with …

This paper presents an evaluation and comparison of three topologies that are popular for
building interconnection networks in large-scale supercomputers: torus, fat-tree, and …

In the beginning of the twenty-first century, large unsolved combinatorial optimization
problems have been solved exactly. Two impressive cases should be mentioned. First are …

Quantization is an important technique to transform the input sample values from a large set
(or a continuous range) into the output sample values in a small set (or a finite set). It has …

As technology is reaching physical limits, reducing power consumption is a key issue on our
path to sustained performance. In this paper, we study fundamental tradeoffs and limits in …

We develop algorithms to multiply two vectors, a vector and a matrix, and two matrices on an
OTIS-Mesh optoelectronic computer. Two mappings, group row and group submesh, of a …

Summary form only given. We describe a novel parallel algorithm that implements a dense
matrix multiplication operation with algorithmic efficiency equivalent to that of Cannon's …

A key problem facing application developers is that they are expected to utilize extreme
levels of parallelism soon after delivery of future leadership class machines, but developing …