0% found this document useful (0 votes)
6 views18 pages

Introduction About ACA Syllabus

The document outlines a syllabus for an Advanced Computer Architecture course, covering topics such as computational models, superscalar processors, MIMD architecture, and memory hierarchy. It emphasizes the importance of parallel processing, branch handling, and interconnection networks in computer architecture. The conclusion highlights the study of various architectures, processor technologies, and memory systems.

Uploaded by

profgeeta25
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
6 views18 pages

Introduction About ACA Syllabus

The document outlines a syllabus for an Advanced Computer Architecture course, covering topics such as computational models, superscalar processors, MIMD architecture, and memory hierarchy. It emphasizes the importance of parallel processing, branch handling, and interconnection networks in computer architecture. The conclusion highlights the study of various architectures, processor technologies, and memory systems.

Uploaded by

profgeeta25
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 18

ADVANCED COMPUTER

ARCHITECTURE
2

SYLLABUS
UNIT I- Computational Model and Architecture
UNIT 2 – Superscalar Processors and Branch
Handling
UNIT 3 – MIMD Architecture and Interconnected
Network
UNIT 4 – Processor and Memory Hierarchy
COMPUTATIONAL
MODEL AND
ARCHITECTURE
Click to add picture

UNIT-1
COMPUTATIONAL
MODEL
5

BASIC COMPUTATIONAL MODEL


• Basic computational models discuss how different architectures can be
used to perform computations.

• Computer architecture is seen as a multilevel hierarchical framework,


where different levels (hardware, firmware, operating system, etc.)
interact.

• Example: Imagine a computer as a multi-story building, where each


level has specific functions but they all work together to make the
building operate.
6

PARALLEL PROCESSING
Types and levels of parallelism: will Explore the ways to perform multiple
operations simultaneously.

• Instruction Level Parallelism (ILP) processors can execute multiple


instructions simultaneously.

Example: Running multiple applications on your computer at once.

• Pipelining allows several instructions to be processed at different stages


of execution simultaneously.

Example: An assembly line in a factory where different tasks are performed at


different stages.
Click to add picture

UNIT-2

SUPERSCALAR
PROCESSOR
8

SUPERSCALAR PROCESSOR
• Emergence of superscalar processors: Processors that can issue multiple
instructions per clock cycle.

• Tasks include parallel decoding, instruction issuing, and execution.

• Example: Think of a multi-lane highway where several cars (instructions)


can travel simultaneously.
9

BRANCH HANDLING
• Addresses the challenges when the CPU has to make decisions
(branches) and how it handles these situations.

• Techniques like branch prediction help minimize delays caused by


incorrect guesses.

• Example: Predicting whether a light will turn red or green before you
reach the intersection to avoid stopping suddenly.
10

UNIT-3

MIMD ARCHITECTURE
AND
INTERCONNECTION NETWORK
11

MIMD ARCHITECTURE
• Concepts of distributed and shared memory in Multiple Instruction
Multiple Data (MIMD) systems.

• Example: Multiple chefs in a kitchen (processors) either sharing


ingredients (shared memory) or using their own (distributed memory).
12

INTERCONNECTED NETWORK
• Static and Dynamic Interconnection Networks:

• - Describes different network topologies and their uses in connecting


multiple processors.

• - **Example**: Think of various road networks (linear array, ring, tree,


bus, crossbar, multistages etc.) and how they connect different cities
(processors).
13

STATIC VS DYNAMIC
STATIC INTERCONNECTION

• - Static connection networks have fixed, unchanging connections between nodes


(processors or devices).

• - These connections remain the same throughout the operation of the system.

• Example Star, Tree, Mesh, Ring etc.

DYNAMIC INTERCONNECTION
• - Static connection networks have fixed, unchanging connections between nodes
(processors or devices).

• - These connections remain the same throughout the operation of the system.

• Example- Bus, Crossbar etc.


14

UNIT-4

PROCESS AND MEMORY


HIERARCHY
15

PROCESSOR AND MEMORY


HIERARCHY
• **Processors and Memory Hierarchy**:

• Advanced processor technologies and memory hierarchy technology


and virtual memory technology (layers of memory with different speeds
and sizes).

• **Example**: A library system where frequently accessed books


(cache) are kept on hand while others are stored further away (main
memory).
CACHE COHERENCE AND 16

SYNCHRONIZATION
MECHANISM
• **Cache Coherence and Synchronization Mechanisms**:

Addressing issues where multiple processors access and update


shared data.

- **Example**: Keeping track of a shared document being edited by


several people simultaneously.

• Techniques like snoopy cache protocols ensure that all processors have
a consistent view of the data.


17

CONCLUSION
• Study about the Architectures, Processors,
distributed architectures, advances processor
technology and memory hierarchy etc.
THANK
YOU

You might also like