Operating Systems: Internals and Design Principles (Chapters 1–3)

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/63

flashcard set

Earn XP

Description and Tags

Comprehensive vocabulary flashcards covering computer system overview, operating system architecture, multiprogramming, memory management, and process control from Chapters 1, 2, and 3 of Operating Systems: Internals and Design Principles (9th Edition) by William Stallings.

64 Terms

1
New cards

Processor (Central Processing Unit)

The component that controls the operation of the computer and performs its data processing functions.

2
New cards

Main Memory

Volatile primary memory (also called real memory) used to store programs and data; its contents are lost when the computer is shut down.

3
New cards

I/O Modules

Components that move data between the computer and its external environment, including secondary memory devices, communications equipment, and terminals.

4
New cards

System Bus

A shared communication facility providing data paths and signaling among processors, main memory, and I/O modules.

5
New cards

Microprocessor

A processor implemented on a single chip; the invention that brought about desktop and handheld computing.

6
New cards

Graphical Processing Unit (GPU)

A specialized processor designed to provide efficient computation on arrays of data using Single-Instruction Multiple Data (SIMD) techniques.

7
New cards

Digital Signal Processor (DSP)

A computational device designed to deal with streaming signals such as audio or video, codecs, encryption, and security.

8
New cards

System on a Chip (SoC)

A hardware platform that integrates CPUs, caches, DSPs, GPUs, I/O devices (such as codecs and radios), and main memory all on the same chip.

9
New cards

Program Counter (PC)

A processor register that holds the memory address of the next instruction to be fetched; it is typically incremented after each fetch.

10
New cards

Instruction Register (IR)

A processor register into which a fetched instruction is loaded so that the processor can decode and execute it.

11
New cards

Interrupt

A mechanism by which other modules (such as I/O or timers) may interrupt the normal sequencing of the processor to improve processor utilization.

12
New cards

Program Interrupt

An interrupt generated by a condition resulting from instruction execution, such as arithmetic overflow, division by zero, executing an illegal machine instruction, or referencing disallowed memory.

13
New cards

Timer Interrupt

An interrupt generated by an internal processor timer that allows the operating system to perform scheduling and management functions on a regular basis.

14
New cards

Memory Hierarchy

A tiered organizational structure of memory where descending levels exhibit decreasing cost per bit, increasing capacity, increasing access time, and decreasing frequency of processor access.

<p>A tiered organizational structure of memory where descending levels exhibit decreasing cost per bit, increasing capacity, increasing access time, and decreasing frequency of processor access.</p>
15
New cards

Principle of Locality

The principle that memory references made by the processor tend to cluster over time, enabling multilevel hierarchical caching.

16
New cards

Secondary Memory

External, nonvolatile auxiliary memory used to store program and data files (e.g., magnetic disks).

17
New cards

Cache Memory

A small, fast memory buffer invisible to the operating system that exploits the principle of locality to reduce the memory access bottleneck.

18
New cards

Block Size

The unit of data exchanged between cache and main memory.

19
New cards

Least Recently Used (LRU) Algorithm

A cache replacement algorithm that replaces the block that has resided in the cache the longest with no references made to it.

20
New cards

Programmed I/O

An I/O technique where the processor directly controls I/O by periodically polling the status register of an I/O module until the operation finishes, which severely degrades system performance.

21
New cards

Interrupt-Driven I/O

An I/O technique where the processor issues a command to an I/O module and continues useful processing until alerted by an interrupt from the module to perform data transfer.

22
New cards

Direct Memory Access (DMA)

An I/O technique in which a dedicated module transfers an entire block of data directly to or from main memory without involving the processor, except at the start and end of the transfer.

23
New cards

Multicore Computer (Chip Multiprocessor)

A computer system that combines two or more processor cores on a single piece of silicon (die), each core consisting of all the components of an independent processor.

24
New cards

Operating System (OS)

A program that controls the execution of application programs and acts as an interface between applications and the computer hardware, designed for convenience, efficiency, and evolution.

25
New cards

Instruction Set Architecture (ISA)

The hardware-software boundary that defines the machine language instructions that a processor can execute.

26
New cards

Application Binary Interface (ABI)

The interface defining the system call standard to the operating system and hardware resources available via the user ISA for binary program compatibility.

27
New cards

Application Programming Interface (API)

The interface giving programs access to hardware resources and services through high-level language library calls and utilities.

28
New cards

Serial Processing

An early computing mode without an operating system where users accessed the console directly in series using paper sign-up sheets and manual switch setups.

29
New cards

Resident Monitor

The software component of an early batch system that remains permanently in main memory to control job sequencing and execution flow.

30
New cards

Job Control Language (JCL)

