BIT01s: Final syllabus for Parallel Computing Exam

Course code: CSE 501
Course Name: Parallel Computing

Dear all,
According to my and Shamol's books and notes I have given this syllabus for our Parallel Computing final exam. But anybody can give me suggestion for editing this syllabus if you feel that it can be modified according to your books or notes.

Chapter 01: Parallel Computer Models

This chapter was our Self study. But Sir also covered these topics:

-->SISD,SIMD,MISD,MIMD(page-11-12)

-->Parallel/Vector Computers(page-11-12)

-->Shared Memory Multiprocessors(UMA,NUMA,CUMA--section:1.2.1)


Chapter 02: Program and Network Properties

-->Data Dependencies, Control Dependencies and Resource Dependencies--section:2.1.1(these are very important topics)

-->Bernstein's Conditions

-->Grain Sizes and Latency Section:2.2.1

-->Grain packing and Scheduling section:2.2.2 & 2.2.3(v.v.I)

-->Control Flow Versus Data Flow sec:2.3.1

-->Network Properties and Routing sec: 2.4.1(v.v.I)

Chapter 03: Principles of Scalable Performance

-->Parallelism Profile in Programs Sec:3.1.1

-->Harmonic Mean Performance Sec:3.1.2

-->Efficiency, Utilization and Quality Sec:3.1.3

*****Isoefficiency Concept (Page-126) Sec:3.2.3*******This topic has recently added

-->Speedup Performance Laws sec:3.3

-->Amdahl's Law for a Fixed Workload Sec: 3.3.1

Chapter -06 Pipelining and Superscalar Techniques

6.1 Linear Pipeline Processors
6.1.1 Asynchronous and Synchronous Model
6.1.2 Clocking and Timing Control
6.1.3 Speedup, Efficiency and Throughput
6.2 Non Linear Pipelining
6.2.1 Reservation and latency Analysis
6.2.2 Collision Free Scheduling
6.2.3 Pipeline Schedule Optimization
6.3 Instruction Pipeline Design
6.3.1 Instruction Execution Phases
6.3.2 Mechanisms for Instruction pipelining
6.3.3 Dynamic instruction Scheduling
6.3.4 Branch handling Techniques
6.4 Arithmetic Pipeline Design
6.4.1 Computer Arithmetic Principles

Chapter-07 Multiprocessors and Multicomputers

7.1 Multiprocessor System Interconnects
-->The Hot-Spot problem (page-345)
7.2.1 The cache Coherence Problem
7.2.2 Snoopy Bus Protocols
7.2.3 Directory Based Protocols
7.4 Message Passing Mechanisms
7.4.1 Message Routing Schemes
7.4.3 Flow Control Strategies

You rock!

this is final............

Syllabus hoite ata promanito hoy je, Finally sobai k mere felar decision nilo sir

@IBRA ....

no doubt our beloved IBRA has done a wonderful job
but, this huuuuuuuuuuuge syllabus
আমার তো দেখেই জ্বর এসে গেছে, পড়তে গেলে না জানি কি হবে?

Please someone review the syllabus, I fear something is missing.....

রায়হান দোস্ত......
শুধুমাত্র তোর জন্য নিছের অংশটুকুঃ

chapter: 4,5,8,9,10,11,12

BIT0108-mostafa wrote:রায়হান দোস্ত......
শুধুমাত্র তোর জন্য নিছের অংশটুকুঃ

chapter: 4,5,8,9,10,11,12

at first i didn't even imagine about the syllabus
but after seeing the book I have felt from the sky
horlicks,boost,maltova,ovaltine even shark,tiger is not sufficient to cover the syllabus.
if it can be covered but it is tensed to impossible to recall in the exam hall

try Ya ba @Efat :p:p:p...... ....... now i understood why buet guys took massive addiction in Ya Ba drugs......

Thanks man

I think... the syllabus is the book of kai hwang..

I went through the syllabus of chapter 7. According to my book markings, 7.4.2 was read in class. Specifically speaking, Virtual channels.

too short.......

"~~~Syllabus ta ashole kom hoe gese, tomader tw kisui porano hoe nai.......~~~"

রায়হান তোরে পিডামু

আমার ত যতদুর মনে পরে, অন্য একটা বই থেকেও পড়ানো হয়েছিল।