第6章インフラストラクチャーの抽象化層：オペレーティングシステム

list of rules that specifies which users are granted the access to a specific object or resource

part of the OS that is responsible for enforcing access controls and protecting authentication and authorization information

set of addresses generated by programs as they reference instructions and data

stage of virtualization that occurs when the system needs to find a physical address in the memory that matches the virtual address

method that defines how data is stored in the memory by providing a set of requests for resources and identifying which processes should be given which resources to make the most efficient use of the resources

set of rules and tools that allows different software applications to communicate with each other

process of checking to see if a user’s credentials match the credentials in a database of authorized users or in a data authentication server

process of determining the relationship between principals, operations, and objects by defining which principals can perform which operations on which objects

logical access system that serves as a form of authentication

when a process is waiting for an event to occur

computer memory architecture where all memory is treated as cache, which allows for the dynamic allocation of data for optimized access and performance in multiprocessor environments

list of objects and operations for each user that defines the user rights and capabilities

virtualized and scalable hardware resources delivered over the Internet as a service

multiple activities and processes happening at the same time—in other words, the OS handling multiple tasks at once

computing model that improves the performance when multiple processors execute instructions simultaneously

synchronization mechanism that is used in conjunction with locks to allow threads to wait for certain conditions to become true

standardized unit of software that logically isolates an application enabling it to run independently of physical resources

procedure that a computer’s CPU follows to change from one task to another while ensuring that the tasks do not conflict

consists of the program counter (PC), the stack pointer (SP), and general-purpose registers

piece of code that only one thread can execute at once; also, only one thread at a time will get into this section of code

synchronization challenge that occurs when a set of threads are blocked forever, waiting for each other to release resources

storage mechanism in which pages should only allocate in the memory if it is required from the execution process

layer in the layered OS architecture that handles devices and provides buffering

interface view any device presents to a programmer where each I/O device appears in the physical address space of the machine as a few words

set of files that contains all the required information about the files such as attributes, location, and ownership, which is managed by the OS

file system that is distributed on multiple file servers or multiple locations that support network-wide sharing of files and devices

OS structure that is responsible for separating the user mode from the system mode

code is located and loaded when the program is first run

method that converts the data into secret code that hides the data’s true meaning

error that occurs at runtime

OS architecture that simplifies the operating system by making its core (kernel) really small and letting apps have more control over the computer’s hardware

feature of an OS that prevents errors in one part of an application from affecting the whole system

feature of an OS that helps the system to fix itself or revert to a previous state after an error

feature of an OS that allows the application to keep running even when errors occur

collection of related information that is stored on secondary/virtual storage; it’s the smallest storage unit from the user’s perspective

responsible for defining file names, storing files to a storage device, and retrieving files from storage devices

system that allows a file to exist in several versions at the same time, which gives the user complete control over file creation

scheduling algorithm that operates on a simple queue mechanism where the first process to request the CPU is the first to receive it (or the first element added to the queue is the first one to be removed); commonly used in resource scheduling and data buffering and also known as FIFO (first in, first out)

problem where the memory blocks cannot be allocated to the processes due to their small size and the blocks remain unused

portion of random access memory (RAM) containing a bitmap that drives a video display

memory virtualization approach that allows multiple operating systems to run concurrently on a single physical machine, fully isolated from each other, by emulating hardware resources through a hypervisor

extra register that is used for storing operands and pointers

visual interface that allows users to interact with electronic devices through graphical icons and visual indicators

in the context of virtualization, altering the guest operating system or its configuration to improve compatibility, performance, or integration with the virtualization environment or hypervisor

complete operating system inside a virtual machine

example of layering in modern OS that allows an OS to interact with a hardware device at a general or abstract level rather than going deep into a detailed hardware level; this improves readability

dynamic storage management approach that allocates the data in a tree-based data structure

tree-based data in process management

software layer between machine hardware and the operating systems that run on it

unique number given to an inode whenever an OS that uses inodes creates a new file, which, in effect, functions as the file’s name

situation that causes the system to produce errors or hardware failure

backup image containing the pages that have been updated from the time of the previous backup

structure used by file system that contains metadata about a file or directory but not its name

mechanism that enables processes to exchange data among different processes running on an operating system

signal to the processor from either software or hardware that indicate events that need immediate attention