A special type of programming language used to provide commands and directives to the monitor, specifying which compiler and data to use.

31
New cards

Uniprogramming

A mode in which the processor executes only one program at a time, pausing and sitting idle whenever an I/O operation must be completed.

32
New cards

Multiprogramming (Multitasking)

A technique where multiple user programs reside concurrently in main memory and the processor switches execution between them when one program is waiting for I/O.

33
New cards

Time-Sharing System

An interactive operating system technique where processor time is shared among multiple concurrent users by interleaving execution in short bursts or quanta.

34
New cards

Compatible Time-Sharing System (CTSS)

One of the first time-sharing systems, developed at MIT by Project MAC in 1961 for the IBM 709, which used time slicing with clock interrupts every 0.2 seconds0.2\text{ seconds}.

35
New cards

Virtual Memory

A facility that allows programs to address memory from a logical point of view, without regard to the physical amount of main memory available.

36
New cards

Paging

A memory allocation mechanism where processes are divided into fixed-size blocks called pages that are dynamically mapped to physical memory frames.

37
New cards

Microkernel Architecture

An OS architecture that assigns only a few essential functions (address space management, interprocess communication, and basic scheduling) to the kernel, providing modularity and flexibility.

38
New cards

Thread

A dispatchable unit of work within a process that executes sequentially, is interruptible, and has its own processor context and stack data area.

39
New cards

Symmetric Multiprocessing (SMP)

A standalone hardware and operating system architecture where multiple similar processors share main memory and I/O devices, with the OS scheduling processes or threads across all processors.

40
New cards

Distributed Operating System

An operating system that provides the illusion of a single main memory space and single secondary memory space across networked separate systems.

41
New cards

Fault Tolerance

The ability of a system or component to continue normal operation despite the presence of hardware or software faults.

42
New cards

Mean Time to Failure (MTTF)

A measure of reliability representing the average operational duration of a system before a failure occurs.

43
New cards

Mean Time to Repair (MTTR)

The average time it takes to repair or replace a faulty component in a system.

44
New cards

Availability

The fraction of time that a system is operational and accessible to service users' requests.

<p>The fraction of time that a system is operational and accessible to service users' requests.</p>
45
New cards

Permanent Fault

A fault that persists indefinitely once it occurs until the faulty component is repaired or replaced.

46
New cards

Temporary Fault

A fault that is not present continuously under all operating conditions, categorized as transient (occurring only once) or intermittent (occurring at unpredictable times).

47
New cards

Spatial Redundancy

Physical redundancy involving multiple components that either perform the same function simultaneously or serve as active backups in case another fails.

48
New cards

Temporal Redundancy

A fault tolerance method that repeats a function or operation when an error is detected, effective for handling temporary faults.

49
New cards

Information Redundancy

A fault tolerance method that replicates or codes data in such a way that bit errors can be detected and corrected.

50
New cards

Process

A program in execution, an instance of a running program, an entity assigned to execute on a processor, or a unit of activity characterized by a sequential thread of execution, current state, and associated resources.

51
New cards

Process Control Block (PCB)

The primary data structure created and managed by the operating system containing all the state, identification, and control attributes necessary to manage a process.

<p>The primary data structure created and managed by the operating system containing all the state, identification, and control attributes necessary to manage a process.</p>
52
New cards

Trace

The behavior of an individual process characterized by listing the sequence of instructions that execute for that process.

53
New cards

Dispatcher

A small operating system program that switches the processor from one process to another.

54
New cards

Process Spawning

The creation of a new process by the operating system at the explicit request of another running process.

55
New cards

Parent Process

The original, creating process that requests the creation of a new process.

56
New cards

Child Process

The new process created as a result of a spawn request by an existing parent process.

57
New cards

Swapping

The process of moving part or all of a process from main memory to disk into a suspend queue to release memory for ready processes.

58
New cards

Process Image

The complete collection of user program code, user data, execution stack, and process control block attributes allocated to a process.

59
New cards

Program Status Word (PSW)

A register or set of registers containing condition codes and status flags (such as the x86 EFLAGS register) that record processor state information.

60
New cards

User Mode

The less-privileged processor execution mode in which user programs execute and access to privileged instructions and restricted memory is blocked.

61
New cards

System Mode (Kernel Mode)

The more-privileged processor execution mode, also called control mode, used by the OS kernel to execute privileged instructions and access protected memory.

62
New cards

Trap

An error or exception condition generated synchronously within the currently running process (e.g., divide by zero or out-of-bounds access).

63
New cards

Time Slice

The maximum continuous duration of processor time allocated to a process before a clock interrupt forces a preemption.

64
New cards

Process Switch

A full transition of processor execution from one process to another, requiring context saving, PCB updates, queue movements, and context restoration.