Unit 3

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