Hi Qin Gao,
I don't know if you remember our past discussion but I've now finished
my plans to parallelise EM with OpenMP and MPI. I am now writing up
and need to be able to compare my work with your own.
In MGiza++ you are using POSIX threads instead of OpenMP right. So,
did you employ
Another architecture to consider is storing/distributing the ttable
from a single central repository. Most of the ttable is full of crap,
and for each sentence, you know exactly what parameters will be
required in advance of running your E step. However, by not
distributing stuff that you don't
Hi all,
as the title suggest I am involved in a project which may involve
parallelising the code of Giza++ so that it will run on supercomputers
scalably on n number of processors. This would have obvious benefits
to any researchers making regular use of Giza++ who would like it to
finish
Hi James,
The GIZA++ is a very typical EM algorithm and probably you want to
parallelize the e-step since it takes long time then M-Step. You may want to
check out the PGIZA++ and MGIZA++ implementations which you can download in
my homepage:
http://www.cs.cmu.edu/~qing
And you may also be
Wow!
Thanks for that. That was great. I've had a quick read through your
paper. I'm guessing the basis of PGiza++ is OpenMPI calls and the
basis of MGiza++ is OpenMP calls right?
Your paper was very fascinating. You mentioned I/O bottlenecks quite a
lot with reference to PGiza++ which is
