Hi Martin Interesting work - thanks for sharing.
I was just curious about this comment: > Moses::Hypothesis::EvaluateWhenApplied method is dominated by > calculation of bit intervals. More precisely, for a given set > represented in bits: 010011, we would like identify consecutive zero > chunks: <3-4> and <6-6>. I am not familiar with any vector instruction > solution which can help Where is the calculation of bit intervals done? If this is a big issue, could they be precalculated somehow? Bit vectors start off as all zeroes, then each time a bit is flipped, the a zero chunk is split, cheers - Barry On 12/12/14 12:45, Martin Liška wrote: > Hello. > > As part of my SUSE Hackweek project ([1]), I've spent couple of days > playing with Moses performance tuning. I cooperated with Aleš and our > effort produced two patches that have been just merged to mainline. If > you are interested in more details, please visit my blog post: [2]. > I would be really happy if my blog post would become a kick-off for > further performance tuning. > > Thanks, > Martin Liška, > SUSE Labs > > [1] https://hackweek.suse.com/11/projects/284 > [2] http://marxin.github.io/posts/moses-performance-tuning/ > > _______________________________________________ > Moses-support mailing list > [email protected] > http://mailman.mit.edu/mailman/listinfo/moses-support -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. _______________________________________________ Moses-support mailing list [email protected] http://mailman.mit.edu/mailman/listinfo/moses-support
