Virtual Threads
   HOME

TheInfoList



OR:

In
computer programming Computer programming or coding is the composition of sequences of instructions, called computer program, programs, that computers can follow to perform tasks. It involves designing and implementing algorithms, step-by-step specifications of proc ...
, a virtual thread is a thread that is managed by a
runtime library A runtime library is a library that provides access to the runtime environment that is available to a computer program tailored to the host platform. A runtime environment implements the execution model as required for a development environme ...
or
virtual machine In computing, a virtual machine (VM) is the virtualization or emulator, emulation of a computer system. Virtual machines are based on computer architectures and provide the functionality of a physical computer. Their implementations may involve ...
(VM) and made to resemble "real" operating system thread to code executing on it, while requiring substantially fewer resources than the latter. Virtual threads allows for tens of millions of preemptive tasks and events on a 2021 consumer-grade computer, compared to low thousands of operating system threads. Preemptive execution is important to performance gains through parallelism and fast preemptive response times for tens of millions of events. Earlier constructs that are not or not always preemptive, such as
coroutine Coroutines are computer program components that allow execution to be suspended and resumed, generalizing subroutines for cooperative multitasking. Coroutines are well-suited for implementing familiar program components such as cooperative task ...
s,
green thread In computer programming, a green thread is a thread that is scheduled by a runtime library or virtual machine (VM) instead of natively by the underlying operating system (OS). Green threads emulate multithreaded environments without relying on a ...
s or the largely single-threaded Node.js, introduce delays in responding to asynchronous events such as every incoming request in a server application.


Definition

Virtual threads are preemptive * Important for response performance, a virtual thread can react to events without programmer intervention or before concluding a current task. * Preemption requires knowledge of multi-threaded programming to avoid torn writes, data races, and invisible writes by other threads. Virtual threads can hop over the execution units of all processors and cores * This allows better utilisation of available hardware. * Go (since version 1.18) uses virtual thread queues per execution unit. There are additional virtual threads not allocated to an execution unit and an execution unit can steal virtual threads from another execution unit. Virtual threads require no yield or similar interventions by the programmer * Virtual threads appear to execute continuously until they return or stop at a synchronization lock. * Unlike coroutines, if a virtual thread is in an infinite loop, it does not block the program. Execution continues at a higher CPU load, even if there are more looping threads than available execution units. Virtual threads can number in the tens of millions by featuring small often managed stacks * This allows for several magnitudes more threads than it would be possible using operating system threads. * Go 1.18 can launch 15 million virtual threads on a 2021 consumer-grade computer, i.e. about 350,000 per gigabyte of main memory. This is enabled by goroutines having a resizable, less than 3 KiB stack. Virtual threads can be allocated quickly * Because allocation of a virtual thread has little overhead on top of allocating memory, they can be allocated very quickly. * The quicker ramp-up lessens the need for thread-pools of pre-launched threads to cater for sudden increases in traffic. Virtual threads share memory like operating system threads * Like OS threads, virtual threads share memory across the process and can therefore freely share and access memory objects subject to synchronization. * Some single-threaded architectures, such as the V8 ECMAScript engine used by Node.js, do not readily accept data that the particular thread did not allocate, requiring special zero-copy data types to be used when sharing data between threads. Virtual threads offer parallelism like operating system threads * Parallelism means that multiple instructions are executed truly at the same time which typically leads to a magnitude of faster performance. * This is different from the simpler concurrency, in which a single execution unit executes multiple threads shared in small time increments. The time-slicing makes each thread appear to be continuously executing. While concurrency is easier to implement and program, it does not offer any gains in performance.


Motivation

