Electrical computers and digital processing systems: virtual mac – Task management or control – Process scheduling
Reexamination Certificate
2007-11-27
2007-11-27
Thomson, William (Department: 2194)
Electrical computers and digital processing systems: virtual mac
Task management or control
Process scheduling
C718S103000, C718S104000, C710S112000, C370S412000
Reexamination Certificate
active
09884009
ABSTRACT:
Various implementations of the described subject associate a plurality of threads that are sorted based on thread priority with a run queue in a deterministic amount of time. The run queue includes a first plurality of threads, which are sorted based on thread priority. The second plurality of threads is associated with the run queue in a bounded, or deterministic amount of time that is independent of the number of threads in the associated second plurality. Thus, the various implementations of the described subject matter allow an operating system to schedule other threads for execution within deterministic/predetermined time parameters.
REFERENCES:
patent: 5274642 (1993-12-01), Widjaja et al.
patent: 5379297 (1995-01-01), Glover et al.
patent: 5406556 (1995-04-01), Widjaja et al.
patent: 5440553 (1995-08-01), Widjaja et al.
patent: 5872938 (1999-02-01), Williams
patent: 6003101 (1999-12-01), Williams
patent: 6081507 (2000-06-01), Chao et al.
patent: 6370144 (2002-04-01), Chao et al.
patent: 6389031 (2002-05-01), Chao et al.
patent: 6411982 (2002-06-01), Williams
patent: 6501731 (2002-12-01), Chong et al.
patent: 6570876 (2003-05-01), Aimoto
patent: 6609161 (2003-08-01), Young
patent: 6724767 (2004-04-01), Chong et al.
patent: 6742053 (2004-05-01), Young
patent: 6789134 (2004-09-01), Young
patent: 6883042 (2005-04-01), Young
patent: 6937561 (2005-08-01), Chiussi et al.
patent: 6938102 (2005-08-01), Young
patent: 2002/0141427 (2002-10-01), McAlpine
patent: 2004/0028067 (2004-02-01), Chong et al.
http://en.wikipedia.org/wiki/Thread.
Silberschatz et al., Applied Operating System Concepts, Published in 2000, John Wiley and Sons, Inc, First Edition, pp. 162-164.
Fredman et al. “Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms” IEEE Proceedings Oct. 24, 1984, pp. 338-346.
Intermetrics Inc. “Implementation Module 1—Protected Records, Operator Visibility, Child Packages”, ADA 95 Language Study Notes—ADA 95 Mapping/Revision Team, Feb. 1992, retrieved from http://archive.adaic.com/standards/951sn/im-001.txt on Mar. 7, 2006.
Silberschatz et al. “Operating System Concepts—Fourth Edition” Jan. 1994, pp. 97-115,131-133,140-147.
Sridhar et al. “Probabilistic data structures for priority queues” Algorithm Theory—SWAT '98. 6th Scandinavian workshop on Algorithm Theory. Proceedings Springer-Veralg Berlin, Germany, Jul. 1998, pp. 143-154.
Vuillemin J. “A data structure for manipulating priority queues”, Communications of the ACM USA, vol. 21, No. 4 Apr. 1978. pp. 309-315.
EPO Communication with Search Report dated Mar. 27, 2006, from counterpart EP patent application, European Patent Application No. 02010606.8, copy attached, 3 pages.
Microsoft Corporation
Thomson William
Wu Qing-Yuan
LandOfFree
Systems and methods for managing a run queue does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Systems and methods for managing a run queue, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Systems and methods for managing a run queue will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3879298