UNIT 3

1234567891011121314151617181920
Across
  1. 3. Problem involving shared buffer between two types of processes
  2. 7. Graphical representation used to detect deadlocks
  3. 9. Deadlock condition where resources can't be forcibly taken back
  4. 11. Technique to find cycles in resource allocation graph
  5. 14. Recovery technique that eliminates processes
  6. 15. Model using request and assignment edges
  7. 18. Part of a program where shared resources are accessed
  8. 19. Use of multiple methods for handling deadlock
  9. 20. Deadlock avoidance algorithm using safety check
Down
  1. 1. Classical synchronization problem involving dining and thinking
  2. 2. Synchronization tool that can be binary or counting
  3. 4. Basic mechanism used to provide mutual exclusion
  4. 5. Processes waiting on each other indefinitely
  5. 6. Peterson's Solution indicator for entering critical section
  6. 8. Software-based mutual exclusion solution for two processes
  7. 10. Hardware method that disables all interrupts for mutual exclusion
  8. 12. High-level programming construct used for synchronization
  9. 13. Approach to violate at least one deadlock condition
  10. 16. Technique to restore a process to a previous safe state
  11. 17. Algorithm that keeps the system in a safe state