# Operating system

> Mediated Wiki article. Canonical URL: https://mediated.wiki/source/Operating_system
> Markdown URL: https://mediated.wiki/source/Operating_system.md
> Source: https://en.wikipedia.org/wiki/Operating_system
> Source revision: 1353032791
> License: Creative Commons Attribution-ShareAlike 4.0 International (https://creativecommons.org/licenses/by-sa/4.0/)

Software that manages computer hardware resources

Operating systems Common features Process management Interrupts Memory management File system Device drivers Networking Security Input/output v t e

An **operating system** (**OS**) is [system software](/source/System_software) that manages [computer hardware](/source/Computer_hardware) and [software](/source/Software) resources, and provides common [services](/source/Daemon_(computing)) for [computer programs](/source/Computer_program).[1]

[Time-sharing](/source/Time-sharing) operating systems [schedule tasks](/source/Scheduler_(computing)) for efficient use of the system and may also include accounting software for cost allocation of [processor time](/source/Scheduling_(computing)), [mass storage](/source/Mass_storage), peripherals, and other resources.

For hardware functions such as [input and output](/source/Input_and_output) and [memory allocation](/source/Memory_allocation), the operating system acts as an intermediary between programs and the computer hardware,[2][3] although the application code is usually executed directly by the hardware and frequently makes [system calls](/source/System_call) to an OS function or is [interrupted](/source/Interrupt) by it. Operating systems are found on many devices that contain a computer – from cellular phones and video game consoles to [web servers](/source/Web_server) and [supercomputers](/source/Supercomputer).

As of November 2025[\[update\]](https://en.wikipedia.org/w/index.php?title=Operating_system&action=edit), [Android](/source/Android_(operating_system)) is the most popular operating system, with a 38% market share, followed by [Microsoft Windows](/source/Microsoft_Windows) at 33%, [iOS](/source/IOS) and [iPadOS](/source/IPadOS) at 15%, [macOS](/source/MacOS) at 4%, and [Linux](/source/Linux) at 1%. Android, iOS, and iPadOS are operating systems for mobile devices such as smartphones, while Windows, macOS, and Linux are for desktop computers.[4] [Linux distributions](/source/Linux_distribution) are dominant in the server and supercomputing sectors. Other specialized classes of operating systems (special-purpose operating systems),[5][6] such as [embedded](/source/Embedded_system) and real-time systems, exist for many applications. [Security-focused operating systems](/source/Security-focused_operating_system) also exist. Some operating systems have low system requirements (e.g. [light-weight Linux distribution](/source/Light-weight_Linux_distribution)). Others may have higher system requirements.

Some operating systems require installation or may come pre-installed with purchased computers ([OEM](/source/OEM)-installation), whereas others may run directly from media (i.e. [live CD](/source/Live_CD)) or flash memory (i.e. a LiveUSB from a [USB](/source/USB_flash_drive) stick).

## Definition and purpose

An operating system is difficult to define,[7] but has been called "the [layer of software](/source/Abstraction_layer) that manages a computer's resources for its users and their [applications](/source/Application_software)".[8] Operating systems include the software that is always running, called a [kernel](/source/Kernel_(operating_system))—but can include other software as well.[7][9] The two other types of programs that can run on a computer are [system programs](/source/System_software)—which are associated with the operating system, but may not be part of the kernel—and applications—all other software.[9]

There are three main purposes that an operating system fulfills:[10]

- Operating systems allocate resources between different applications, deciding when they will receive [central processing unit](/source/Central_processing_unit) (CPU) time or space in [memory](/source/Computer_memory).[10] On modern [personal computers](/source/Personal_computer), users often want to run several applications at once. In order to ensure that one program cannot monopolize the computer's limited hardware resources, the operating system gives each application a share of the resource, either in time (CPU) or space (memory).[11][12] The operating system also must isolate applications from each other to protect them from errors and security vulnerabilities in another application's code, but enable communications between different applications.[13]

- Operating systems provide an interface that abstracts the details of accessing [hardware](/source/Computer_hardware) details (such as physical memory) to make things easier for programmers.[10][14] [Virtualization](/source/Virtualization) also enables the operating system to mask limited hardware resources; for example, [virtual memory](/source/Virtual_memory) can provide a program with the illusion of nearly unlimited memory that exceeds the computer's actual memory.[15]

- Operating systems provide common services, such as an interface for accessing network and disk devices. This enables an application to be run on different hardware without needing to be rewritten.[16] Which services to include in an operating system varies greatly, and this functionality makes up the great majority of code for most operating systems.[17]

## Types of operating systems

### Multicomputer operating systems

With [multiprocessors](/source/Multiprocessor) multiple CPUs share memory. A [multicomputer](/source/Multicomputer) or [cluster computer](/source/Cluster_computer) has multiple CPUs, each of which [has its own memory](/source/Distributed_memory). Multicomputers were developed because large multiprocessors are difficult to engineer and prohibitively expensive;[18] they are universal in [cloud computing](/source/Cloud_computing) because of the size of the machine needed.[19] The different CPUs often need to send and receive messages to each other;[20] to ensure good performance, the operating systems for these machines need to minimize this copying of [packets](/source/Network_packet).[21] Newer systems are often [multiqueue](https://en.wikipedia.org/w/index.php?title=Multiqueue&action=edit&redlink=1)—separating groups of users into separate [queues](/source/Priority_queue)—to reduce the need for packet copying and support more concurrent users.[22] Another technique is [remote direct memory access](/source/Remote_direct_memory_access), which enables each CPU to access memory belonging to other CPUs.[20] Multicomputer operating systems often support [remote procedure calls](/source/Remote_procedure_call) where a CPU can call a [procedure](/source/Procedural_programming) on another CPU,[23] or [distributed shared memory](/source/Distributed_shared_memory), in which the operating system uses [virtualization](/source/Virtualization) to generate shared memory that does not physically exist.[24]

### Distributed systems

A [distributed system](/source/Distributed_system) is a group of distinct, [networked](/source/Computer_network) computers—each of which might have their own operating system and file system. Unlike multicomputers, they may be dispersed anywhere in the world.[25] [Middleware](/source/Middleware), an additional software layer between the operating system and applications, is often used to improve consistency. Although it functions similarly to an operating system, it is not a true operating system.[26]

### Embedded

[Embedded operating systems](/source/Embedded_operating_system) are designed to be used in [embedded computer systems](/source/Embedded_system), whether they are [internet of things](/source/Internet_of_things) objects or not connected to a network. Embedded systems include many household appliances. The distinguishing factor is that they do not load user-installed software. Consequently, they do not need protection between different applications, enabling simpler designs. Very small operating systems might run in less than 10 [kilobytes](/source/Kilobytes),[27] and the smallest are for [smart cards](/source/Smart_cards).[28] Examples include [Embedded Linux](/source/Embedded_Linux), [QNX](/source/QNX), [VxWorks](/source/VxWorks), and the extra-small systems [RIOT](/source/RIOT_(operating_system)) and [TinyOS](/source/TinyOS).[29]

### Real-time

A [real-time operating system](/source/Real-time_operating_system) is an operating system that guarantees to process [events](/source/Event_(computing)) or data by or at a specific moment in time. Hard real-time systems require exact timing and are common in [manufacturing](/source/Manufacturing), [avionics](/source/Avionics), military, and other similar uses.[29] With soft real-time systems, the occasional missed event is acceptable; this category often includes audio or multimedia systems, as well as smartphones.[29] In order for hard real-time systems be sufficiently exact in their timing, often they are just a library with no protection between applications, such as [eCos](/source/ECos).[29]

### Hypervisor

A [hypervisor](/source/Hypervisor) is an operating system that runs a [virtual machine](/source/Virtual_machine). The virtual machine is an application that emulates hardware; in other words, it operates as much as possible like the actual hardware the operating system was designed to run on.[15][30] Virtual machines can be paused, saved, and resumed, making them useful for operating systems research, development,[31] and debugging.[32] They also enhance portability by enabling applications to be run on a computer even if they are not compatible with the base operating system.[15]

### Library

A *library operating system* (libOS) is one in which the services that a typical operating system provides, such as networking, are provided in the form of [libraries](/source/Library_(computing)) and composed with a single application and configuration code to construct a [unikernel](/source/Unikernel): [33] a specialized (only the absolute necessary pieces of code are extracted from libraries and bound together [34]), [single address space](/source/Single_address_space_operating_system), machine image that can be deployed to cloud or embedded environments.

The operating system code and application code are not executed in separated [protection domains](/source/Protection_ring) (there is only a single application running, at least conceptually, so there is no need to prevent interference between applications) and OS services are accessed via simple library calls (potentially [inlining](/source/Inline_expansion) them based on compiler thresholds), without the usual overhead of [context switches](/source/Context_switch), [35] in a way similarly to embedded and real-time OSes. This overhead is not negligible: to the direct cost of mode switching it's necessary to add the indirect pollution of important processor structures (like [CPU caches](/source/CPU_cache), the [instruction pipeline](/source/Instruction_pipelining), and so on) which affects both user-mode and kernel-mode performance. [36]

## History

Main article: [History of operating systems](/source/History_of_operating_systems)

IBM System/360 Model 50 operator's console and CPU; the operator's console is a [terminal](/source/Computer_terminal) used by the operating system to communicate with the operator.

The first computers in the late 1940s and 1950s were directly programmed either with [plugboards](/source/Plugboard) or with [machine code](/source/Machine_code) inputted on media such as [punch cards](/source/Punch_card), without [programming languages](/source/Programming_language) or operating systems.[37] After the introduction of the [transistor](/source/Transistor) in the mid-1950s, [mainframes](/source/Mainframe) began to be built. These still needed professional operators[37] who manually do what a modern operating system would do, such as scheduling programs to run,[38] but mainframes still had rudimentary operating systems such as [Fortran Monitor System](/source/Fortran_Monitor_System) (FMS) and [IBSYS](/source/IBSYS).[39] In the 1960s, [IBM](/source/IBM) introduced the first series of intercompatible computers ([System/360](/source/System%2F360)). All of them ran the same operating system—[OS/360](/source/OS%2F360)—which consisted of millions of lines of [assembly language](/source/Assembly_language) that had thousands of [bugs](/source/Software_bug). The OS/360 also was the first popular operating system to support [multiprogramming](/source/Multiprogramming), such that, if one job is blocked waiting for an [input/output](/source/Input%2Foutput) (I/O) operation to complete, another job can use the CPU. Holding multiple jobs in [memory](/source/Memory_(computing)) required memory partitioning and safeguards against one job accessing the memory allocated to a different job.[40]

Around the same time, [teleprinters](/source/Teleprinter) began to be used as [terminals](/source/Computer_terminal) so multiple users could access the computer simultaneously. The operating system [MULTICS](/source/MULTICS) was intended to allow hundreds of users to access a large computer. Despite its limited adoption, it can be considered the precursor to [cloud computing](/source/Cloud_computing). The [UNIX](/source/UNIX) operating system originated as a development of MULTICS for a single user.[41] Because UNIX's [source code](/source/Source_code) was available, it became the basis of other, incompatible operating systems, of which the most successful were [AT&T](/source/AT%26T)'s [System V](/source/System_V) and the [University of California](/source/University_of_California)'s [Berkeley Software Distribution](/source/Berkeley_Software_Distribution) (BSD).[42] To increase compatibility, the [IEEE](/source/IEEE) released the [POSIX](/source/POSIX) standard for operating system [application programming interfaces](/source/Application_programming_interface) (APIs), which is supported by most UNIX systems. [MINIX](/source/MINIX) was a stripped-down version of UNIX, developed in 1987 for educational uses, that inspired the commercially available, [free software](/source/Free_software) [Linux](/source/Linux). Since 2008, MINIX is used in controllers of most [Intel](/source/Intel) [microchips](/source/Microchips), while Linux is widespread in [data centers](/source/Data_center) and [Android](/source/Android_(operating_system)) smartphones.[43]

### Microcomputers

[Command-line interface](/source/Command-line_interface) of the [MS-DOS](/source/MS-DOS) operating system

[Graphical user interface](/source/Graphical_user_interface) of a [Macintosh](/source/Macintosh)

The invention of [large scale integration](/source/Large_scale_integration) enabled the production of [personal computers](/source/Personal_computer) (initially called [microcomputers](/source/Microcomputer)) from around 1980.[44] For around five years, the [CP/M](/source/CP%2FM) (Control Program for Microcomputers) was the most popular operating system for microcomputers.[45] Later, IBM bought a [disk operating system](/source/Disk_operating_system) from [Microsoft](/source/Microsoft), which IBM sold as [IBM PC DOS](/source/IBM_PC_DOS) and Microsoft branded as [MS-DOS](/source/MS-DOS) (MicroSoft Disk Operating System) and was widely used on [IBM PC compatible](/source/IBM_PC_compatible) microcomputers. Later versions increased their sophistication, in part by borrowing features from UNIX.[45]

The first popular computer to use a [graphical user interface](/source/Graphical_user_interface) (GUI) was [Apple](/source/Apple_Inc.)'s [Macintosh](/source/Macintosh). The GUI proved much more [user friendly](/source/User_friendly) than the text-only [command-line interface](/source/Command-line_interface) of earlier operating systems. This success prompted Microsoft to add a GUI overlay to MS-DOS called [Windows](/source/Windows). Windows later was rewritten as a stand-alone operating system, [Windows NT](/source/Windows_NT), borrowing so many features from another OS ([VAX/VMS](/source/VAX%2FVMS)) that a large [legal settlement](/source/Legal_settlement) was paid.[46] In the 21st century, Windows continues to be popular on personal computers but has less [market share](/source/Market_share) of servers. UNIX operating systems, especially Linux, are the most popular on [enterprise systems](/source/Enterprise_system) and servers but are also used on [mobile devices](/source/Mobile_device) and many other computer systems.[47]

On mobile devices, [Symbian OS](/source/Symbian_OS) was dominant at first, being usurped by [BlackBerry OS](/source/BlackBerry_OS) (introduced 2002) and [iOS](/source/IOS) for [iPhones](/source/IPhone) (from 2007). Later on, the open-source [Android](/source/Android_(operating_system)) operating system (introduced 2008), with a Linux kernel and a C library ([Bionic](/source/Bionic_(software))) partially based on BSD code, became most popular.[48]

## Components

The components of an operating system are designed to ensure that various parts of a computer function cohesively. With the de facto obsoletion of [DOS](/source/Disk_Operating_System), all user [software](/source/Software) must interact with the operating system to access hardware.

### Kernel

Main article: [Kernel (operating system)](/source/Kernel_(operating_system))

The kernel is the part of the operating system that provides [protection](/source/Protection_ring) between different applications and users. This protection is key to improving reliability by keeping errors isolated to one program, as well as security by limiting the power of [malicious software](/source/Malicious_software) and protecting private data, and ensuring that one program cannot monopolize the computer's resources.[49] Most operating systems have two modes of operation:[50] in [user mode](/source/User_mode), the hardware checks that the software is only executing legal instructions, whereas the kernel has [unrestricted powers](/source/Privilege_(computing)) and is not subject to these checks.[51] The kernel also manages [memory](/source/Random-access_memory) for other processes and controls access to [input/output](/source/Input%2Foutput) devices.[52]

#### Program execution

A kernel connects the application software to the hardware of a computer.

The operating system provides an interface between an application program and the computer hardware, so that an application program can interact with the hardware only by obeying rules and procedures programmed into the operating system. The operating system is also a set of services which simplify development and execution of application programs. Executing an application program typically involves the creation of a [process](/source/Process_(computing)) by the operating system [kernel](/source/Kernel_(operating_system)), which assigns memory space and other resources, establishes a priority for the process in multi-tasking systems, loads program binary code into memory, and initiates execution of the application program, which then interacts with the user and with hardware devices. However, in some systems an application can request that the operating system execute another application within the same process, either as a subroutine or in a separate thread, e.g., the **LINK** and **ATTACH** facilities of [OS/360 and successors](/source/OS%2F360_and_successors).

#### Interrupts

Main article: [Interrupt](/source/Interrupt)

An [interrupt](/source/Interrupt) (also known as an [abort](/source/Abort_(computing)), [exception](/source/Exception_handling), *fault*, [signal](/source/Signal_(IPC)),[53] or *trap*)[54] provides an efficient way for most operating systems to react to the environment. Interrupts cause the [central processing unit](/source/Central_processing_unit) (CPU) to have a [control flow](/source/Control_flow) change away from the currently running program to an [interrupt handler](/source/Interrupt_handler), also known as an interrupt service routine (ISR).[55][56] An interrupt service routine may cause the [central processing unit](/source/Central_processing_unit) (CPU) to have a [context switch](/source/Context_switch).[57][a] The details of how a computer processes an interrupt vary from architecture to architecture, and the details of how interrupt service routines behave vary from operating system to operating system.[58] However, several interrupt functions are common.[58] The architecture and operating system must:[58]

1. transfer control to an interrupt service routine.

1. save the state of the currently running process.

1. restore the state after the interrupt is serviced.

#### Software interrupt

A software interrupt is a message to a [process](/source/Process_(computing)) that an event has occurred.[53] This contrasts with a *hardware interrupt* — which is a message to the [central processing unit](/source/Central_processing_unit) (CPU) that an event has occurred.[59] Software interrupts are similar to hardware interrupts — there is a change away from the currently running process.[60] Similarly, both hardware and software interrupts execute an [interrupt service routine](/source/Interrupt_handler).

Software interrupts may be normally occurring events. It is expected that a [time slice](/source/Preemption_(computing)#Time_slice) will occur, so the kernel will have to perform a [context switch](/source/Context_switch).[61] A [computer program](/source/Computer_program) may set a timer to go off after a few seconds in case too much data causes an algorithm to take too long.[62]

Software interrupts may be error conditions, such as a malformed [machine instruction](/source/Machine_code).[62] However, the most common error conditions are [division by zero](/source/Division_by_zero) and [accessing an invalid memory address](/source/Segmentation_fault).[62]

[Users](/source/User_(computing)) can send messages to the kernel to modify the behavior of a currently running process.[62] For example, in the [command-line environment](/source/Command-line_interface), pressing the *interrupt character* (usually [Control-C](/source/Control-C)) might terminate the currently running process.[62]

To generate *software interrupts* for [x86](/source/X86) CPUs, the [INT](/source/INT_(x86_instruction)) [assembly language](/source/Assembly_language) instruction is available.[63] The syntax is INT X, where X is the offset number (in [hexadecimal](/source/Hexadecimal) format) to the [interrupt vector table](/source/Interrupt_vector_table).

#### Signal

To generate *software interrupts* in [Unix-like](/source/Unix-like) operating systems, the kill(pid,signum) [system call](/source/System_call) will send a [signal](/source/Signal_(IPC)) to another process.[64] pid is the [process identifier](/source/Process_identifier) of the receiving process. signum is the signal number (in [mnemonic](/source/Mnemonic) format)[b] to be sent. (The abrasive name of kill was chosen because early implementations only terminated the process.)[65]

In Unix-like operating systems, *signals* inform processes of the occurrence of asynchronous events.[64] To communicate asynchronously, interrupts are required.[66] One reason a process needs to asynchronously communicate to another process solves a variation of the classic [reader/writer problem](/source/Readers%E2%80%93writers_problem).[67] The writer receives a pipe from the [shell](/source/Shell_(computing)) for its output to be sent to the reader's input stream.[68] The [command-line](/source/Command-line_interface) syntax is alpha | bravo. alpha will write to the pipe when its computation is ready and then sleep in the wait queue.[69] bravo will then be moved to the [ready queue](/source/Multilevel_feedback_queue) and soon will read from its input stream.[70] The kernel will generate *software interrupts* to coordinate the piping.[70]

*Signals* may be classified into 7 categories.[64] The categories are:

1. when a process finishes normally.

1. when a process has an error exception.

1. when a process runs out of a system resource.

1. when a process executes an illegal instruction.

1. when a process sets an alarm event.

1. when a process is aborted from the keyboard.

1. when a process has a tracing alert for debugging.

#### Hardware interrupt

[Input/output](/source/Input%2Foutput) (I/O) [devices](/source/Peripheral) are slower than the CPU. Therefore, it would slow down the computer if the CPU had to [wait](/source/Busy_waiting) for each I/O to finish. Instead, a computer may implement interrupts for I/O completion, avoiding the need for [polling](/source/Polling_(computer_science)) or busy waiting.[71]

Some computers require an interrupt for each character or word, costing a significant amount of CPU time. [Direct memory access](/source/Direct_memory_access) (DMA) is an architecture feature to allow devices to bypass the CPU and access [main memory](/source/Random-access_memory) directly.[72] (Separate from the architecture, a device may perform direct memory access[c] to and from main memory either directly or via a bus.)[73][d]

#### Input/output

#### Drivers

This section needs expansion. You can help by making an edit requestadding missing information. (January 2026)

The operating system includes [device drivers](/source/Device_drivers) to access input/output devices.

#### Interrupt-driven I/O

This section needs expansion. You can help by making an edit requestadding missing information. (April 2022)

When a [computer user](/source/User_(computing)) types a key on the keyboard, typically the character appears immediately on the screen. Likewise, when a user moves a [mouse](/source/Computer_mouse), the [cursor](/source/Cursor_(user_interface)) immediately moves across the screen. Each keystroke and mouse movement generates an *interrupt* called *Interrupt-driven I/O*. An interrupt-driven I/O occurs when a process causes an interrupt for every character[73] or word[74] transmitted.

#### Direct memory access

Devices such as [hard disk drives](/source/Hard_disk_drive), [solid-state drives](/source/Solid-state_drive), and [magnetic tape](/source/Magnetic_tape) drives can transfer data at a rate high enough that interrupting the CPU for every byte or word transferred, and having the CPU transfer the byte or word between the device and memory, would require too much CPU time. Data is, instead, transferred between the device and memory independently of the CPU by hardware such as a [channel](/source/Channel_I%2FO) or a [direct memory access](/source/Direct_memory_access) controller; an interrupt is delivered only when all the data is transferred.[75]

If a [computer program](/source/Computer_program) executes a [system call](/source/System_call) to perform a block I/O *write* operation, then the system call might execute the following instructions:

- Set the contents of the CPU's [registers](/source/Processor_register) (including the [program counter](/source/Program_counter)) into the [process control block](/source/Process_control_block).[76]

- Create an entry in the device-status table.[77] The operating system maintains this table to keep track of which processes are waiting for which devices. One field in the table is the [memory address](/source/Memory_address) of the process control block.

- Place all the characters to be sent to the device into a [memory buffer](/source/Random-access_memory).[66]

- Set the memory address of the memory buffer to a predetermined device register.[78]

- Set the buffer size (an integer) to another predetermined register.[78]

- Execute the [machine instruction](/source/Machine_code) to begin the writing.

- Perform a [context switch](/source/Context_switch) to the next process in the [ready queue](/source/Multilevel_feedback_queue).

While the writing takes place, the operating system will context switch to other processes as normal. When the device finishes writing, the device will *interrupt* the currently running process by *asserting* an [interrupt request](/source/Interrupt_request_(PC_architecture)). The device will also place an integer onto the data bus.[79] Upon accepting the interrupt request, the operating system will:

- Push the contents of the [program counter](/source/Program_counter) (a register) followed by the [status register](/source/Status_register) onto the [call stack](/source/Call_stack).[58]

- Push the contents of the other registers onto the call stack. (Alternatively, the contents of the registers may be placed in a system table.)[79]

- Read the integer from the data bus. The integer is an offset to the [interrupt vector table](/source/Interrupt_vector_table). The vector table's instructions will then:

- - Access the device-status table. - Extract the process control block. - Perform a context switch back to the writing process.

When the writing process has its [time slice](/source/Preemption_(computing)#time_slice) expired, the operating system will:[80]

- Pop from the call stack the registers other than the status register and program counter.

- Pop from the call stack the status register.

- Pop from the call stack the address of the next instruction, and set it back into the program counter.

With the program counter now reset, the interrupted process will resume its time slice.[58]

#### Memory management

Main article: [Memory management](/source/Memory_management)

Among other things, a multiprogramming operating system [kernel](/source/Kernel_(operating_system)) must be responsible for managing all system memory which is currently in use by the programs. This ensures that a program does not interfere with memory already in use by another program. Since programs time share, each program must have independent access to memory.

Cooperative memory management, used by many early operating systems, assumes that all programs make voluntary use of the [kernel](/source/Kernel_(operating_system))'s memory manager, and do not exceed their allocated memory. This system of memory management is almost never seen anymore, since programs often contain bugs which can cause them to exceed their allocated memory. If a program fails, it may cause memory used by one or more other programs to be affected or overwritten. Malicious programs or viruses may purposefully alter another program's memory, or may affect the operation of the operating system itself. With cooperative memory management, it takes only one misbehaved program to [crash](/source/Crash_(computing)) the system.

[Memory protection](/source/Memory_protection) enables the [kernel](/source/Kernel_(operating_system)) to limit a process' access to the computer's memory. Various methods of memory protection exist, including [memory segmentation](/source/Memory_segmentation) and [paging](/source/Paging). All methods require some level of hardware support (such as the [80286](/source/80286) MMU), which does not exist in all computers.

In both segmentation and paging, certain [protected mode](/source/Protected_mode) registers specify to the CPU what memory address it should allow a running program to access. Attempts to access other addresses trigger an interrupt, which causes the CPU to re-enter [supervisor mode](/source/Supervisor_mode), placing the [kernel](/source/Kernel_(operating_system)) in charge. This is called a [segmentation violation](/source/Segmentation_violation) or Seg-V for short, and since it is both difficult to assign a meaningful result to such an operation, and because it is usually a sign of a misbehaving program, the [kernel](/source/Kernel_(operating_system)) generally resorts to terminating the offending program, and reports the error.

Windows versions 3.1 through ME had some level of memory protection, but programs could easily circumvent the need to use it. A [general protection fault](/source/General_protection_fault) would be produced, indicating a segmentation violation had occurred; however, the system would often crash anyway.

#### Virtual memory

Main article: [Virtual memory](/source/Virtual_memory)

Further information: [Page fault](/source/Page_fault)

Many operating systems can "trick" programs into using memory scattered around the hard disk and RAM as if it is one continuous chunk of memory, called virtual memory.

The use of virtual memory addressing (such as paging or segmentation) means that the kernel can choose what memory each program may use at any given time, allowing the operating system to use the same memory locations for multiple tasks.

If a program tries to access memory that is not accessible[e] memory, but nonetheless has been allocated to it, the kernel is interrupted (see [§ Memory management](#Memory_management)). This kind of interrupt is typically a [page fault](/source/Page_fault).

When the kernel detects a page fault it generally adjusts the virtual memory range of the program which triggered it, granting it access to the memory requested. This gives the kernel discretionary power over where a particular application's memory is stored, or even whether or not it has been allocated yet.

In modern operating systems, memory which is accessed less frequently can be temporarily stored on a disk or other media to make that space available for use by other programs. This is called [swapping](/source/Paging), as an area of memory can be used by multiple programs, and what that memory area contains can be swapped or exchanged on demand.

Virtual memory provides the programmer or the user with the perception that there is a much larger amount of RAM in the computer than is really there.[81]

### Concurrency

See also: [Computer multitasking](/source/Computer_multitasking) and [Process management (computing)](/source/Process_management_(computing))

[Concurrency](/source/Concurrency_(computer_science)) refers to the operating system's ability to carry out multiple tasks simultaneously.[82] Virtually all modern operating systems support concurrency.[83]

[Threads](/source/Thread_(computing)) enable splitting a process' work into multiple parts that can run simultaneously.[84] The number of threads is not limited by the number of processors available. If there are more threads than processors, the operating system [kernel](/source/Kernel_(operating_system)) schedules, suspends, and resumes threads, controlling when each thread runs and how much CPU time it receives.[85] During a [context switch](/source/Context_switch) a running thread is suspended, its state is saved into the [thread control block](/source/Thread_control_block) and stack, and the state of the new thread is loaded in.[86] Historically, on many systems a thread could run until it relinquished control ([cooperative multitasking](/source/Cooperative_multitasking)). Because this model can allow a single thread to monopolize the processor, most operating systems now can [interrupt](/source/Interrupt) a thread ([preemptive multitasking](/source/Preemptive_multitasking)).[87]

Threads have their own thread ID, [program counter](/source/Program_counter) (PC), a [register](/source/Processor_register) set, and a [stack](/source/Stack-based_memory_allocation), but share code, [heap](/source/Heap_memory) data, and other resources with other threads of the same process.[88][89] Thus, there is less overhead to create a thread than a new process.[90] On single-CPU systems, concurrency is switching between processes. Many computers have multiple CPUs.[91] [Parallelism](/source/Parallel_computing) with multiple threads running on different CPUs can speed up a program, depending on how much of it can be executed concurrently.[92]

### File system

Main article: [File system](/source/File_system)

See also: [Virtual file system](/source/Virtual_file_system)

[File systems](/source/File_system) allow users and programs to organize and sort files on a computer, often through the use of [directories](/source/Directory_(computing)) (or folders).

Permanent storage devices used in twenty-first century computers, unlike [volatile](/source/Volatile_memory) [dynamic random-access memory](/source/Dynamic_random-access_memory) (DRAM), are still accessible after a [crash](/source/Crash_(computing)) or [power failure](/source/Power_failure). Permanent ([non-volatile](/source/Non-volatile_memory)) storage is much cheaper per byte, but takes several orders of magnitude longer to access, read, and write.[93][94] The two main technologies are a [hard drive](/source/Hard_drive) consisting of [magnetic disks](/source/Magnetic_disk), and [flash memory](/source/Flash_memory) (a [solid-state drive](/source/Solid-state_drive) that stores data in electrical circuits). The latter is more expensive but faster and more durable.[95][96]

[File systems](/source/File_system) are an [abstraction](/source/Abstraction) used by the operating system to simplify access to permanent storage. They provide human-readable [filenames](/source/Filenames) and other [metadata](/source/Metadata), increase performance via [amortization](/source/Amortization_(computer_science)) of accesses, prevent multiple threads from accessing the same section of memory, and include [checksums](/source/Checksums) to identify [corruption](/source/Data_corruption).[97] File systems are composed of files (named collections of data, of an arbitrary size) and [directories](/source/Directory_(computing)) (also called folders) that list human-readable filenames and other directories.[98] An absolute [file path](/source/File_path) begins at the [root directory](/source/Root_directory) and lists [subdirectories](/source/Subdirectories) divided by punctuation, while a relative path defines the location of a file from a directory.[99][100]

[System calls](/source/System_call) (which are sometimes [wrapped](/source/Wrapper_function) by libraries) enable applications to create, delete, open, and close files, as well as link, read, and write to them. All these operations are carried out by the operating system on behalf of the application.[101] The operating system's efforts to reduce latency include storing recently requested blocks of memory in a [cache](/source/Cache_(computing)) and [prefetching](/source/Prefetching) data that the application has not asked for, but might need next.[102] [Device drivers](/source/Device_driver) are software specific to each [input/output](/source/Input%2Foutput) (I/O) device that enables the operating system to work without modification over different hardware.[103][104]

Another component of file systems is a [dictionary](/source/Associative_array) that maps a file's name and metadata to the [data block](/source/Data_block) where its contents are stored.[105] Most file systems use directories to convert file names to file numbers. To find the block number, the operating system uses an [index](/source/Database_index) (often implemented as a [tree](/source/Tree_(data_structure))).[106] Separately, there is a free space [map](/source/Map_(data_structure)) to track free blocks, commonly implemented as a [bitmap](/source/Bitmap).[106] Although any free block can be used to store a new file, many operating systems try to group together files in the same directory to maximize performance, or periodically reorganize files to reduce [fragmentation](/source/File_system_fragmentation).[107]

Maintaining data reliability in the face of a computer crash or hardware failure is another concern.[108] File writing protocols are designed with atomic operations so as not to leave permanent storage in a partially written, inconsistent state in the event of a crash at any point during writing.[109] Data corruption is addressed by redundant storage (for example, RAID—[redundant array of inexpensive disks](/source/Redundant_array_of_inexpensive_disks))[110][111] and [checksums](/source/Checksums) to detect when data has been corrupted. With multiple layers of checksums and backups of a file, a system can recover from multiple hardware failures. Background processes are often used to detect and recover from data corruption.[111]

### Networking

This section needs expansion. You can help by making an edit requestadding missing information. (January 2026)

Modern operating systems usually include a [network stack](/source/Network_stack), such as the [TCP/IP](/source/TCP%2FIP) protocol stack.

### Security

Main article: [Computer security](/source/Computer_security)

Security means protecting users from other users of the same computer, as well as from those who seeking remote access to it over a network.[112] Operating systems security rests on achieving the [CIA triad](/source/CIA_triad): confidentiality (unauthorized users cannot access data), integrity (unauthorized users cannot modify data), and availability (ensuring that the system remains available to authorized users, even in the event of a [denial of service attack](/source/Denial_of_service_attack)).[113] As with other computer systems, isolating [security domains](/source/Security_domain)—in the case of operating systems, the kernel, processes, and [virtual machines](/source/Virtual_machine)—is key to achieving security.[114] Other ways to increase security include simplicity to minimize the [attack surface](/source/Attack_surface), locking access to resources by default, checking all requests for authorization, [principle of least authority](/source/Principle_of_least_authority) (granting the minimum privilege essential for performing a task), [privilege separation](/source/Privilege_separation), and reducing shared data.[115]

Some operating system designs are more secure than others. Those with no isolation between the kernel and applications are least secure, while those with a [monolithic kernel](/source/Monolithic_kernel) like most general-purpose operating systems are still vulnerable if any part of the kernel is compromised. A more secure design features [microkernels](/source/Microkernel) that separate the kernel's privileges into many separate security domains and reduce the consequences of a single kernel breach.[116] [Unikernels](/source/Unikernel) are another approach that improves security by minimizing the kernel and separating out other operating systems functionality by application.[116]

Most operating systems are written in [C](/source/C_(programming_language)) or [C++](/source/C%2B%2B), which create potential vulnerabilities for exploitation. Despite attempts to protect against them, vulnerabilities are caused by [buffer overflow](/source/Buffer_overflow) attacks, which are enabled by the lack of [bounds checking](/source/Bounds_checking).[117] Hardware vulnerabilities, some of them [caused by CPU optimizations](/source/Speculative_execution_CPU_vulnerabilities), can also be used to compromise the operating system.[118] There are known instances of operating system programmers deliberately implanting vulnerabilities, such as [back doors](/source/Backdoor_(computing)).[119]

Operating systems security is hampered by their increasing complexity and the resulting inevitability of bugs.[120] Because [formal verification](/source/Formal_verification) of operating systems may not be feasible, developers use operating system [hardening](/source/Hardening_(computing)) to reduce vulnerabilities,[121] e.g. [address space layout randomization](/source/Address_space_layout_randomization), [control-flow integrity](/source/Control-flow_integrity),[122] [access restrictions](/source/Access-control_list),[123] and other techniques.[124] There are no restrictions on who can contribute code to open source operating systems; such operating systems have transparent change histories and distributed governance structures.[125] Open source developers strive to work collaboratively to find and eliminate security vulnerabilities, using [code review](/source/Code_review) and [type checking](/source/Type_checking) to expunge malicious code.[126][127] [Andrew S. Tanenbaum](/source/Andrew_S._Tanenbaum) advises releasing the [source code](/source/Source_code) of all operating systems, arguing that it prevents developers from placing trust in secrecy and thus relying on the unreliable practice of [security by obscurity](/source/Security_by_obscurity).[128]

### User interface

Main article: [Operating system user interface](/source/Shell_(computing))

A [user interface](/source/User_interface) (UI) is essential to support human interaction with a computer. The two most common user interface types for any computer are

- [command-line interface](/source/Command-line_interface), where computer commands are typed, line-by-line,

- [graphical user interface](/source/Graphical_user_interface) (GUI) using a visual environment, most commonly a combination of the window, icon, menu, and pointer elements, also known as [WIMP](/source/WIMP_(computing)).

For personal computers, including [smartphones](/source/Smartphone) and [tablet computers](/source/Tablet_computer), and for [workstations](/source/Workstation), user input is typically from a combination of [keyboard](/source/Keyboard_technology), [mouse](/source/Mouse_(computing)), and [trackpad](/source/Trackpad) or [touchscreen](/source/Touchscreen), all of which are connected to the operating system with specialized software.[129] Personal computer users who are not software developers or coders often prefer GUIs for both input and output; GUIs are supported by most personal computers.[130] The software to support GUIs is more complex than a command line for input and plain text output. Plain text output is often preferred by programmers, and is easy to support.[131]

## Operating system development as a hobby

Main article: [Hobbyist operating system](/source/Hobbyist_operating_system)

A hobby operating system may be classified as one whose code has not been directly derived from an existing operating system, and has few users and active developers.[132]

In some cases, hobby development is in support of a "[homebrew](/source/Homebrew_Computer_Club)" computing device, for example, a simple [single-board computer](/source/Single-board_computer) powered by a [6502 microprocessor](/source/MOS_Technology_6502). Or, development may be for an architecture already in widespread use. Operating system development may come from entirely new concepts, or may commence by modeling an existing operating system. In either case, the hobbyist is her/his own developer, or may interact with a small and sometimes unstructured group of individuals who have like interests.

Examples of hobby operating systems include [Syllable](/source/Syllable_Desktop) and [TempleOS](/source/TempleOS).

## Diversity of operating systems and portability

If an application is written for use on a specific operating system, and is [ported](/source/Ported) to another OS, the functionality required by that application may be implemented differently by that OS (the names of functions, meaning of arguments, etc.) requiring the application to be adapted, changed, or otherwise [maintained](/source/Software_maintenance).

This cost in supporting operating systems diversity can be avoided by instead writing applications for [software platforms](/source/Software_platform) such as [Java](/source/Java_(software_platform)) or [Qt](/source/Qt_(software)). These abstractions have already borne the cost of adaptation to specific operating systems and their [system libraries](/source/System_library).

Another approach is for operating system vendors to adopt standards. For example, [POSIX](/source/POSIX) and [OS abstraction layers](/source/Operating_system_abstraction_layer) provide commonalities that reduce porting costs.

## Popular operating systems

Further information: [Usage share of operating systems](/source/Usage_share_of_operating_systems) and [Comparison of operating systems](/source/Comparison_of_operating_systems)

As of October 2025[\[update\]](https://en.wikipedia.org/w/index.php?title=Operating_system&action=edit), [Android](/source/Android_(operating_system)), based on the Linux kernel, is the most popular operating system with a 38% market share, followed by [Microsoft Windows](/source/Microsoft_Windows) at 31%, [iOS](/source/IOS) and [iPadOS](/source/IPadOS) at 15%, [macOS](/source/MacOS) at 7%, and [Linux](/source/Linux) at 1%. Android, iOS, and iPadOS are [mobile operating systems](/source/Mobile_operating_system), while Windows, macOS, and Linux are desktop operating systems.[4]

### Linux

Main article: [Linux](/source/Linux)

[Layers](/source/Abstraction_layer) of a Linux system

[Linux](/source/Linux) is [free software](/source/Free_software) distributed under the [GNU General Public License](/source/GNU_General_Public_License) (GPL), which means that all of its derivatives are legally required to release their [source code](/source/Source_code).[133] Linux was designed by programmers for their own use, thus emphasizing simplicity and consistency, with a small number of basic elements that can be combined in nearly unlimited ways, and avoiding redundancy.[134]

Its design is similar to other UNIX systems not using a [microkernel](/source/Microkernel).[135] It is written in [C](/source/C_(programming_language))[136] and uses [UNIX System V](/source/UNIX_System_V) syntax, but also supports [BSD](/source/BSD) syntax. Linux supports standard UNIX networking features, as well as the full suite of UNIX tools, while [supporting multiple users](/source/Multiuser) and employing [preemptive multitasking](/source/Preemptive_multitasking). Initially of a minimalist design, Linux is a flexible system that can work in under 16 [MB](/source/Megabytes) of [RAM](/source/RAM), but still is used on large [multiprocessor](/source/Multiprocessor) systems.[135] Similar to other UNIX systems, Linux [distributions](/source/Linux_distribution) are composed of a [kernel](/source/Linux_kernel), [system libraries](/source/System_library), and [system utilities](/source/System_utilities).[137] Linux has a [graphical user interface](/source/Graphical_user_interface) (GUI) with a desktop, folder and file icons, as well as the option to access the operating system via a [command line](/source/Command_line).[138]

[Android](/source/Android_(operating_system)) is a partially open-source operating system closely based on Linux and has become the most widely used operating system by users, due to its popularity on [smartphones](/source/Smartphones) and, to a lesser extent, [embedded systems](/source/Embedded_system) needing a GUI, such as "[smart watches](/source/Smart_watch), [automotive dashboards](/source/Android_Automotive), airplane seatbacks, [medical devices](/source/Medical_devices), and [home appliances](/source/Home_appliance)".[139] Unlike Linux, much of Android is written in [Java](/source/Java_(programming_language)) and uses [object-oriented design](/source/Object-oriented_design).[140]

### Microsoft Windows

Main article: [Microsoft Windows](/source/Microsoft_Windows)

Security descriptor for a file that is read-only by default, specified no access for Elvis, read/write access for Cathy, and full access for Ida, the owner of the file[141]

Windows is a [proprietary](/source/Proprietary) operating system that is widely used on desktop computers, laptops, tablets, phones, [workstations](/source/Workstation), [enterprise servers](/source/Enterprise_server), and [Xbox](/source/Xbox) consoles.[142] The operating system was designed for "security, reliability, compatibility, high performance, extensibility, portability, and international support"—later on, [energy efficiency](https://en.wikipedia.org/w/index.php?title=Energy_efficiency_in_operating_systems&action=edit&redlink=1) and support for [dynamic devices](https://en.wikipedia.org/w/index.php?title=Dynamic_device&action=edit&redlink=1) also became priorities.[143]

[Windows Executive](/source/Windows_Executive) works via [kernel-mode objects](/source/Object_Manager_(Windows)) for important data structures like processes, threads, and sections (memory objects, for example files).[144] The operating system supports [demand paging](/source/Demand_paging) of [virtual memory](/source/Virtual_memory), which speeds up I/O for many applications. I/O [device drivers](/source/Device_drivers) use the [Windows Driver Model](/source/Windows_Driver_Model).[144] The [NTFS](/source/NTFS) file system has a master table and each file is represented as a [record](/source/Record_(computer_science)) with [metadata](/source/Metadata).[145] The scheduling includes [preemptive multitasking](/source/Preemptive_multitasking).[146] Windows has many security features;[147] especially important are the use of [access-control lists](/source/Access-control_list) and [integrity levels](/source/Safety_integrity_level). Every process has an authentication token and each object is given a security descriptor. Later releases have added even more security features.[145]

## See also

- [Comparison of operating systems](/source/Comparison_of_operating_systems)

- [DBOS](/source/DBOS)

- [Interruptible operating system](/source/Interruptible_operating_system)

- [List of operating systems](/source/List_of_operating_systems)

- [List of pioneers in computer science](/source/List_of_pioneers_in_computer_science)

- [Glossary of operating systems terms](/source/Glossary_of_operating_systems_terms)

- [Microcontroller](/source/Microcontroller)

- [Network operating system](/source/Network_operating_system)

- [Object-oriented operating system](/source/Object-oriented_operating_system)

- [Lisp machine](/source/Lisp_machine)

- [Operating System Projects](/source/Operating_System_Projects)

- [System Commander](/source/System_Commander)

- [System image](/source/System_image)

- [Timeline of operating systems](/source/Timeline_of_operating_systems)

## Notes

1. **[^](#cite_ref-58)** Modern CPUs provide instructions (e.g. SYSENTER) to invoke selected kernel services without an interrupts. Visit [https://wiki.osdev.org/SYSENTER](https://wiki.osdev.org/SYSENTER) for more information.

1. **[^](#cite_ref-66)** Examples include [SIGINT](/source/Signal_(IPC)#SIGINT), [SIGSEGV](/source/SIGSEGV), and [SIGBUS](/source/SIGBUS).

1. **[^](#cite_ref-75)** often in the form of a DMA chip for smaller systems and I/O channels for larger systems

1. **[^](#cite_ref-77)** Modern [motherboards](/source/Motherboard) have a DMA controller. Additionally, a device may also have one. Visit [SCSI RDMA Protocol](/source/SCSI_RDMA_Protocol).

1. **[^](#cite_ref-85)** There are several reasons that the memory might be inaccessible - The address might be out of range - The address might refer to a page or segment that has been moved to a backing store - The address might refer to memory that has restricted access due to, e.g., [key](/source/Memory_protection#Protection_keys), [ring](/source/Memory_protection#Protection_rings).

## References

1. **[^](#cite_ref-1)** [https://arxiv.org/pdf/2411.17710](https://arxiv.org/pdf/2411.17710) Operating System research article

1. **[^](#cite_ref-2)** Stallings (2005). *Operating Systems, Internals and Design Principles*. Pearson: Prentice Hall. p. 6.

1. **[^](#cite_ref-3)** Dhotre, I.A. (2009). *Operating Systems*. Technical Publications. p. 1.

1. ^ [***a***](#cite_ref-gs.statcounter.com_4-0) [***b***](#cite_ref-gs.statcounter.com_4-1) ["Operating System Market Share Worldwide"](https://gs.statcounter.com/os-market-share). *StatCounter Global Stats*. Retrieved 20 December 2024.

1. **[^](#cite_ref-auto_5-0)** Silberschatz, Abraham; Galvin, Peter B.; Gagne, Greg (2005). [*VII. Special-Purpose Systems - Operating System Concepts, Seventh Edition \[Book\]*](https://www.oreilly.com/library/view/operating-system-concepts/9780471694663/pt07.html). Wiley. [ISBN](/source/ISBN_(identifier)) [978-0-471-69466-3](https://en.wikipedia.org/wiki/Special:BookSources/978-0-471-69466-3). [Archived](https://web.archive.org/web/20210613190049/https://www.oreilly.com/library/view/operating-system-concepts/9780471694663/pt07.html) from the original on 13 June 2021. Retrieved 8 February 2021. {{[cite book](https://en.wikipedia.org/wiki/Template:Cite_book)}}: |website= ignored ([help](https://en.wikipedia.org/wiki/Help:CS1_errors#periodical_ignored))

1. **[^](#cite_ref-6)** ["Special-Purpose Operating Systems - RWTH AACHEN UNIVERSITY Institute for Automation of Complex Power Systems - English"](https://www.acs.eonerc.rwth-aachen.de/cms/E-ON-ERC-ACS/Studium/Lehrveranstaltungen/~lrhs/Spezial-Betriebssysteme/?lidx=1). *www.acs.eonerc.rwth-aachen.de*. [Archived](https://web.archive.org/web/20210614034001/https://www.acs.eonerc.rwth-aachen.de/cms/E-ON-ERC-ACS/Studium/Lehrveranstaltungen/~lrhs/Spezial-Betriebssysteme/?lidx=1) from the original on 14 June 2021. Retrieved 8 February 2021.

1. ^ [***a***](#cite_ref-FOOTNOTETanenbaumBos20234_7-0) [***b***](#cite_ref-FOOTNOTETanenbaumBos20234_7-1) [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 4.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin20146_8-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), p. 6.

1. ^ [***a***](#cite_ref-FOOTNOTESilberschatz_et_al.20186_9-0) [***b***](#cite_ref-FOOTNOTESilberschatz_et_al.20186_9-1) [Silberschatz et al. 2018](#CITEREFSilberschatz_et_al.2018), p. 6.

1. ^ [***a***](#cite_ref-FOOTNOTEAndersonDahlin20147_10-0) [***b***](#cite_ref-FOOTNOTEAndersonDahlin20147_10-1) [***c***](#cite_ref-FOOTNOTEAndersonDahlin20147_10-2) [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), p. 7.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin20149–10_11-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), pp. 9–10.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos20236–7_12-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), pp. 6–7.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin201410_13-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), p. 10.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos20235_14-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 5.

1. ^ [***a***](#cite_ref-FOOTNOTEAndersonDahlin201411_15-0) [***b***](#cite_ref-FOOTNOTEAndersonDahlin201411_15-1) [***c***](#cite_ref-FOOTNOTEAndersonDahlin201411_15-2) [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), p. 11.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin20147,_9,_13_16-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), pp. 7, 9, 13.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin201412–13_17-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), pp. 12–13.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023557_18-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 557.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023558_19-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 558.

1. ^ [***a***](#cite_ref-FOOTNOTETanenbaumBos2023565_20-0) [***b***](#cite_ref-FOOTNOTETanenbaumBos2023565_20-1) [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 565.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023562_21-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 562.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023563_22-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 563.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023569_23-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 569.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023571_24-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 571.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023579_25-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 579.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023581_26-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 581.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos202337–38_27-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), pp. 37–38.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos202339_28-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 39.

1. ^ [***a***](#cite_ref-FOOTNOTETanenbaumBos202338_29-0) [***b***](#cite_ref-FOOTNOTETanenbaumBos202338_29-1) [***c***](#cite_ref-FOOTNOTETanenbaumBos202338_29-2) [***d***](#cite_ref-FOOTNOTETanenbaumBos202338_29-3) [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 38.

1. **[^](#cite_ref-FOOTNOTESilberschatz_et_al.2018701_30-0)** [Silberschatz et al. 2018](#CITEREFSilberschatz_et_al.2018), pp. 701.

1. **[^](#cite_ref-FOOTNOTESilberschatz_et_al.2018705_31-0)** [Silberschatz et al. 2018](#CITEREFSilberschatz_et_al.2018), pp. 705.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin201412_32-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), p. 12.

1. **[^](#cite_ref-Unikernels_33-0)** Madhavapeddy, Anil; Scott, David J (November 2013). ["Unikernels: Rise of the Virtual Library Operating System: What if all the software layers in a virtual appliance were compiled within the same safe, high-level language framework?"](https://doi.org/10.1145/2557963.2566628). *ACM Queue*. Vol. 11, no. 11. New York, NY, USA: ACM. pp. 30–44. [doi](/source/Doi_(identifier)):[10.1145/2557963.2566628](https://doi.org/10.1145%2F2557963.2566628). [ISSN](/source/ISSN_(identifier)) [1542-7730](https://search.worldcat.org/issn/1542-7730). Retrieved 7 August 2024.

1. **[^](#cite_ref-Unikraft-Build-Process_34-0)** ["Build Process - Unikraft"](https://unikraft.org/docs/concepts/build-process). [Archived](https://web.archive.org/web/20240422183734/https://unikraft.org/docs/concepts/build-process) from the original on 22 April 2024. Retrieved 8 August 2024.

1. **[^](#cite_ref-rise-of-libOS_35-0)** ["Leave your OS at home: the rise of library operating systems"](https://www.sigarch.org/leave-your-os-at-home-the-rise-of-library-operating-systems/). [ACM SIGARCH](/source/ACM_SIGARCH). 14 September 2017. [Archived](https://web.archive.org/web/20240301072916/https://www.sigarch.org/leave-your-os-at-home-the-rise-of-library-operating-systems/) from the original on 1 March 2024. Retrieved 7 August 2024.

1. **[^](#cite_ref-FlexSC_36-0)** Soares, Livio Baldini; Stumm, Michael (4 October 2010). [*FlexSC: Flexible System Call Scheduling with Exception-Less System Calls*](https://www.usenix.org/conference/osdi10/flexsc-flexible-system-call-scheduling-exception-less-system-calls). [OSDI '10, 9th USENIX Symposium on Operating System Design and Implementation](https://www.usenix.org/legacy/events/osdi10/). [USENIX](/source/USENIX). Retrieved 9 August 2024. p. 2: Synchronous implementation of system calls negatively impacts the performance of system intensive workloads, both in terms of the *direct* costs of mode switching and, more interestingly, in terms of the *indirect* pollution of important processor structures which affects both user-mode and kernel-mode performance. A motivating example that quantifies the impact of system call pollution on application performance can be seen in Figure 1. It depicts the user-mode instructions per cycles (kernel cycles and instructions are ignored) of one of the SPEC CPU 2006 benchmarks (Xalan) immediately before and after a pwrite system call. There is a significant drop in instructions per cycle (IPC) due to the system call, and it takes up to 14,000 cycles of execution before the IPC of this application returns to its previous level. As we will show, this performance degradation is mainly due to interference caused by the kernel on key processor structures.

1. ^ [***a***](#cite_ref-FOOTNOTETanenbaumBos20238_37-0) [***b***](#cite_ref-FOOTNOTETanenbaumBos20238_37-1) [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 8.

1. **[^](#cite_ref-OSTEP_book_38-0)** Arpaci-Dusseau, Remzi; Arpaci-Dusseau, Andrea (2015). [*Operating Systems: Three Easy Pieces*](http://pages.cs.wisc.edu/~remzi/OSTEP/). [Archived](https://web.archive.org/web/20160725012948/http://pages.cs.wisc.edu/~remzi/OSTEP/) from the original on 25 July 2016. Retrieved 25 July 2016.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos202310_39-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 10.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos202311–12_40-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), pp. 11–12.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos202313–14_41-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), pp. 13–14.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos202314–15_42-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), pp. 14–15.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos202315_43-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 15.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos202315–16_44-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), pp. 15–16.

1. ^ [***a***](#cite_ref-FOOTNOTETanenbaumBos202316_45-0) [***b***](#cite_ref-FOOTNOTETanenbaumBos202316_45-1) [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 16.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos202317_46-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 17.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos202318_47-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 18.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos202319–20_48-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), pp. 19–20.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin201439–40_49-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), pp. 39–40.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos20232_50-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 2.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin201441,_45_51-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), pp. 41, 45.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin201452–53_52-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), pp. 52–53.

1. ^ [***a***](#cite_ref-lpi-ch20-p388_quote1_53-0) [***b***](#cite_ref-lpi-ch20-p388_quote1_53-1) Kerrisk, Michael (2010). *The Linux Programming Interface*. No Starch Press. p. 388. [ISBN](/source/ISBN_(identifier)) [978-1-59327-220-3](https://en.wikipedia.org/wiki/Special:BookSources/978-1-59327-220-3). A signal is a notification to a process that an event has occurred. Signals are sometimes described as software interrupts.

1. **[^](#cite_ref-Hyde_1996_54-0)** Hyde, Randall (1996). ["Chapter Seventeen: Interrupts, Traps and Exceptions (Part 1)"](https://www.plantation-productions.com/Webster/www.artofasm.com/DOS/ch17/CH17-1.html#HEADING1-0). *The Art Of Assembly Language Programming*. No Starch Press. [Archived](https://web.archive.org/web/20211222205623/https://www.plantation-productions.com/Webster/www.artofasm.com/DOS/ch17/CH17-1.html#HEADING1-0) from the original on 22 December 2021. Retrieved 22 December 2021. The concept of an interrupt is something that has expanded in scope over the years. The 80x86 family has only added to the confusion surrounding interrupts by introducing the int (software interrupt) instruction. Indeed, different manufacturers have used terms like exceptions, faults, aborts, traps and interrupts to describe the phenomena this chapter discusses. Unfortunately there is no clear consensus as to the exact meaning of these terms. Different authors adopt different terms to their own use.

1. **[^](#cite_ref-sco-ch5-p308_a_55-0)** Tanenbaum, Andrew S. (1990). [*Structured Computer Organization, Third Edition*](https://archive.org/details/structuredcomput00tane/page/308). Prentice Hall. p. [308](https://archive.org/details/structuredcomput00tane/page/308). [ISBN](/source/ISBN_(identifier)) [978-0-13-854662-5](https://en.wikipedia.org/wiki/Special:BookSources/978-0-13-854662-5). Like the trap, the interrupt stops the running program and transfers control to an interrupt handler, which performs some appropriate action. When finished, the interrupt handler returns control to the interrupted program.

1. **[^](#cite_ref-osc-ch2-p32_a_56-0)** Silberschatz, Abraham (1994). *Operating System Concepts, Fourth Edition*. Addison-Wesley. p. 32. [ISBN](/source/ISBN_(identifier)) [978-0-201-50480-4](https://en.wikipedia.org/wiki/Special:BookSources/978-0-201-50480-4). When an interrupt (or trap) occurs, the hardware transfers control to the operating system. First, the operating system preserves the state of the CPU by storing registers and the program counter. Then, it determines which type of interrupt has occurred. For each type of interrupt, separate segments of code in the operating system determine what action should be taken.

1. **[^](#cite_ref-osc-ch4-p105_57-0)** Silberschatz, Abraham (1994). *Operating System Concepts, Fourth Edition*. Addison-Wesley. p. 105. [ISBN](/source/ISBN_(identifier)) [978-0-201-50480-4](https://en.wikipedia.org/wiki/Special:BookSources/978-0-201-50480-4). Switching the CPU to another process requires saving the state of the old process and loading the saved state for the new process. This task is known as a context switch.

1. ^ [***a***](#cite_ref-osc-ch2-p31_59-0) [***b***](#cite_ref-osc-ch2-p31_59-1) [***c***](#cite_ref-osc-ch2-p31_59-2) [***d***](#cite_ref-osc-ch2-p31_59-3) [***e***](#cite_ref-osc-ch2-p31_59-4) Silberschatz, Abraham (1994). *Operating System Concepts, Fourth Edition*. Addison-Wesley. p. 31. [ISBN](/source/ISBN_(identifier)) [978-0-201-50480-4](https://en.wikipedia.org/wiki/Special:BookSources/978-0-201-50480-4).

1. **[^](#cite_ref-osc-ch2-p30_60-0)** Silberschatz, Abraham (1994). *Operating System Concepts, Fourth Edition*. Addison-Wesley. p. 30. [ISBN](/source/ISBN_(identifier)) [978-0-201-50480-4](https://en.wikipedia.org/wiki/Special:BookSources/978-0-201-50480-4). Hardware may trigger an interrupt at any time by sending a signal to the CPU, usually by way of the system bus.

1. **[^](#cite_ref-lpi-ch20-p388_quote2_61-0)** Kerrisk, Michael (2010). *The Linux Programming Interface*. No Starch Press. p. 388. [ISBN](/source/ISBN_(identifier)) [978-1-59327-220-3](https://en.wikipedia.org/wiki/Special:BookSources/978-1-59327-220-3). Signals are analogous to hardware interrupts in that they interrupt the normal flow of execution of a program; in most cases, it is not possible to predict exactly when a signal will arrive.

1. **[^](#cite_ref-lpi-ch20-p388_quote3_62-0)** Kerrisk, Michael (2010). *The Linux Programming Interface*. No Starch Press. p. 388. [ISBN](/source/ISBN_(identifier)) [978-1-59327-220-3](https://en.wikipedia.org/wiki/Special:BookSources/978-1-59327-220-3). Among the types of events that cause the kernel to generate a signal for a process are the following: A software event occurred. For example, ... the process's CPU time limit was exceeded[.]

1. ^ [***a***](#cite_ref-lpi-ch20-p388_63-0) [***b***](#cite_ref-lpi-ch20-p388_63-1) [***c***](#cite_ref-lpi-ch20-p388_63-2) [***d***](#cite_ref-lpi-ch20-p388_63-3) [***e***](#cite_ref-lpi-ch20-p388_63-4) Kerrisk, Michael (2010). *The Linux Programming Interface*. No Starch Press. p. 388. [ISBN](/source/ISBN_(identifier)) [978-1-59327-220-3](https://en.wikipedia.org/wiki/Special:BookSources/978-1-59327-220-3).

1. **[^](#cite_ref-intel-developer_64-0)** ["Intel® 64 and IA-32 Architectures Software Developer's Manual"](https://www.intel.com/content/dam/www/public/us/en/documents/manuals/64-ia-32-architectures-software-developer-instruction-set-reference-manual-325383.pdf) (PDF). [Intel Corporation](/source/Intel_Corporation). September 2016. p. 610. [Archived](https://web.archive.org/web/20220323231921/https://www.intel.com/content/dam/www/public/us/en/documents/manuals/64-ia-32-architectures-software-developer-instruction-set-reference-manual-325383.pdf) (PDF) from the original on 23 March 2022. Retrieved 5 May 2022.

1. ^ [***a***](#cite_ref-duos-p200_65-0) [***b***](#cite_ref-duos-p200_65-1) [***c***](#cite_ref-duos-p200_65-2) Bach, Maurice J. (1986). *The Design of the UNIX Operating System*. Prentice-Hall. p. 200. [ISBN](/source/ISBN_(identifier)) [0-13-201799-7](https://en.wikipedia.org/wiki/Special:BookSources/0-13-201799-7).

1. **[^](#cite_ref-lpi-ch20-p400_67-0)** Kerrisk, Michael (2010). *The Linux Programming Interface*. No Starch Press. p. 400. [ISBN](/source/ISBN_(identifier)) [978-1-59327-220-3](https://en.wikipedia.org/wiki/Special:BookSources/978-1-59327-220-3).

1. ^ [***a***](#cite_ref-sco-ch5-p308_b_68-0) [***b***](#cite_ref-sco-ch5-p308_b_68-1) Tanenbaum, Andrew S. (1990). [*Structured Computer Organization, Third Edition*](https://archive.org/details/structuredcomput00tane/page/308). Prentice Hall. p. [308](https://archive.org/details/structuredcomput00tane/page/308). [ISBN](/source/ISBN_(identifier)) [978-0-13-854662-5](https://en.wikipedia.org/wiki/Special:BookSources/978-0-13-854662-5).

1. **[^](#cite_ref-osc-p182_69-0)** Silberschatz, Abraham (1994). *Operating System Concepts, Fourth Edition*. Addison-Wesley. p. 182. [ISBN](/source/ISBN_(identifier)) [978-0-201-50480-4](https://en.wikipedia.org/wiki/Special:BookSources/978-0-201-50480-4).

1. **[^](#cite_ref-usp-ch6-p153_70-0)** Haviland, Keith; Salama, Ben (1987). *UNIX System Programming*. Addison-Wesley Publishing Company. p. 153. [ISBN](/source/ISBN_(identifier)) [0-201-12919-1](https://en.wikipedia.org/wiki/Special:BookSources/0-201-12919-1).

1. **[^](#cite_ref-usp-ch6-p148_71-0)** Haviland, Keith; Salama, Ben (1987). *UNIX System Programming*. Addison-Wesley Publishing Company. p. 148. [ISBN](/source/ISBN_(identifier)) [0-201-12919-1](https://en.wikipedia.org/wiki/Special:BookSources/0-201-12919-1).

1. ^ [***a***](#cite_ref-usp-ch6-p149_72-0) [***b***](#cite_ref-usp-ch6-p149_72-1) Haviland, Keith; Salama, Ben (1987). *UNIX System Programming*. Addison-Wesley Publishing Company. p. 149. [ISBN](/source/ISBN_(identifier)) [0-201-12919-1](https://en.wikipedia.org/wiki/Special:BookSources/0-201-12919-1).

1. **[^](#cite_ref-sco-ch5-p292_73-0)** Tanenbaum, Andrew S. (1990). [*Structured Computer Organization, Third Edition*](https://archive.org/details/structuredcomput00tane/page/292). Prentice Hall. p. [292](https://archive.org/details/structuredcomput00tane/page/292). [ISBN](/source/ISBN_(identifier)) [978-0-13-854662-5](https://en.wikipedia.org/wiki/Special:BookSources/978-0-13-854662-5).

1. **[^](#cite_ref-A22-6821-7-storage_74-0)** IBM (September 1968), ["Main Storage"](http://bitsavers.org/pdf/ibm/360/princOps/A22-6821-7_360PrincOpsDec67.pdf#page=8) (PDF), [*IBM System/360 Principles of Operation*](http://bitsavers.org/pdf/ibm/360/princOps/A22-6821-7_360PrincOpsDec67.pdf) (PDF), Eighth Edition, p. 7, [archived](https://web.archive.org/web/20220319083255/http://bitsavers.org/pdf/ibm/360/princOps/A22-6821-7_360PrincOpsDec67.pdf) (PDF) from the original on 19 March 2022, retrieved 13 April 2022

1. ^ [***a***](#cite_ref-sco-ch5-p294_76-0) [***b***](#cite_ref-sco-ch5-p294_76-1) Tanenbaum, Andrew S. (1990). [*Structured Computer Organization, Third Edition*](https://archive.org/details/structuredcomput00tane/page/294). Prentice Hall. p. [294](https://archive.org/details/structuredcomput00tane/page/294). [ISBN](/source/ISBN_(identifier)) [978-0-13-854662-5](https://en.wikipedia.org/wiki/Special:BookSources/978-0-13-854662-5).

1. **[^](#cite_ref-78)** ["Program Interrupt Controller (PIC)"](http://bitsavers.org/pdf/dec/pdp7/F-75_PDP-7userHbk_Jun65.pdf#page=62) (PDF). [*Users Handbook - PDP-7*](http://bitsavers.org/pdf/dec/pdp7/F-75_PDP-7userHbk_Jun65.pdf) (PDF). [Digital Equipment Corporation](/source/Digital_Equipment_Corporation). 1965. pp. [48](http://bitsavers.org/pdf/dec/pdp7/F-75_PDP-7userHbk_Jun65.pdf#page=63). F-75. [Archived](https://web.archive.org/web/20220510164742/http://bitsavers.org/pdf/dec/pdp7/F-75_PDP-7userHbk_Jun65.pdf) (PDF) from the original on 10 May 2022. Retrieved 20 April 2022.

1. **[^](#cite_ref-79)** [*PDP-1 Input-Output Systems Manual*](http://bitsavers.org/pdf/dec/pdp1/F25_PDP1_IO.pdf) (PDF). [Digital Equipment Corporation](/source/Digital_Equipment_Corporation). pp. 19–20. [Archived](https://web.archive.org/web/20190125050839/http://bitsavers.org/pdf/dec/pdp1/F25_PDP1_IO.pdf) (PDF) from the original on 25 January 2019. Retrieved 16 August 2022.

1. **[^](#cite_ref-osc-ch2-p32_b_80-0)** Silberschatz, Abraham (1994). *Operating System Concepts, Fourth Edition*. Addison-Wesley. p. 32. [ISBN](/source/ISBN_(identifier)) [978-0-201-50480-4](https://en.wikipedia.org/wiki/Special:BookSources/978-0-201-50480-4).

1. **[^](#cite_ref-osc-ch2-p34_81-0)** Silberschatz, Abraham (1994). *Operating System Concepts, Fourth Edition*. Addison-Wesley. p. 34. [ISBN](/source/ISBN_(identifier)) [978-0-201-50480-4](https://en.wikipedia.org/wiki/Special:BookSources/978-0-201-50480-4).

1. ^ [***a***](#cite_ref-sco-ch5-p295_82-0) [***b***](#cite_ref-sco-ch5-p295_82-1) Tanenbaum, Andrew S. (1990). [*Structured Computer Organization, Third Edition*](https://archive.org/details/structuredcomput00tane/page/295). Prentice Hall. p. [295](https://archive.org/details/structuredcomput00tane/page/295). [ISBN](/source/ISBN_(identifier)) [978-0-13-854662-5](https://en.wikipedia.org/wiki/Special:BookSources/978-0-13-854662-5).

1. ^ [***a***](#cite_ref-sco-ch5-p309_83-0) [***b***](#cite_ref-sco-ch5-p309_83-1) Tanenbaum, Andrew S. (1990). [*Structured Computer Organization, Third Edition*](https://archive.org/details/structuredcomput00tane/page/309). Prentice Hall. p. [309](https://archive.org/details/structuredcomput00tane/page/309). [ISBN](/source/ISBN_(identifier)) [978-0-13-854662-5](https://en.wikipedia.org/wiki/Special:BookSources/978-0-13-854662-5).

1. **[^](#cite_ref-sco-ch5-p310_84-0)** Tanenbaum, Andrew S. (1990). [*Structured Computer Organization, Third Edition*](https://archive.org/details/structuredcomput00tane/page/310). Prentice Hall. p. [310](https://archive.org/details/structuredcomput00tane/page/310). [ISBN](/source/ISBN_(identifier)) [978-0-13-854662-5](https://en.wikipedia.org/wiki/Special:BookSources/978-0-13-854662-5).

1. **[^](#cite_ref-Operating_System_86-0)** Stallings, William (2008). *Computer Organization & Architecture*. New Delhi: Prentice-Hall of India Private Limited. p. 267. [ISBN](/source/ISBN_(identifier)) [978-81-203-2962-1](https://en.wikipedia.org/wiki/Special:BookSources/978-81-203-2962-1).

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin2014129_87-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), p. 129.

1. **[^](#cite_ref-FOOTNOTESilberschatz_et_al.2018159_88-0)** [Silberschatz et al. 2018](#CITEREFSilberschatz_et_al.2018), p. 159.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin2014130_89-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), p. 130.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin2014131_90-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), p. 131.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin2014157,_159_91-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), pp. 157, 159.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin2014139_92-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), p. 139.

1. **[^](#cite_ref-FOOTNOTESilberschatz_et_al.2018160_93-0)** [Silberschatz et al. 2018](#CITEREFSilberschatz_et_al.2018), p. 160.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin2014183_94-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), p. 183.

1. **[^](#cite_ref-FOOTNOTESilberschatz_et_al.2018162_95-0)** [Silberschatz et al. 2018](#CITEREFSilberschatz_et_al.2018), p. 162.

1. **[^](#cite_ref-FOOTNOTESilberschatz_et_al.2018162–163_96-0)** [Silberschatz et al. 2018](#CITEREFSilberschatz_et_al.2018), pp. 162–163.

1. **[^](#cite_ref-FOOTNOTESilberschatz_et_al.2018164_97-0)** [Silberschatz et al. 2018](#CITEREFSilberschatz_et_al.2018), p. 164.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin2014492,_517_98-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), pp. 492, 517.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023259–260_99-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), pp. 259–260.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin2014517,_530_100-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), pp. 517, 530.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023260_101-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 260.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin2014492–493_102-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), pp. 492–493.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin2014496_103-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), p. 496.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin2014496–497_104-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), pp. 496–497.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023274–275_105-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), pp. 274–275.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin2014502–504_106-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), pp. 502–504.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin2014507_107-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), p. 507.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin2014508_108-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), p. 508.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023359_109-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 359.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin2014545_110-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), p. 545.

1. ^ [***a***](#cite_ref-FOOTNOTEAndersonDahlin2014546_111-0) [***b***](#cite_ref-FOOTNOTEAndersonDahlin2014546_111-1) [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), p. 546.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin2014547_112-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), p. 547.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin2014589,_591_113-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), pp. 589, 591.

1. **[^](#cite_ref-FOOTNOTEAndersonDahlin2014591–592_114-0)** [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), pp. 591–592.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023385–386_115-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), pp. 385–386.

1. ^ [***a***](#cite_ref-FOOTNOTEAndersonDahlin2014592_116-0) [***b***](#cite_ref-FOOTNOTEAndersonDahlin2014592_116-1) [Anderson & Dahlin 2014](#CITEREFAndersonDahlin2014), p. 592.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023605–606_117-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), pp. 605–606.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023608_118-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 608.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023609_119-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 609.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023609–610_120-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), pp. 609–610.

1. ^ [***a***](#cite_ref-FOOTNOTETanenbaumBos2023612_121-0) [***b***](#cite_ref-FOOTNOTETanenbaumBos2023612_121-1) [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 612.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023648,_657_122-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), pp. 648, 657.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023668–669,_674_123-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), pp. 668–669, 674.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023679–680_124-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), pp. 679–680.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023605,_617–618_125-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), pp. 605, 617–618.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023681–682_126-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), pp. 681–682.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023683_127-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 683.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023685_128-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 685.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023689_129-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 689.

1. **[^](#cite_ref-FOOTNOTERichetBouaynaya202392_130-0)** [Richet & Bouaynaya 2023](#CITEREFRichetBouaynaya2023), p. 92.

1. **[^](#cite_ref-FOOTNOTERichetBouaynaya202392–93_131-0)** [Richet & Bouaynaya 2023](#CITEREFRichetBouaynaya2023), pp. 92–93.

1. **[^](#cite_ref-FOOTNOTEBerntssoStrandénWarg2017130–131_132-0)** [Berntsso, Strandén & Warg 2017](#CITEREFBerntssoStrandénWarg2017), pp. 130–131. sfn error: no target: CITEREFBerntssoStrandénWarg2017 ([help](https://en.wikipedia.org/wiki/Category:Harv_and_Sfn_template_errors))

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023611_133-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 611.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023396,_402_134-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), pp. 396, 402.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023395,_408_135-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), pp. 395, 408.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023402_136-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 402.

1. **[^](#cite_ref-137)** Holwerda, Thom (20 December 2009). ["My OS Is Less Hobby than Yours"](https://www.osnews.com/story/22638/my-os-is-less-hobby-than-yours/). *OS News*. Retrieved 4 June 2024.

1. **[^](#cite_ref-FOOTNOTESilberschatz_et_al.2018779–780_138-0)** [Silberschatz et al. 2018](#CITEREFSilberschatz_et_al.2018), pp. 779–780.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023713–714_139-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), pp. 713–714.

1. ^ [***a***](#cite_ref-FOOTNOTESilberschatz_et_al.2018780_140-0) [***b***](#cite_ref-FOOTNOTESilberschatz_et_al.2018780_140-1) [Silberschatz et al. 2018](#CITEREFSilberschatz_et_al.2018), p. 780.

1. **[^](#cite_ref-141)** Vaughan-Nichols, Steven (2022). ["Linus Torvalds prepares to move the Linux kernel to modern C"](https://www.zdnet.com/article/linus-torvalds-prepares-to-move-the-linux-kernel-to-modern-c/). *ZDNET*. Retrieved 7 February 2024.

1. **[^](#cite_ref-FOOTNOTESilberschatz_et_al.2018781_142-0)** [Silberschatz et al. 2018](#CITEREFSilberschatz_et_al.2018), p. 781.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023715–716_143-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), pp. 715–716.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023793–794_144-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), pp. 793–794.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023793_145-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 793.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos20231021–1022_146-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), pp. 1021–1022.

1. **[^](#cite_ref-FOOTNOTETanenbaumBos2023871_147-0)** [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 871.

1. **[^](#cite_ref-FOOTNOTESilberschatz_et_al.2018826_148-0)** [Silberschatz et al. 2018](#CITEREFSilberschatz_et_al.2018), p. 826.

1. ^ [***a***](#cite_ref-FOOTNOTETanenbaumBos20231035_149-0) [***b***](#cite_ref-FOOTNOTETanenbaumBos20231035_149-1) [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 1035.

1. ^ [***a***](#cite_ref-FOOTNOTETanenbaumBos20231036_150-0) [***b***](#cite_ref-FOOTNOTETanenbaumBos20231036_150-1) [Tanenbaum & Bos 2023](#CITEREFTanenbaumBos2023), p. 1036.

1. **[^](#cite_ref-FOOTNOTESilberschatz_et_al.2018821_151-0)** [Silberschatz et al. 2018](#CITEREFSilberschatz_et_al.2018), p. 821.

1. **[^](#cite_ref-FOOTNOTESilberschatz_et_al.2018827_152-0)** [Silberschatz et al. 2018](#CITEREFSilberschatz_et_al.2018), p. 827.

## Further reading

- [Anderson, Thomas](/source/Thomas_E._Anderson); Dahlin, Michael (2014). *Operating Systems: Principles and Practice*. Recursive Books. [ISBN](/source/ISBN_(identifier)) [978-0-9856735-2-9](https://en.wikipedia.org/wiki/Special:BookSources/978-0-9856735-2-9).

- Auslander, M. A.; Larkin, D. C.; Scherr, A. L. (September 1981). "The Evolution of the MVS Operating System". *IBM Journal of Research and Development*. **25** (5): 471–482. [doi](/source/Doi_(identifier)):[10.1147/rd.255.0471](https://doi.org/10.1147%2Frd.255.0471). [ISSN](/source/ISSN_(identifier)) [0018-8646](https://search.worldcat.org/issn/0018-8646).

- Berntsson, Petter Sainio; Strandén, Lars; Warg, Fredrik (2017). *Evaluation of Open Source Operating Systems for Safety-Critical Applications*. Springer International Publishing. pp. 117–132. [ISBN](/source/ISBN_(identifier)) [978-3-319-65948-0](https://en.wikipedia.org/wiki/Special:BookSources/978-3-319-65948-0).

- Deitel, Harvey M.; Deitel, Paul; Choffnes, David (25 December 2015). [*Operating Systems*](https://archive.org/details/modernoperatings00tane). Pearson/Prentice Hall. [ISBN](/source/ISBN_(identifier)) [978-0-13-092641-8](https://en.wikipedia.org/wiki/Special:BookSources/978-0-13-092641-8).

- Bic, Lubomur F.; Shaw, Alan C. (2003). *Operating Systems*. Pearson: [Prentice Hall](/source/Prentice_Hall).

- Silberschatz, Avi; Galvin, Peter; Gagne, Greg (2008). *Operating Systems Concepts*. [John Wiley & Sons](/source/John_Wiley_%26_Sons). [ISBN](/source/ISBN_(identifier)) [978-0-470-12872-5](https://en.wikipedia.org/wiki/Special:BookSources/978-0-470-12872-5).

- O'Brien, J. A.; Marakas, G. M. (2011). *Management Information Systems* (10th ed.). McGraw-Hill Irwin.

- Leva, Alberto; Maggio, Martina; Papadopoulos, Alessandro Vittorio; Terraneo, Federico (2013). *Control-based Operating System Design*. [IET](/source/Institution_of_Engineering_and_Technology). [ISBN](/source/ISBN_(identifier)) [978-1-84919-609-3](https://en.wikipedia.org/wiki/Special:BookSources/978-1-84919-609-3).

- Richet, Jean-Loup; Bouaynaya, Wafa (2023). ["Understanding and Managing Complex Software Vulnerabilities: An Empirical Analysis of Open-Source Operating Systems"](https://doi.org/10.54695%2Fsim.28.1.0087). *Systèmes d'information & management*. **28** (1): 87–114. [doi](/source/Doi_(identifier)):[10.54695/sim.28.1.0087](https://doi.org/10.54695%2Fsim.28.1.0087).

- Silberschatz, Abraham; Galvin, Peter B.; Gagne, Greg (2018). [*Operating System Concepts*](https://archive.org/details/operating-system-concepts-10th) (10 ed.). Wiley. [ISBN](/source/ISBN_(identifier)) [978-1-119-32091-3](https://en.wikipedia.org/wiki/Special:BookSources/978-1-119-32091-3).

- Tanenbaum, Andrew S.; Bos, Herbert (2023). *Modern Operating Systems, Global Edition*. Pearson Higher Ed. [ISBN](/source/ISBN_(identifier)) [978-1-292-72789-9](https://en.wikipedia.org/wiki/Special:BookSources/978-1-292-72789-9).

## External links

Look up ***[operating system](https://en.wiktionary.org/wiki/Special:Search/operating_system)*** in Wiktionary, the free dictionary.

Wikimedia Commons has media related to [Operating systems](https://commons.wikimedia.org/wiki/Category:Operating_systems).

Wikiversity has learning resources about ***[Operating Systems](https://en.wikiversity.org/wiki/Operating_Systems)***

- [Multics History](http://www.cbi.umn.edu/iterations/haigh.html) and the history of operating systems

v t e Operating systems General Comparison Forensic engineering History List Timeline Usage share User features comparison Variants Disk operating system Distributed operating system Embedded operating system Hobbyist operating system Just enough operating system Mobile operating system Network operating system Object-oriented operating system Real-time operating system Supercomputer operating system Kernel Architectures Exokernel Hybrid Microkernel Monolithic Multikernel vkernel Rump kernel Unikernel Components Device driver Loadable kernel module User space and kernel space Process management Concepts Computer multitasking (Cooperative, Preemptive) Context switch Interrupt IPC Process Process control block Real-time Thread Time-sharing Scheduling algorithms Fixed-priority preemptive Multilevel feedback queue Round-robin Shortest job next Memory management, resource protection Bus error General protection fault Memory paging Memory protection Protection ring Segmentation fault Virtual memory Storage access, file systems Boot loader Defragmentation Device file File attribute Inode Journal Partition Virtual file system Virtual tape library Supporting concepts API Computer network HAL Live CD Live USB Shell CLI User interface PXE

v t e Computer science This template follows roughly the 2012 ACM Computing Classification System Hardware Printed circuit board Peripheral Integrated circuit Very-large-scale integration System on a chip (SoC) Energy consumption (green computing) Electronic design automation Hardware acceleration Processor Size – Form Systems organization Computer architecture Computational complexity Dependability Embedded system Real-time computing Cyber-physical system Fault tolerance Wireless sensor network Networks Network architecture Network protocol Network components Network scheduler Network performance evaluation Network service Software organization Interpreter Middleware Virtual machine Operating system Software quality Software notations, tools Programming paradigm Programming language Compiler Domain-specific language Modeling language Software framework Integrated development environment Software configuration management Software library Software repository Software development Control flow Software development process Requirements analysis Software design Software construction Software deployment Software engineering Software maintenance Programming team Open source model Theory of computing Model of computation Stochastic Formal language Automata theory Computability theory Computational complexity theory Logic Semantics Algorithms Algorithm design Analysis of algorithms Algorithmic efficiency Randomized algorithm Computational geometry Mathematics of computing Discrete mathematics Probability Statistics Mathematical software Information theory Mathematical analysis Numerical analysis Theoretical computer science Computational problem Information systems Database management Information storage Enterprise information Social information Geographic information Decision support Process control Multimedia information Data mining Digital library Computing platform Digital marketing World Wide Web Information retrieval Security Cryptography Formal methods Security hacker Security services Intrusion detection system Hardware security Network security Information security Application security Human- centered computing Accessibility Extended reality augmented virtual Human–computer interaction Interaction design Mobile computing Social computing Ubiquitous computing Visualization Concurrency Concurrent computing Parallel computing Distributed computing Multithreading Multiprocessing Artificial intelligence Computational intelligence Natural language processing Knowledge representation and reasoning Computer vision Automated planning and scheduling Search methodology Control method Philosophy of Distributed Machine learning Supervised Unsupervised Reinforcement Multi-task Cross-validation Graphics Animation Rendering Photograph manipulation Graphics processing unit Image compression Solid modeling Applied computing Quantum computing E-commerce Enterprise software Computational mathematics Computational physics Computational chemistry Computational biology Computational social science Computational engineering Differentiable computing Computational healthcare Digital art Electronic publishing Cyberwarfare Electronic voting Video games Word processing Operations research Educational technology Document management Outline Glossaries Category

Authority control databases International GND FAST National United States France BnF data Japan Czech Republic Israel Other Yale LUX

---
Adapted from the Wikipedia article [Operating system](https://en.wikipedia.org/wiki/Operating_system) by Wikipedia contributors ([contributor history](https://en.wikipedia.org/wiki/Operating_system?action=history)). Available under [Creative Commons Attribution-ShareAlike 4.0 International](https://creativecommons.org/licenses/by-sa/4.0/). Changes may have been made.