CAOS chaos

Edit Answers
1234567891011121314151617181920212223242526272829303132333435
Across
  1. 3. Data structure that indicates where pages are being held in memory
  2. 4. Instructions that are guaranteed to happen uninterrupted
  3. 6. Page replacement policy that assumes we know the future
  4. 9. Structure that keeps the processes in the Ready state
  5. 10. Algorithm that ignores the problem above because it happens so rarely
  6. 12. Issue of processes holding onto some resources while waiting on others
  7. 13. Ending state in process lifecycle
  8. 17. The phenomenon where there is wasted space within used blocks
  9. 20. Process life cycle state
  10. 21. Scheduling policy that orders in terms of length of execution
  11. 23. Hardware instruction that retrieves the previous value and sets the value of the register uninterrupted
  12. 26. Structure that store a 0 1 to indicate whether a block is free or taken
  13. 27. Where Dr. Thomas will be for the next 8 months
  14. 28. Process lifecycle state
  15. 30. Input and output state
  16. 31. Block of code where a process is interacting with a shared variable
  17. 34. Number representation with 16 options per digit
  18. 35. Entity that keeps track of how important a process is
Down
  1. 1. Scheduling policy that is the most fair
  2. 2. The piece of hardware that maps virtual memory address to actual memory addresses
  3. 5. Representation to store signed numbers
  4. 7. Page replacement policy that removes pages that haven’t been used in a while
  5. 8. Measurement of processor speed
  6. 11. Hybrid policy used for storing blocks in lines in cache
  7. 14. Entity per file that stores metadata and tracks the blocks in Unix
  8. 15. Structure that contains information about all the other files “contained” in it
  9. 16. Array of process entities
  10. 18. Entity that keeps track of all information pertaining to a process
  11. 19. Example of circuit that can be used in memory
  12. 22. State that only process can be in
  13. 24. Thousand gigabits equals
  14. 25. The principle that says if you access one page you are likely to access pages around it.
  15. 29. Entity to protect the block of code where a process is interacting with a shared variable
  16. 32. Entity in main memory that is equal in size to a page
  17. 33. Entity that can be used when there are multiple copies of a shared resource