Course Title: Advanced Computer Architecture

Course Code: CSCC-704

Course Structure: Lectures: 3/Labs: 0

Credit Hours: 3

Prerequisites: Computer Architecture

Course Objectives:

To develop an understanding of high-performance computer architecture, as a foundation for

advanced work in computer architecture.

Description of system Evaluation:

Course Syllabus:

Introduction to Advanced Computer Architecture and Parallel Processing, Multiprocessors

Interconnection Networks, Performance Analysis of Multiprocessor Architecture, Shared

Memory Architecture, Message Passing Architecture, Abstract Models, Network Computing,

Parallel Programming in the Parallel Virtual Machine, Message Passing Interface (MPI),

Scheduling and Task Allocation.

Course Outline:

1. Introduction to Advanced Computer Architecture and Parallel Processing: History, Flynn‟s Taxonomy of Computer Architecture, SIMD Architecture, MIMD Architecture, Interconnection Networks. Chapter-1
2. Multiprocessors Interconnection Networks: Interconnection Networks Taxonomy, Bus-Based

Dynamic Interconnection Networks, Switch-Based Interconnection Networks, Static

Interconnection Networks, Analysis and Performance Metrics. [TB: Ch. 2]

1.  Performance Analysis of Multiprocessor Architecture: Computational Models, An Argument

for Parallel Architectures, Interconnection Networks Performance Issues, Scalability of

Parallel Architectures, Benchmark Performance. [TB: Ch. 3]

1. Shared Memory Architecture: Classification of Shared Memory Systems, Bus-Based

Symmetric Multiprocessors, Basic Cache Coherency Methods, Snooping Protocols,

Directory Based Protocols, Shared Memory Programming. [TB: Ch. 4]

1.  Message Passing Architecture: Introduction to Message Passing, Routing in Message Passing

Networks, Switching Mechanisms in Message Passing, Message Passing Programming

Models, Processor Support for Message Passing, Example Message Passing Architectures,

Message Passing Versus Shared Memory Architectures. [TB: Ch. 5]

1. Abstract Models: The PRAM Model and Its Variations, Simulating Multiple Accesses on an

EREW PRAM, Analysis of Parallel Algorithms, Computing Sum and All Sums, Matrix

Multiplication, Sorting, Message Passing Model, Leader Election Problem, Leader Election

in Synchronous Rings. [TB: Ch. 6]

1. Network Computing: Computer Networks Basics, Client/Server Systems, Clusters,

Interconnection Networks, Cluster Examples, Grid Computing. [TB: Ch. 7]

1. Parallel Programming in the Parallel Virtual Machine: PVM Environment and Application

Structure, Task Creation, Task Groups, Communication among Tasks, Task Synchronization,

Reduction Operations, Work Assignment. [TB: Ch. 8]

1. Message Passing Interface (MPI): Communicators, Virtual Topologies, Task

Communication, Synchronization, Collective Operations, Task Creation, One-Sided

Communication. [TB: Ch. 9]

1. Scheduling and Task Allocation: The Scheduling Problem, Scheduling DAGs without

Considering, Communication, Communication Models, Scheduling DAGs with

Communication, The NP-Completeness of the Scheduling Problem, Heuristic Algorithms,

Task Allocation, Scheduling in Heterogeneous Environments. [TB: Ch. 10]

[Instructors need to devise a contents delivery plan]

Reference Material:

1. Advanced Computer Architecture and Parallel Processing by Hesham El-Rewini, MostafaAbd-El-Barr, Wiley-Interscience; 1st Edition (January 18, 2005). ISBN-10: 012383872X

2. Advanced Computer Architectures by Sajjan G. Shiva, CRC Press (2005). ISBN-10: 0849337585

3. Advanced Computer Architecture by By Amit Kumar Mishra, S K Kataria & Sons (2010). ISBN-10: 9380027494

4. Advanced Computer Architecture: A Design Space Approach by DezsoSima, Terence Fountain, Peter Kacsuk, Addison-Wesley; 1st Edition (July 7, 1997). ISBN-10: 0201422913

5. Scalable Parallel Computing Technology, Architecture, Programming by Kai Hwang, Zhiwei Xu, McGraw-Hill Science/Engineering/Math; 1st Edition (February 1, 1998). ISBN-10: 0070317984

• Key dates and Time

• MS(CS) 2nd
•  
  • Friday          (12:00pm-1:40 pm)
  • Friday           (2:00 pm – 3:30 pm)