ensures that the multiple programs that are running concurrently on the same CPU and memory operate independently without interfering with each other’s execution or data

OS architecture where the OS is implemented as a set of layers where each layer exposes an enhanced virtual machine to the layer above

synchronization mechanism that is used to enforce mutual exclusion

activities that enforce policies and often depend on the hardware on which the operating system runs

process of setting aside sections of memory in a program to be used to store variables and instances of structures and classes

process of freeing the space corresponding to finished processes when that space is needed by the rest of the system

dividing the capacity of the communication channel into multiple logical channels

OS architecture where the functionality and capabilities are added to a minimal core OS as plug-ins

OS architecture where the entire OS is working in kernel space

approach toward achieving concurrency that makes it possible for the OS to run multiple processes at the same time using time slicing

program that prevents simultaneous access to a shared resource

program that can run only in the user mode

computer memory architecture where memory access time varies depending on the memory’s location relative to a processor

core piece of software that typically manages the interconnection of hardware and software on a given computer

when the CPU demands a page, and this page is not present in the main memory

process of bringing pages into memory

layer in the layered OS architecture that implements virtual memories for each process

when one page in the DRAM is swapped to disk while the requested page is brought into DRAM

storage mechanism that uses a page form in retrieving process from secondary or virtual memory to main memory

data communication method between two processes that uses a specific name and standard I/O operations, and thus allows for data transfer within a file system; sometimes called named pipe

controls how to use a mechanism in specific situations, that is, choose what activities need to be done

type of computer memory that is the initial point of access for a processor and serves as direct storage for the CPU

holds data that can be directly accessed by the CPU with minimum or no delay and does not survive a power failure

instruction provided by the CPU that can be executed only by the OS

program that can run only in the system mode

any program that is running on top of the OS

data structure used by the operating system to store information about a process, including its state, process ID, registers, scheduling information, memory management details, and I/O status

unique identifier assigned by the operating system to each process running on a computer, used to track and manage process activities

when an OS manages the sharing of a system’s resources to avoid interference and errors

characteristics that are considered when designing an OS

general mechanism that is used throughout the OS for all resources that need to be protected, such as memory, processes, files, devices, CPU time, and network bandwidth

amount of space to store files based on the available memory space

when a process is waiting for the CPU

process of resolving or receiving treatment to solve OS faults or errors

system’s ability to reduce faults and ensure that the information in the system survives OS crashes and hardware failures

procedure that allows multiple copies of a file to exist in the network; this improves performance and availability

scheduling algorithm that is widely used in time-sharing systems and is designed to ensure fairness among processes by giving each process an equal share of the CPU

when a process is being executed by the CPU

type of computer memory that is nonvolatile and thus used for long-term storage, housing the operating system, applications, and data that need to persist even when the power is off

persistent memory that survives power failures most of the time such as spinning disks, SSDs, and USB drives

data type that an OS uses to control access to a resource

multiple processes can use the same piece of data concurrently

scheduling algorithm that prioritizes processes based on the shortest amount of time left to complete their execution

scheduling algorithm that takes the best approach to minimize the waiting time, but it requires that the processor knows the processing time in advance; also called shortest job first (SJF)

dynamic storage management approach that uses linear data structure that follows last in, first out (LIFO)

register that indicates the location of the last item that was added to the stack

data that does not change within the program

way of coordinating multiple concurrent activities that are using shared state

appears when the program requests a service from the kernel

manages the communication between the computer hardware and the system

when a computer’s operating system becomes overwhelmed by the number of processes requesting memory

smallest unit of execution within a process, allowing parallel tasks to run in the same memory space; it enables efficient and independent execution of sequences of instructions

short time frame that gets assigned to a process for CPU execution and facilitates multitasking

small memory cache that speeds up the computer’s memory access by storing recent virtual-to-physical address translations; if the TLB has the address translation, it quickly retrieves data; if not, the computer must search more slowly through its memory

form of authentication that involves two factors: the system calls or texts a user’s phone for the traditional password during login, employing the cell phone as a key

computer memory architecture where access time to any memory location is the same across all processors

software that is created to run like a physical computer and that operates its own operating system and applications like a separate physical server

allows a system to run different types of applications used by multiple users at a time on the same computer

total amount of memory a process requires during a specific period of activity; it is measured as the set of pages or data blocks the process accesses