Apps & Design
Many of your questions may have already been answered in earlier discussions or in the FAQ. The search results page will indicate current discussions as well as past list serves, articles, and papers.
Alan Ward award at mypic.adMon Jul 3 09:23:43 PDT 2000
- Previous message: heterogenous clusters
- Next message: heterogenous clusters
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
---------- De: Gregory R. Warnes <warnes at biostat.washington.edu> A: Alan Ward <award at mypic.ad> CC: beowulf at beowulf.org Asunto: RE: Apps & Design Fecha: dissabte, 1 / juliol / 2000 18:07 > Careful. You are equating "the problem consists of independent pieces" > with parallelizable. No. I'm saying that parallelizable implies we have to be able to split it into independent pieces, but not the other way round. Since the translation problem cannot be split into "large" independent pieces, it follows that the Beowulf approach in not efficient in this case. Maybe at lower level (e.g. pattern searching, looking up words in a table) the problem is parallelizable. But then we need access from all processing nodes to all the data, and the bandwidh necessary goes up. This would be more for a multiprocessor machine; say 1024 CPUs sharing RAM through some sort of multidimensional lattice structure. Not off-the-shelf components. > Stating that natural language processing is inherently non-parallel > ignores the fact that the only system known to correctly process natural > language (the brain) is made up of a lot of independent processing units! But do these units work in parallel? My take is they work more as a mesh. Then again, I'm not a biologist and can't prove this impression. > The current tools may not correctly approach the problem correctly, but > that does not mean it isn't possible. > > -Greg Cheers, Alan Ward
- Previous message: heterogenous clusters
- Next message: heterogenous clusters
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
More information about the Beowulf mailing list
