A temporary location used to store requests made when those requests cannot be fulfilled immediately is referred to as a queue. For example, a printer queue receives print jobs from multiple programs, and sometimes multiple users. The printer can only print one page of one document at a time, so the queue software manages incoming requests while the printer is busy.
With the printer queue and most queues, the items in the queue are processed as FIFO (first in first out). In other words, the first item to get placed into the queue is the first to get processed.