Electrical computers and digital processing systems: virtual mac – Task management or control – Process scheduling
Reexamination Certificate
2011-01-04
2011-01-04
Zhen, Li B (Department: 2195)
Electrical computers and digital processing systems: virtual mac
Task management or control
Process scheduling
C711S118000
Reexamination Certificate
active
07865895
ABSTRACT:
A mechanism is provided for determining whether to use cache affinity as a criterion for software thread dispatching in a shared processor logical partitioning data processing system. The server firmware may store data about when and/or how often logical processors are dispatched. Given these data, the operating system may collect metrics. Using the logical processor metrics, the operating system may determine whether cache affinity is likely to provide a significant performance benefit relative to the cost of dispatching a particular logical processor to the operating system.
REFERENCES:
patent: 5063500 (1991-11-01), Shorter
patent: 5185861 (1993-02-01), Valencia
patent: 5261053 (1993-11-01), Valencia
patent: 5345590 (1994-09-01), Ault et al.
patent: 5692193 (1997-11-01), Jagannathan et al.
patent: 5802386 (1998-09-01), Kahle et al.
patent: 5872972 (1999-02-01), Boland et al.
patent: 6058466 (2000-05-01), Panwar et al.
patent: 6243788 (2001-06-01), Franke et al.
patent: 6615316 (2003-09-01), McKenney et al.
patent: 6625638 (2003-09-01), Kubala et al.
patent: 6665699 (2003-12-01), Hunter et al.
patent: 6996822 (2006-02-01), Willen et al.
patent: 7178145 (2007-02-01), Bono
patent: 7318128 (2008-01-01), Dice
patent: 7340522 (2008-03-01), Basu et al.
patent: 7464380 (2008-12-01), Hempel
patent: 2002/0004966 (2002-01-01), Wakat et al.
patent: 2005/0210472 (2005-09-01), Accapadi et al.
patent: 2006/0036810 (2006-02-01), Accapadi et al.
patent: 2006/0133418 (2006-06-01), Anand
patent: 2006/0168217 (2006-07-01), Anand
patent: 2006/0206891 (2006-09-01), Armstrong et al.
patent: 2007/0061805 (2007-03-01), Brenner
patent: 2007/0271564 (2007-11-01), Anand et al.
patent: 2008/0235684 (2008-09-01), Anand et al.
patent: 2009/0235270 (2009-09-01), Anand et al.
U.S. Appl. No. 11/419,047; Image File Wrapper, Jun. 29, 2010, 2 pages.
U.S. Appl. No. 12/130,064; Image File Wrapper, Jun. 29, 2010, 2 pages.
U.S. Appl. No. 12/130,090; Image File Wrapper, Jun. 29, 2010, 1 page.
Anand et al., “Method, Apparatus, and Program Product for Optimizazation of Thread Wake Up for Shared Processor Partitions”, IBM Corporation, U.S. Appl. No. 11/419,047, filed May 18, 2006.
U.S. Appl. No. 11/077,324, filed Mar. 10, 2005, Armstrong et al.
Notice of Allowance mailed Sep. 3, 2010 for U.S. Appl. No. 11/419,047; 11 pages.
Office Action dated Aug. 5, 2010 in U.S. Appl. No. 12/130,064, 28 pages.
Fowler, Robert J. et al., “Mercury: Object-Affinity Scheduling and Continuation Passing on Multiprocessors”, Springer Berlin/Heidelberg, vol. 817, 1994, pp. 661-676.
Squillante, M. S., “Issues in Shared-Memory Multiprocessor Scheduling: A Performance Evaluation PhD thesis”, Department of Computer Science and Engineering, University of Washington, Oct. 1990, 172 pages.
Anand Vaijayanthimala K.
Burdick Dean J.
Olszewski Bret R.
Baca Matthew W.
International Business Machines - Corporation
Lee Adam
Tkacs Stephen R
Walder, Jr. Stephen J.
LandOfFree
Heuristic based affinity dispatching for shared processor... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Heuristic based affinity dispatching for shared processor..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Heuristic based affinity dispatching for shared processor... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2667461