Java servers have featured extensive and memory consuming software constructs allowing dozens of pooled operating system threads to preemptively execute thousands of requests per second without the use of virtual threads. Key to performance here is to reduce the initial latency in thread processing and minimize the time operating system threads are blocked. Virtual threads increase possible concurrency by many orders of magnitudes while the actual parallelism achieved is limited by available execution units and pipelining offered by present processors and processor cores. In 2021, a consumer grade computers typically offer a parallelism of tens of concurrent execution units. For increased performance through parallelism, the language runtime need to use all present hardware, not be single-threaded or feature global synchronization such as
global interpreter lock A global interpreter lock (GIL) is a mechanism used in computer-language Interpreter (computing), interpreters to synchronize the execution of Threads (computer science), threads so that only one native thread (per process) can execute basic ope ...
. The many magnitudes of increase in possible preemptive items offered by virtual threads is achieved by the language runtime managing resizable thread stacks. Those stacks are smaller in size than those of operating system threads. The maximum number of threads possible without swapping is proportional to the amount of main memory. In order to support virtual threads efficiently, the language runtime has to be largely rewritten to prevent blocking calls from holding up an operating system thread assigned to execute a virtual thread and to manage thread stacks. An example of a retrofit of an existing runtime with virtual threads is Java's ''Project Loom''. An example of a new language designed for virtual threads is Go.


Complexity

Because virtual threads offer parallelism, the programmer needs to be skilled in multi-threaded programming and synchronization. Because a blocked virtual thread would block the OS thread it occupies at the moment, much effort must be taken in the runtime to handle blocking system calls. Typically, a thread from a pool of spare OS threads is used to execute the blocking call for the virtual thread so that the initially executing OS thread is not blocked. Management of the virtual thread stack requires care in the linker and short predictions of additional stack space requirements.


Implementations


Google Chrome Browser

Virtual threads are used to serialize singleton input/output activities and available to developers extending the browser. When a virtual thread is executing, it can hop on a different OS thread.


Go

Go's ''goroutines'' became preemptive with Go 1.4 in 2014 and are a prominent application of virtual threads.


Java

Java introduced virtual threads in 2023 with Java 21, with the limitation that any code running on a virtual thread which uses ''synchronised'' blocks or native calls will become pinned to its carrier OS thread. The former limitation was fixed in Java 24.


Other uses of the term

Intel{{Cite web , title=Intel Technology Journal , url=https://www.intel.com/content/dam/www/public/us/en/documents/research/2007-vol11-iss-4-intel-technology-journal.pdf in 2007 referred to an Intel compiler specific optimization technique as virtual threads.


See also

*
Async/await In computer programming, the async/await pattern is a syntactic feature of many programming languages that allows an asynchronous, non-blocking function to be structured in a way similar to an ordinary synchronous function. It is semantically r ...
*
Light-weight process In computer operating systems, a light-weight process (LWP) is a means of achieving multitasking. In the traditional meaning of the term, as used in Unix System V and Solaris, a LWP runs in user space on top of a single kernel thread and shar ...
*
Coroutine Coroutines are computer program components that allow execution to be suspended and resumed, generalizing subroutines for cooperative multitasking. Coroutines are well-suited for implementing familiar program components such as cooperative task ...
*
Global interpreter lock A global interpreter lock (GIL) is a mechanism used in computer-language Interpreter (computing), interpreters to synchronize the execution of Threads (computer science), threads so that only one native thread (per process) can execute basic ope ...
*
Fiber (computer science) In computer science, a fiber is a particularly lightweight thread of execution. Like threads, fibers share address space. However, fibers use cooperative multitasking while threads use preemptive multitasking. Threads often depend on the k ...
*
GNU Portable Threads GNU Pth (Portable Threads) is a POSIX/ANSI- C based user space thread library for UNIX platforms that provides priority-based scheduling for multithreading applications. GNU Pth targets for a high degree of portability. It is part of the GNU Pr ...
*
Protothreads A protothread is a low-overhead mechanism for concurrent programming. Protothreads function as Call stack, stackless, lightweight Thread (computer science), threads, or coroutines, providing a blocking context cheaply using minimal memory per proto ...


References


External links


massivevirtualparallelism Go program testing limits on virtual threads
Threads (computing) Virtualization