Inside the Windows NT Scheduler, Part 2

Multiprocessor scheduling decisions can affect NT's scalability

In my July column, "Inside the Windows NT Scheduler, Part 1," I described the basics of threads, priorities, and uniprocessor scheduling on Windows NT 4.0. I presented definitions for threads and processes, and provided an overview of NT's thread priority scheme. This month, I'll finish my examination of NT scheduling by presenting the algorithms NT employs on multiprocessors.

The priority scheme and scheduling basics that I described last month apply to multiprocessor systems as well. However, in most cases on multiprocessor systems, the scheduler can choose among several CPUs to schedule a given thread. Deciding which CPU to pick so that NT uses the processors to their full potential is a complex problem, as you'll see.

In writing this article, I assumed that you are up to speed with the terminology I introduced last month. If you are not familiar with basic scheduling terms and concepts (e.g., you don't know what the Dispatcher Ready List is), I suggest you read last month's column before digging into this one.

NT and Multiprocessing
From the outset, Microsoft designed NT with multiprocessing in mind. The type of multiprocessing that NT supports is symmetric multiprocessing (SMP). In an SMP system, all the CPUs are identical, the operating system (NT) can run on any of the CPUs, and all the CPUs have equal access to main memory and peripheral devices. The opposite of an SMP system is a system in which the CPUs are different, the CPUs have private memory or devices, or the CPUs have priorities such that the operating system runs on only certain CPUs. Figures 1a and 1b (page 178) contrast an SMP system with an example of a non-SMP (an asymmetric multiprocessing--ASMP) system.

Figure1A depicts an SMP system. The CPUs are identical, all the CPUs have private Level 1 (L1) and Level 2 (L2) caches (the L1 cache usually resides on the CPU chip), and all the CPUs have equal access to main memory and the I/O subsystem. The NT kernel can run on any of the CPUs; it can even run simultaneously on several CPUs. Figure1B presents an example ASMP system with one master CPU. The master CPU, which runs the operating system and is the only CPU that can access the I/O subsystem, farms out work to the slave CPUs.

Microsoft designed NT's internal data structures and code to support up to 32 processors. However, NT Workstation enables a maximum of 2 processors, and NT Server enables a maximum of 4 processors, regardless of how many CPUs the system contains. Microsoft imposes these limitations with Registry values, which the NT kernel queries during processor initialization to determine the upper limit of CPUs to conFigure. This process involves two values that cross-reference each other, and the system monitors one value to prevent tampering. If a system has more than 4 processors, the vendor must license the OEM version of NT, which is nothing more than NT with modified setup files that initialize the Registry with values appropriate to the system during NT's installation. As NT enables processors, it assigns them numbers (starting with 0) to identify them internally.

To prevent corruption that might occur if multiple instances of the kernel modified the same data simultaneously, the NT kernel protects its shared data structures with locks. Typically, only one kernel instance (CPU) at a time can write to, or read from, core data structures. Before accessing a data structure, a CPU must acquire a lock that protects the data structure; after completing the access, the CPU must release the lock. If the lock is not available when the CPU requests it, the CPU waits.

An example of a core data structure that NT protects with a lock is the Dispatcher Ready List, which I described last month. Locking ensures that even though more than one processor might require a scheduling operation, the scheduling code will never be running on more than one CPU at a time. Other processors that require scheduling must wait until they can acquire the lock protecting the Dispatcher Ready List before executing the scheduling algorithms.

Although SMP systems contain more than one processor, the situations on SMP systems that require scheduling operations are the same as the situations that require scheduling operations on uniprocessor systems. You'll recall from last month that several situations invoke the scheduler. If a thread's turn on the CPU expires, if a thread blocks (i.e., waits for an event to occur), or if a thread yields its turn on a processor because the thread has terminated, the scheduler uses the FindReadyThread routine to find a new thread to execute on the CPU.

A thread that becomes ready to execute also invokes the scheduler. One example of a ready-to-execute thread is a thread that wakes up after waiting for an event to occur. Another example is a thread that NT pulls off a CPU because the thread's turn has ended--the thread is still eligible to execute, so the scheduler might move it to another CPU. The algorithm the scheduler executes in ready-to-execute situations is ReadyThread.

The multiprocessor FindReadyThread and ReadyThread functions have the same names as the functions that perform these tasks in the uniprocessor case. To make NT run as efficiently as possible on uniprocessors, Microsoft builds a special version of NT with most of the multiprocessor support code removed. One source code file contains both the uniprocessor and multiprocessor implementations of FindReadyThread and ReadyThread; the source code conditions the cores of the routines on the version of NT that's being compiled.

Affinity and Ideal Processors
Before launching into the details of FindReadyThread and ReadyThread, I want to discuss a few scheduling goals of the multiprocessor NT scheduler. The scheduler will always try to schedule a thread using soft affinity; that is, the scheduler attempts to assign the thread to the processor it last executed on.

NT implements soft affinity to take advantage of the possibility that some of the thread's data from the last time it ran on a processor is still in that processor's cache. In most cases, the next thread's data fills the cache, and the optimization isn't effective. When a new thread with higher priority than a running thread becomes ready to execute, the scheduler makes a decision based on a trade-off. The scheduler weighs the potential benefit of scheduling the new thread on the processor against the overhead that the pulled thread incurs when it moves to a new processor and loses its cached data.

A thread can also have hard affinity, which the application designer typically defines. (You can also use system utilities to set the hard affinity of all a process' threads.) The hard affinity of a thread is essentially a list of processors that the thread can execute on--the scheduler will never schedule a thread on a nonlisted processor.

Why would anyone want to use hard affinity? In some cases, you can improve overall performance if you distribute the threads of different applications (or even different threads of the same application) among different processors. For example, you can assign threads from Internet Information Server (IIS) to one processor and give SQL Server threads to all other processors. This assignment prevents IIS threads from competing for processors with the SQL Server threads, and the number of processors you assign to each application can reflect the relative priority of these applications with respect to the goals of the system you're managing. Divvying up processors using hard affinity is known as hard partitioning.

Because hard affinity is an all-or-nothing proposition, it can negatively affect performance in situations where the processors assigned to a particular application are busy and processors not in the hard-affinity list of the application's threads sit idle. NT 4.0 introduces a compromise: A programmer can assign an ideal processor to a thread.

The scheduler treats a thread's ideal processor much as it uses soft affinity: The scheduler tries to schedule a thread on its ideal CPU, but if that CPU is busy with a higher-priority thread, the scheduler looks at other processors in the thread's hard-affinity list. By using ideal processor settings, an application designer gives the scheduler hints about where threads need to run. Thus, the designer soft partitions the application.

Picking the Next Thread to Execute
Now that we're past some terminology, let's look at the FindReadyThread algorithm that NT uses to choose a new thread to execute on a particular CPU. FindReadyThread always executes on the CPU that's searching for the next thread to run. After acquiring the Dispatcher Ready List lock, FindReadyThread scans the Dispatcher Ready List for the highest-priority nonempty queue. FindReadyThread marks the first thread in the queue that has hard affinity for the CPU as the primary candidate for execution.

If the primary candidate has soft affinity for the CPU, if the CPU is the primary candidate's ideal processor, or if more than 20 milliseconds (on x86 systems) have elapsed since the primary candidate last executed, FindReadyThread chooses the primary candidate as the next thread to execute on the CPU. If the primary candidate doesn't satisfy any of these conditions, FindReadyThread looks down the queue for the first thread that does. If the algorithm finds an appropriate thread, the scheduler assigns that thread instead of the primary candidate; otherwise, the scheduler assigns the primary candidate to execute on the CPU. After the scheduler finishes its manipulation of the Dispatcher Ready List, it releases the list's lock.

As an example of FindReadyThread at work, consider the Dispatcher Ready List shown in Figure2. The scheduler must find a thread to run on CPU 1. The highest-priority queue with threads in it is the priority 10 queue. Thread 1 is the first thread in the queue, and it has hard affinity for CPU 1; thus, FindReadyThread marks Thread 1 as the primary candidate. However, Thread 1 does not satisfy any other condition to make it the immediate choice: Thread 1 didn't last run on CPU 1, its ideal processor is not CPU 1 (it doesn't even have an ideal processor), and it last ran 10 milliseconds (ms) ago. Therefore, FindReadyThread proceeds to scan the rest of the queue and comes across Thread 2, which also has hard affinity for CPU 1. Thread 2 satisfies the condition that it last ran on CPU 1, so Thread 2 is the scheduler's choice. Thus, the scheduler's soft-affinity goal causes it to favor Thread 2 over Thread 1.

Making a Thread Ready to Execute
When a thread becomes ready to execute, the scheduler must determine whether to place the thread in the Dispatcher Ready List or schedule it for immediate execution. On a uniprocessor system, this choice is straightforward: Given an executing thread and a thread to be scheduled, the scheduler sends the thread with the higher priority to the CPU and places the other thread in the Dispatcher Ready List.

On an SMP system, the decision is more complicated because the scheduler must consider multiple CPUs (unless the thread's hard affinity stipulates only one processor). ReadyThread, the algorithm responsible for this complex evaluation, uses soft affinity as its primary guide. After acquiring the Dispatcher Ready List lock, ReadyThread looks to see whether any idle processors (i.e., processors not executing instructions from an active thread) appear in the thread's hard-affinity list. If so, the scheduler's work is done; it signals the idle processor to execute the thread. (The scheduler picks the CPU it's running on if that CPU is a candidate; a CPU can be idle even though it's executing the scheduler because the scheduler executes in a nonthread-specific context).

If no processors are idle or the thread cannot execute on any thread, Ready-Thread looks at one other processor. If the thread has an ideal processor, the scheduler considers that CPU; otherwise, the scheduler examines the last processor that the thread executed on. If the thread has a priority that equals or exceeds the priority of the thread running on the CPU in question, the scheduler signals the CPU to stop executing its current thread and execute the new thread. In the case where the thread's priority is lower than the priority of the running thread, ReadyThread places the thread in the appropriate priority queue of the Dispatcher Ready List and releases the list's lock.

Unusual Consequences
If no processors are idle and the ready-to-execute thread has a lower priority than the thread running on the ready-to-execute thread's ideal or soft-affinity processor, ReadyThread can produce some unusual consequences because it doesn't evaluate other processors in the system. Consider the scenario in Figure3. A priority 9 thread (Thread 0) has just become ready to run, and even though it has a higher priority than the threads running on three of the four CPUs in the system, the scheduler places Thread 0 in the Dispatcher Ready List. Why? Thread 0's priority is lower than the priority of the thread running on the CPU that Thread 0 last executed on (Thread 1 on CPU 0 has priority 10). Thus, until FindReadyThread picks Thread 0 from the Dispatcher Ready List, the system's second highest-priority thread will wait for a processor.

ReadyThread can also potentially lead to needless movement (migration) of threads from one processor to another. Consider the variation of Figure3's scenario that Figure4 depicts. In this example, Thread 1 executing on CPU 0 has priority 8 instead of 10. ReadyThread will pull Thread 1 off CPU 0 in favor of Thread 0 because Thread 0 has a higher priority (9). Because Thread 1 is still ready to execute, NT calls ReadyThread for Thread 1. ReadyThread sees that Thread 1 has a lower priority than the thread executing on Thread 1's last processor (CPU 0); therefore, ReadyThread places Thread 1 in the Dispatcher Ready List.

If the next event that triggers FindReadyThread is the expiration of Thread 4's quantum, FindReadyThread pulls Thread 1 off the Dispatcher Ready List to execute on CPU 3 and puts Thread 4 on the list. At this point, Thread 1 has migrated from CPU 0 to CPU 3. Thread 4 might then migrate to CPU 1 or CPU 2 when one of them next invokes FindReadyThread.

NT could avoid unnecessary thread shuffling if ReadyThread considered only the system's lowest-priority executing thread in its scheduling decision, rather than using a soft-affinity strategy. Compare the thread movements diagrammed in Figure5a and Figure5b, in which threads with priorities 9, 8, and 7 are running on three CPUs. In the worst case for the soft-affinity strategy, a priority 10 thread that becomes ready-to-execute could set off all the shuffling shown in Figure5a. Alternatively, checking only the lowest-priority executing thread causes just the few movements shown in Figure5b.

The lowest-priority executing thread-scheduling strategy is simpler than the soft affinity-based ReadyThread algorithm and can eliminate many unnecessary thread migrations. The Solaris operating system uses this simpler algorithm, but Microsoft defends its use of soft affinity as a primary scheduling parameter by stating that SQL Server achieves higher throughput with this implementation.

Scalability Ramification
Microsoft bases NT's scheduling algorithms for SMP systems on the same principles it incorporates for NT's uniprocessor algorithms. However, efficiently using multiple processors complicates the scheduling problem.

Having more than one processor that the NT scheduler can assign a thread to leads to some interesting trade-offs in the ReadyThread algorithm--trade-offs that could potentially hinder NT's ability to effectively use extra processors that you add to a system (scalability). Because Microsoft has apparently decided that it will measure the scalability of NT by the performance of SQL Server, Microsoft has tuned NT's scheduling algorithms for this database application.

Hide comments


  • Allowed HTML tags: <em> <strong> <blockquote> <br> <p>

Plain text

  • No HTML tags allowed.
  • Web page addresses and e-mail addresses turn into links automatically.
  • Lines and paragraphs break automatically.