Topic 2: Memory and Processes Management

1234567891011121314151617181920212223242526
Across
  1. 5. A scheduling technique where a running process can be interrupted and returned to the ready queue before completing its burst
  2. 7. A scheduling technique used in priority systems that prevents starvation by gradually increasing the priority of processes waiting a long time
  3. 8. The memory management function of the operating system that reclaims main memory when a process no longer requires it
  4. 10. A non-volatile secondary storage device using flash memory technology, offering faster boot times and lower power consumption than magnetic drives
  5. 11. The primary type of fast-access, volatile memory in a computer system that loses its data when power is turned off
  6. 13. An operating system routine or program module that remains permanently loaded in main memory, such as the kernel
  7. 15. A category of operating system routines or utilities that are loaded into main memory only when needed and overwritten when finished.
  8. 17. A non-volatile memory type that contains permanently stored BIOS or firmware responsible for initializing hardware during system startup
  9. 21. Another name for the long-term scheduler, which determines which newly arrived programs are admitted into the system memory for active processing
  10. 24. The process state specifying the time or condition when a process has completely finished its execution
  11. 25. The scheduling time metric calculated as the completion time of a job minus the arrival time of that job in the system
  12. 26. The lookup structure used by the operating system during paging to map a process's virtual/logical addresses to physical memory frames
Down
  1. 1. The specific scheduling module that physically hands over control of the CPU to the process selected by the short-term scheduler
  2. 2. The technique of moving a suspended process from main memory to secondary storage to make space for other processes, reducing the degree of multiprogramming
  3. 3. The operating system program or module that coordinates shared resources and selects which in-memory ready processes are to be executed next
  4. 4. The major system resource representing the actual amount of time a central processing unit spends executing computations for a specific task
  5. 6. The fixed-sized physical memory blocks in main memory onto which logical pages of a process are mapped during paging
  6. 8. A specific condition when two or more processes are permanently blocked because each is waiting for a resource that the other process holds
  7. 9. The deadlock condition stating that resources cannot be snatched by force from a process; they can be released only by the process's clear action
  8. 10. A virtual memory scheme where memory is divided into variable-sized logical units rather than fixed-sized blocks
  9. 12. The process state where a process is temporarily paused, waiting for an external event such as user input or I/O completion to occur
  10. 14. A simple CPU scheduling algorithm where the first process to enter the queue is the first to be allocated the CPU and executed
  11. 15. The smallest sequence of programmed instructions that can be managed independently by an operating system's CPU scheduler
  12. 16. The data structure maintained by the operating system for each individual thread containing its unique execution context and state
  13. 17. A preemptive scheduling algorithm designed for time-sharing systems that assigns equal time slices to each process in circular order
  14. 18. The system resource type that describes any program or hardware action transferring data to or from a computer and a peripheral device
  15. 19. The process state defined as waiting for permission to use the processor after being loaded into primary memory
  16. 20. Shortest Job First is considered an ______ scheduling algorithm because it mathematically minimizes the average waiting time for a set of processes
  17. 22. While threads belonging to the same process share code and global variables, each thread must have its own private ______ to store local variables and return addresses
  18. 23. An asynchronous signal from a device or synchronous event in software that causes the CPU to pause its current execution and run handler code