Dynamically generating masks for thread scheduling in a...

Details Dynamically generating masks for thread scheduling in a... Dynamically generating masks for thread scheduling in a...

2007-09-25

2007-09-25

Bullock, Jr., Lewis A. (Department: 2195)

Electrical computers and digital processing systems: virtual mac

Task management or control

Process scheduling

C718S102000

Reexamination Certificate

active

10334341

ABSTRACT:
An embodiment of the invention is a technique to generate a mask schedule for thread scheduling in a multiprocessor system having N clusters of processors. A primary mask is obtained from a primary set of granularity masks. The granularity masks are created according to a thread granularity. The primary mask is filtered using a filter mask to generate a first affinity mask.

REFERENCES:
patent: 4809157 (1989-02-01), Eilert et al.
patent: 5301324 (1994-04-01), Dewey et al.
patent: 6658448 (2003-12-01), Stefaniak et al.
patent: 6721874 (2004-04-01), Le et al.
patent: 6724410 (2004-04-01), Arai
patent: 2002/0103847 (2002-08-01), Potash
patent: 2003/0088608 (2003-05-01), McDonald
patent: 2004/0019891 (2004-01-01), Koenen
patent: 2004/0054999 (2004-03-01), Willen et al.
IBM Technical Disclosure Bulletin. “Task/CPU Affinity Design.” Jul. 1973.
Lee, Shu-Ling et al. “A Cost-Effective Scheduling with Load Balancing for Multiprocessor Systems.” IEEE. 2000.
Zhou, Songnian et al. “Processor Pool-Based Scheduling for Large-Scale NUMA Multiprocessors.” ACM. 1991.

Affiliated with

Also associated with

Rating

Dynamically generating masks for thread scheduling in a... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamically generating masks for thread scheduling in a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamically generating masks for thread scheduling in a... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3744683