From a computing perspective, the worker in our card sorting example is like a thread. A thread is a sequence of CPU instructions that the operating system treats as a single unit for scheduling and execution purposes. Each thread must be associated with a process that manages the resource allocation necessary for the thread's execution.

On the left, a stick figure wearing a hat labeled with the letter A. On the right, a wavy vertical line, representing a computer thread, wears an identical hat.
On the left, a stick figure wearing a hat labeled with the letter A. On the right, a wavy vertical line, representing a computer thread, wears an identical hat.
Our card sorting worker is like a thread in a parallel program.

In the card sorting example, the card sorting table and its associated worker(s) are analogous to a process. In computing, a process is a coherent unit of resource allocation, including memory, file handlers, ports, and devices. A single process may manage the resources for several threads. Because of the one-to-one or one-to-many relationship between processes and threads, threads can be modeled as components of a process.

The image juxtaposes a single worker in a cubicle with a single thread in a computer process. On the left, a stick figure sits at a desk in a cubicle. On the right, a wavy vertical line, representing a computer thread, wears a matching hat. The thread's workspace is a block of ram, represented as an array with hexadecimal labels.
The image juxtaposes a single worker in a cubicle with a single thread in a computer process. On the left, a stick figure sits at a desk in a cubicle. On the right, a wavy vertical line, representing a computer thread, wears a matching hat. The thread's workspace is a block of ram, represented as an array with hexadecimal labels.
A cubicle, its amenities, and the workers within are analogous to a computer process. A process is associated with one or more threads and a memory allocation.

 
©  |   Cornell University    |   Center for Advanced Computing    |   Copyright Statement    |   Inclusivity Statement