Professional Documents
Culture Documents
15CS72 Scheme
15CS72 Scheme
Flynn's Classification Q2 a)
5 types of data dependences
Flow dependence
Anti dependence
Output dependence
Each carry 2.5 marks I/O dependence
(block diagram + explanation) Unknown dependence
Each carry 1 mark (5 Marks)
Dependence graph - 5 Marks
Q1 b)
Q2 b)
COMA
Q3 a)
Q4 a)
Virtual memory models
Private virtual memory - 5 marks
Globally shared virtual memory - 5 marks
(block diagram - 6 Marks + explanation - 4 Marks)
Q3 b) Q4 b)
Q4 c)
Page replacement policies
Least recently used (LRU)
Optimal (OPT) algorithm
First In First Out (FIFO)
Least Frequently Used (LFU)
Circular FIFO
Random replacement
Each carry 01 Mark (06 marks)
Q5 a)
Daisy Chained central arbitration - 5 M Q6 b)
Distributed arbitration - 5 M Explanation of prefetch buffers
Sequential buffer
Target buffer
Loop buffer
Each carry 02 Marks
Q5 b)
Cache mapping scheme
Q6 c)
Direct mapping cache
Internal data forwarding techniques
Fully associative cache
Store-load
Set associative cache
Load-load
Sector mapping cache
Each carry 2 marks
For Listing 02 Marks
Explanation of any two (each carry 04 Marks)
Q7 a)
Q6 a)
Q7 b)
Full-Map Directories - 4M
Q8 c)
Vector Instruction types
Chained directory - 3M
Q8 a)
Flow control methods
Buffering
Blocking
Discard and retransmission
Defour after being blocked
Each carry 2.5 Marks
Q8 b)
Store and forward routing - 2 Marks
Q9 b) Q10 b)
Tomasulo's Algorithm
Block Diagram - 04 Marks
Explanation - 04 Marks
Q9 c) Q10 c)
Sole access protocols 2 bit branch predictor state transition diagram
Lock synchronization Diagram - 02 Marks
Optimistic synchronization Explanation - 02 Marks
Server synchronization
Each carry 2 Marks (6 Marks)