Study Materials

Deadlocks (Chapter 7.2)

Chapter 7:  Deadlocks
System Model
Deadlock Characterization
Methods for Handling Deadlocks
Deadlock Prevention
Deadlock Avoidance
Deadlock Detection
Recovery from Deadlock

Chapter Objectives:
1. To develop a description of deadlocks, which prevent sets of concurrent processes from completing their tasks
2. To present a number of different methods for preventing or avoiding deadlocks in a computer system
      

Disk Scheduling Algorithm (Chapter 10)

Chapter 10:  Mass-Storage Systems
Disk Access Time
Seek Time: Time taken by R/W head to reach desired track
Rotational Time: Time taken for one full rotation (360)
Rotational Latency: Time taken to reach to desired sector (Half of Rotational Time)
Transfer Time: Data to be Transfer / Transfer Rate
Transfer Rate (Data Rate): No. of Heads (No. of Surface) x Capacity of One Track x Number of Rotations in One Second
Capacity of One Track = No. of Sectors in One Track x Amount of Data in One Sector (Sector Size)
RPM -> Rotation per Minute