What is the approach called when handling program work requests such that the oldest request is handled next?

The approach where the oldest work request is handled next is known as FIFO, which stands for "First In, First Out." This method operates on the principle of processing requests in the order they are received. When using FIFO, the first request that enters the queue is the first one to be processed, and subsequent requests are handled in the sequence they arrive.

This approach is particularly useful in scenarios such as task scheduling, processing customer service requests, or managing queues in computer systems. By ensuring that requests are addressed in the order they were made, FIFO helps maintain fairness and predictability in processing tasks. This can be especially important in systems where timely handling of requests is critical.

In contrast, other methods like LIFO (Last In, First Out) would prioritize the most recent requests instead. Round Robin distributes processing time equally among requests, while Random does not follow any specific order. Thus, FIFO is the correct terminology to describe this first-come, first-served approach.