rburns at cs.ucsb.edu
Thu May 29 03:37:03 EDT 2003
Thanks for the info,
Performance was one of my concerns, I should have figured something
as transparent as I was looking for wouldn't be very fast. Looks like
my only path is going to lead me to hacking more libraries. If I can get
the useful information another way, I can then send it without using DSM.
On Thu, 29 May 2003 00:15:12 -0700
"Greg Lindahl" <lindahl at keyresearch.com> wrote:
> On Wed, May 28, 2003 at 05:18:10PM -0700, Ryan Burns wrote:
> > I'm looking for a transparent DSM solution.
> If you look around, you'll find 30+ projects that have produced DSM
> with varying degrees of transparency. You'll find that performance is
> quite low for a very transparent solution -- so it works OK only for
> programs which are nearly embarrassingly parallel.
> > Each thread/process needs to read shared memory from 1 specific
> > thread/process which is part of the user application. So imagine I
> > take a user application, that I know nothing about, fork it a few
> > times onto other nodes, then each node needs to read memory from that
> > original process.
> If your user application wrote and read files (or named pipes) instead
> of using shared memory, you could produce something probably much
> higher in performance, with much less work.
> -- greg
> Beowulf mailing list, Beowulf at beowulf.org
> To change your subscription (digest mode or unsubscribe) visit
Beowulf mailing list, Beowulf at beowulf.org
To change your subscription (digest mode or unsubscribe) visit http://www.beowulf.org/mailman/listinfo/beowulf
More information about the Beowulf