Re: Gang Scheduling in linux

From: William Lee Irwin III (wli@holomorphy.com)
Date: Wed Jul 17 2002 - 12:40:36 EST


On Thu, Jul 18, 2002 at 06:21:41PM +0200, Ingo Molnar wrote:
> yes - the 'synchronous wakeup' feature is a form of gang scheduling. It in
> essence uses real process-communication information to migrate 'related'
> tasks to the same CPU. So it's automatic, no need to declare processes to
> be part of a 'gang' in some formal (and thus fundamentally imperfect) way.
> (another form of 'gang scheduling' can be achieved by binding the 'parent'
> process to a single CPU - all children will be bound to that CPU as well.)

Hit #1 on google.com: http://www.sw.nec.co.jp/hpc/sx-e/sx-world/no23/en10.pdf

   [SX-5 SERIES TECHNICAL HIGHLIGHTS]
   Overview of Gang Scheduling
   Koichi Nakanishi,
   Senior Manager
   Koji Suzuki,
   Assistant Manager
   4th Development Department, 1st Computers Software Division, Computers
   Software Operations Unit, NEC Corporation
   SX WORLD
   Autumn 1998 No.23 Special Issue

[...]

   The Gang scheduling function has the func-
   tion of simultaneously allocating the required
   number of CPUs when scheduling parallel
   programs, and allows you to obtain almost
   the same performance when multiple parallel
   programs are simultaneously executing, as if
   the programs were running alone.

I have approximately zero interest in this myself, but something seemed
off about the definition of gang scheduling being used in the post.

Cheers,
Bill
-
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/



This archive was generated by hypermail 2b29 : Tue Jul 23 2002 - 22:00:23 EST