CS2510 FINAL Study Guide      Spring 2002

DATE   Thursday 25, 2002 

FORMAT

• Answer questions with short answers, definitions, solve problems by applying algorithms, think and make inferences based on material seen in class or in the textbook.
• Closed notes, closed book

PREPARATION

• Study lecture notes
• Study handouts and review your own notes taken in class, especially the real time material (EDF, RMS, Fault Tolerance) 
• Study textbook, sections 6.1, 6.2, 6.4,  6.5.1, 6.5.2, 7.1, 7.3, 7.5, 7.6, 7.7, 8.1 - 8.5, 11.1.8

SUBJECTS

• Principles of consistency and replication
• Consistency models (data centric)
• Consistency protocols
• Principles of replica distribution
• Fault tolerance concepts 
• Fault tolerant communication
• Distributed commit (two phase, blocking, non-blocking)
• Recovery (roll back, domino effect)
• Principles of security (encryption, authentication, firewalls, SSL, etc.)
• Secure channels 
• Key management 
• Real time scheduling (only periodic tasks: RMS, EDS)
• Real time fault tolerance (modified admission control equations)

KNOW WHAT THE FOLLOWING MEAN, WHY THEY ARE USEFUL OR IMPORTANT, and UNDERSTAND THE TRADEOFFS

• Different consistency models 
• Different replica distribution algorithms
• Different fault tolerance schemes
• Different real time scheduling schemes (with and without fault tolerance)
• Different encryption schemes (DES and RSA), Public/Private key, Shared key encryption protocols
• Key distribution protocols

ABLE TO USE OR DO OR RECOGNIZE THE FOLLOWING

•    RMS and EDF admission control equations
• RSA encryption example 
• Checkpointing and roll back
•