Re: Hypercube (partitioning)

Article View: comp.arch

Article #13161

#13161

From: Eugene Miya N.
Date: Mon, 09 Mar 1987 07:59

21 lines
1393 bytes

In article <3312@osu-eddie.UUCP> lien@osu-eddie.UUCP writes:
>From: Yao-Nan Lien <lien>
>
>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.

From the Rock of Ages Home for Retired Hackers:

--eugene miya
  NASA Ames Research Center
  eugene@ames-aurora.ARPA
  "You trust the `reply' command with all those different mailers out there?"
  "Send mail, avoid follow-ups.  If enough, I'll summarize."
  {hplabs,hao,ihnp4,decwrl,allegra,tektronix,menlo70}!ames!aurora!eugene

Technical Details

Message-ID: <633@ames.UUCP>

Path: arc1-ca.pugleaf.net!utzoo!mnetor!seismo!ll-xn!ames!pioneer!eugene

References: <3312@osu-eddie.UUCP>

Show Full Headers

Complete Article Headers

Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: arc1-ca.pugleaf.net!utzoo!mnetor!seismo!ll-xn!ames!pioneer!eugene
From: eugene@pioneer.arpa (Eugene Miya N.)
Newsgroups: comp.arch
Subject: Re: Hypercube (partitioning)
Message-ID: <633@ames.UUCP>
Date: Mon, 9-Mar-87 02:59:37 EST
Article-I.D.: ames.633
Posted: Mon Mar  9 02:59:37 1987
Date-Received: Mon, 9-Mar-87 20:09:40 EST
References: <3312@osu-eddie.UUCP>
Sender: usenet@ames.UUCP
Reply-To: eugene@pioneer.UUCP (Eugene Miya N.)
Organization: NASA Ames Research Center, Moffett Field, Calif.
Lines: 21

Reply to Parent Message