Across
- 4. (12 Letters): A general model for specifying the protection of resources in an operating system.
- 6. (4 Letters): A technology that uses multiple hard drives to improve performance and/or data redundancy (Acronym).
- 9. (11 Letters): The mechanism used by an application program to request a service from the operating system's kernel.
- 11. (8 Letters): A mechanism where a process can be temporarily moved out of main memory to secondary storage and then brought back.
- 12. (6 Letters): The core component of an operating system, responsible for managing system resources and providing a low-level interface.
- 14. (15 Letters): The coordination of multiple processes to ensure that they interact correctly, often involving mechanisms like locks or semaphores.
- 15. (8 Letters): A situation where two or more processes are waiting indefinitely for a resource held by one of the waiting processes.
Down
- 1. (9 Letters): A state in virtual memory when a process spends more time paging than executing.
- 2. (13 Letters): A memory management technique that allows the execution of processes that are not completely in main memory.
- 3. (4 Letters): The simplest non-preemptive CPU scheduling algorithm, also known as First-Come, First-Served (Acronym).
- 5. (3 Letters): A non-preemptive scheduling algorithm that gives the CPU to the process with the shortest next CPU burst (Acronym).
- 7. (9 Letters): An integer variable used for signaling among processes, typically involving wait() and signal() operations.
- 8. (6 Letters): A memory-management scheme that permits the physical address space of a process to be noncontiguous.
- 10. (8 Letters): A high-level language construct that provides a mechanism for process synchronization and mutual exclusion.
- 13. (10 Letters): A CPU scheduling algorithm where each process gets a small, fixed unit of CPU time, called a time slice.