Scheduling threads in a multi-processor computer

Electrical computers and digital processing systems: virtual mac – Task management or control – Process scheduling

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C718S102000, C710S260000

Reexamination Certificate

active

07831980

ABSTRACT:
Scheduling threads in a multi-processor computer system including establishing an interrupt threshold for a thread, where the interrupt threshold represents a maximum permissible number of interrupts during thread execution on a processor; executing the thread on a current processor, where the thread has thread affinity for one or more processors including the current processor; counting a number of interrupts during execution of the thread on the current processor; and removing thread affinity for the current processor in dependence upon the counted number of interrupts and the interrupt threshold.

REFERENCES:
patent: 5907702 (1999-05-01), Flynn et al.
patent: 6105051 (2000-08-01), Borkenhagen et al.
patent: 6212544 (2001-04-01), Borkenhagen et al.
patent: 6338078 (2002-01-01), Chang et al.
patent: 6542921 (2003-04-01), Sager
patent: 6697935 (2004-02-01), Borkenhagen et al.
patent: 6754690 (2004-06-01), Larson
patent: 7234143 (2007-06-01), Venkatasubramanian

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Scheduling threads in a multi-processor computer does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Scheduling threads in a multi-processor computer, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Scheduling threads in a multi-processor computer will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4237456

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.