Efficient task management in symmetric multi-processor systems

Details Efficient task management in symmetric multi-processor systems Efficient task management in symmetric multi-processor systems

2002-06-06

2008-12-09

An, Meng-Ai (Department: 2195)

Electrical computers and digital processing systems: virtual mac

Task management or control

Process scheduling

C718S100000, C718S104000, C725S087000, C709S231000

Reexamination Certificate

active

07464380

ABSTRACT:
A method of and apparatus for efficiently scheduling multiple instruction processors. The instruction processors are assigned to one of a plurality of clusters, such that the system ideally contains a plurality of clusters each having a plurality of instruction processors. Each cluster has a separate scheduling queue wherein the tasks for any one cluster have been selected to maximize cache memory hits by affinity scheduling. Instruction processors are scheduled from the scheduling queue associated with its assigned cluster whenever tasks remain within the cluster. Therefore, under normal system loading conditions, true affinity scheduling is accomplished providing maximum execution efficiency. However, whenever an instruction processor requests assignment and the associated cluster scheduling queue is empty, the instruction processor requests assignment of a task from another scheduling queue associated with a different cluster.

REFERENCES:
patent: 5784614 (1998-07-01), Davis
patent: 5872972 (1999-02-01), Boland et al.
patent: 6289369 (2001-09-01), Sundaresan
patent: 6490725 (2002-12-01), Kikinis
patent: 6769017 (2004-07-01), Bhat et al.
patent: 6839808 (2005-01-01), Gruner et al.
patent: 6993762 (2006-01-01), Pierre
patent: 6996822 (2006-02-01), Willen et al.
patent: 7096271 (2006-08-01), Omoigui et al.
Sqillante et al., “Using Processor-Cache Affinity Information in Shared-Memory Multprocessor Scheduling”, 1993, IEEE, pp. 131-143.
Brecht, “An Experimental Evaluation of Processor Pool-Based Scheduling for Shared-Memory NUMA Multiprocessors”, 1997, Springer-Verlag, Lecture Notes in Computer Science, vol. 1291, pp. 1-27.
Zhou et al., “Processor Pool-Based Scheduling for Large-Scale NUMA Multiprocessors”, 1991, ACM, pp. 133-142.
Hamidzadeh, “Dynamic Task Scheduling Using One Optimization”, IEEE, 2000, pp. 1151-1163.

Affiliated with

Also associated with

Rating

Efficient task management in symmetric multi-processor systems does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Efficient task management in symmetric multi-processor systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient task management in symmetric multi-processor systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4052031