Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watnot!watmath!clyde!cbatt!ihnp4!inuxc!pur-ee!uiucdcs!convex!graham
From: graham@convex.UUCP
Newsgroups: comp.arch
Subject: Re: Hypercube (partitioning)
Message-ID: <63900004@convex>
Date: Wed, 11-Mar-87 15:04:00 EST
Article-I.D.: convex.63900004
Posted: Wed Mar 11 15:04:00 1987
Date-Received: Fri, 13-Mar-87 21:17:32 EST
References: <633@ames.UUCP>
Lines: 16
Nf-ID: #R:ames.UUCP:633:convex:63900004:000:652
Nf-From: convex.UUCP!graham    Mar 11 14:04:00 1987


/* Written  1:59 am  Mar  9, 1987 by eugene@pioneer.arpa in convex:comp.arch */
>Definately, there is a problem of partitioning the problem to be
>solved into many subtasks and mapping these tasks to the real
>processors. The major concern is to balance the processor
>utilization and to minimize the possible communication among
>processors.
>-- Yao-Nan Lien

A paper was written some time ago about the general partitioning
problem.  It's NP-complete.  Not trivial.

I would like to get some references for the work that has been done on this
problem.  Can anyone help?

Marv Graham; Convex Computer Corp. {allegra,ihnp4,uiucdcs,ctvax}!convex!graham