Browse thread
Cluster Multiprocessing
-
David McClain
-
Vitaly Lugovsky
- Ward Wheeler
- William Chesters
- jean-marc alliot
-
Vitaly Lugovsky
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
| Date: | -- (:) |
| From: | Ward Wheeler <wheeler@a...> |
| Subject: | Re: Cluster Multiprocessing |
Hello,
I've been using CAML and PVM for about 5 years now, most recently
on a cluster of 256 CPUs in 128 boxes. The code is used for the
construction of phylogenetic trees from molecular and other data. All of
our code is at ftp.amnh.org /pub/molecular/poy. The setup seems to work
very well, but as mentioned in a previous note, this is message passing and
has no shared memory among machines.
Ward Wheeler
>On Thu, 16 Nov 2000, David McClain wrote:
>
> > I am about to embark on a project that seeks to reduce the computation time
> > of a large problem from 100+ hours to less than 20 minutes. This is
> > initially though to require a cluster of multiprocessors using either a
> > Beowulf architecture, or a large, shared memory, message passing,
> > architecture. I am interested in the suitability (or otherwise) of OCaml to
> > such computations and the experiences of anyone else in this group on such
> > architectures. Garbage collection across nodes in a shared memory
> > architecture seems like a particularly daunting problem.
> >
> > Any responses would be appreciated.
>
> Shared memory architectures is just the same as ordinary multithereaded
>environment. And, there are PVM3 and MPI bindings for OCaml, if you want
>to use message-passing clustering.
>
>--
>
> V.S.Lugovsky aka Mauhuur (http://ontil.ihep.su/~vsl) (UIN=45482254)
*********************************
Ward Wheeler
Division of Invertebrate Zoology
American Museum of Natural History
Central Park West @ 79th St.
New York, NY 10024-5192
1-212-769-5754 (Voice)
1-212-769-5783 (FAX)
*********************************