Microsoft KB Archive/100329: Difference between revisions

From BetaArchive Wiki
(stage2)
 
m (Text replacement - """ to """)
 
(One intermediate revision by the same user not shown)
Line 24: Line 24:
== SUMMARY ==
== SUMMARY ==


On page 88 of &quot;Inside Windows NT,&quot; Table 4-1 indicates that a process object contains a quota limit for the maximum amount of processor time that the process can use.<br />
On page 88 of "Inside Windows NT," Table 4-1 indicates that a process object contains a quota limit for the maximum amount of processor time that the process can use.<br />
<br />
<br />
This limit is not enforced in Windows NT versions 3.1, 3.5x , or 4.0.
This limit is not enforced in Windows NT versions 3.1, 3.5x , or 4.0.
Line 33: Line 33:
== MORE INFORMATION ==
== MORE INFORMATION ==


The key to understanding Windows NT thread scheduling and resultant application behavior is knowing the central algorithm used. This algorithm is very simple, and is the same one a number of other operating systems use. It is &quot;run the highest priority thread ready.&quot; A list of ready threads or processes exists; it is often called the &quot;dispatch queue&quot; or &quot;eligible queue.&quot; The queue entries are in order based on their individual priority. A hardware-driven real-time clock or interval timer will periodically interrupt, passing control to a device driver that calls the process or thread scheduler. The thread scheduler will take the highest priority entry from the queue and dispatch it to run.
The key to understanding Windows NT thread scheduling and resultant application behavior is knowing the central algorithm used. This algorithm is very simple, and is the same one a number of other operating systems use. It is "run the highest priority thread ready." A list of ready threads or processes exists; it is often called the "dispatch queue" or "eligible queue." The queue entries are in order based on their individual priority. A hardware-driven real-time clock or interval timer will periodically interrupt, passing control to a device driver that calls the process or thread scheduler. The thread scheduler will take the highest priority entry from the queue and dispatch it to run.


Additional query words: 3.10 3.50
Additional query words: 3.10 3.50

Latest revision as of 15:08, 19 July 2020

INFO: CPU Quota Limits Not Enforced

Q100329



The information in this article applies to:


  • Microsoft Win32 Application Programming Interface (API), used with:
    • the operating system: Microsoft Windows NT, versions 3.1, 3.5, 3.51, 4.0
    • the operating system: Microsoft Windows 2000





SUMMARY

On page 88 of "Inside Windows NT," Table 4-1 indicates that a process object contains a quota limit for the maximum amount of processor time that the process can use.

This limit is not enforced in Windows NT versions 3.1, 3.5x , or 4.0.



MORE INFORMATION

The key to understanding Windows NT thread scheduling and resultant application behavior is knowing the central algorithm used. This algorithm is very simple, and is the same one a number of other operating systems use. It is "run the highest priority thread ready." A list of ready threads or processes exists; it is often called the "dispatch queue" or "eligible queue." The queue entries are in order based on their individual priority. A hardware-driven real-time clock or interval timer will periodically interrupt, passing control to a device driver that calls the process or thread scheduler. The thread scheduler will take the highest priority entry from the queue and dispatch it to run.

Additional query words: 3.10 3.50

Keywords : kbKernBase kbOSWin2000 kbThread kbDSupport kbGrpDSKernBase
Issue type : kbinfo
Technology : kbAudDeveloper kbWin32sSearch kbWin32API


Last Reviewed: October 27, 2000
© 2001 Microsoft Corporation. All rights reserved. Terms of Use.