This paper presents a new functional parallel language: Minimally Synchronous Parallel ML. The execution time can then be estimated and dead-locks and indeterminism are avoided. It shares with Bulk Synchronous Parallel ML its syntax and high-level semantics but it has a minimally synchronous distributed semantics. Programs are written as usual ML programs but using a small set of additional fun...

This paper reviews results related to the parallel machine scheduling problem under availability constraints. The motivation of this paper comes from the fact that no survey focusing on this specific problem was published. The problems of single machine, identical, uniform, and unrelated parallel machines under different constraints and optimizing various objective functions were analyzed. For ...

State-of-the-art statistical machine translation (SMT) technique requires a good quality parallel data to build a translation model. The availability of large parallel corpora has rapidly increased over the past decade. However, often these newly developed parallel data contains contain significant noise. In this paper, we describe our approach for classifying good quality parallel sentence pai...

We have extended D. H. D. Warren's abstract machine for sequential Prolog with parallel instructions that implement bounded quantiica-tions, an extension to Prolog proposed by Barklund and Bevemyr. These instructions are intended for parallel computers supporting the data parallel programming model. Luther, an emulator for the sequential abstract machine implemented in the C programming languag...