Better Splitting Algorithms for Parallel Corpus Processing
نویسندگان
چکیده
منابع مشابه
Better Splitting Algorithms for Parallel Corpus Processing
Each iteration of minimum error rate training involves re-translating a development set. Distributing this work across computational nodes can speed up translation time, but in practice some parts may take much longer to complete than others, leading to computational slack time. To address this problem, we develop three novel algorithms for distributing translation tasks in a parallel computing...
متن کاملBetter Algorithms for Parallel Backtracking
Many algorithms in operations research and artiicial intelligence are based on the backtracking principle, i.e., depth rst search in implicitly deened trees. For parallelizing these algorithms, a load balancing scheme is needed which is able to evenly distribute the parts of an irregularly shaped tree over the processors. It should work with minimal interprocessor communication and without prio...
متن کاملData Splitting for Parallel Linear Algebra Monte Carlo Algorithms
Many scientific and engineering applications involve the inversion of large matrices or solving systems of linear algebraic equations. Solving these problems with proven algorithms for direct methods can take very long to compute, as they depend on the size of the matrix. The computational complexity of the Monte Carlo methods depend only on the number of chains and the length of those chains a...
متن کاملParallel Algorithms for Top-k Query Processing
The general problem of answering top-k queries can be modeled using lists of objects sorted by their local scores. Fagin et al. proposed the “middleware cost” for a top-k query algorithm, and proposed the efficient sequential Threshold Algorithm (TA). However, since the size of the dataset can be incredible huge, the middleware cost of sequential TA may be intolerable. So, in this paper, we pro...
متن کاملFFT Algorithms for SIMD Parallel Processing Systems
SIMD (single instruction stream-multiple data stream) algorithms for one-and two-dimensional discrete Fourier transforms are presented. Parallel structurings of algorithms for efficient computation for a variety of machine size/problem size combinations are presented and analyzed. Through these algorithms, techniques for exploiting relationships between problem size and machine size are demonst...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Prague Bulletin of Mathematical Linguistics
سال: 2012
ISSN: 1804-0462,0032-6585
DOI: 10.2478/v10108-012-0013-x