Messages in this thread | | | Date | Thu, 18 Jul 2002 22:08:13 +0200 (CEST) | From | Ingo Molnar <> | Subject | Re: Gang Scheduling in linux |
| |
On Wed, 17 Jul 2002, Sam Mason wrote:
> It's mainly used for programs that needs lots of processing power > chucked at a specific problem, the problem is first broken down into > several small pieces and each part is sent off to a different processor. > When each piece has been processed, they are all recombined and the rest > of the calculation is continued. The problem with this is that if any > one of the pieces is delayed, all the processors will be idle waiting > for the interrupted piece to be processed, before they can process the > next set of pieces.
well, how does gang scheduling solve this problem? Even gang-scheduled tasks might be interrupted anytime on any CPU, by higher-priority tasks, thus causing a delay.
Ingo
- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| |