Molecular mechanics and dynamics are becoming widely used to perform simulations of molecular systems from large-scale computations of materials to the design and modeling of drug compounds. Many implementations of parallel molecular dynamics have been developed , but few groups have addressed issues related to the use of massively parallel machines with 100K to 1M processors for small to modes...

We have designed a functional data-parallel language called BSML for programming bulksynchronous parallel (BSP) algorithms in so-called direct mode. In a direct-mode BSP algorithm, the physical structure of processes is made explicit. The execution time can then be estimated and dead-locks and indeterminism are avoided. The BSMLlib library has been implemented for the Objective Caml language. B...

.

Bulk Synchronous Parallel ML or BSML is an extension of ML for programming direct-mode parallel Bulk Synchronous Parallel algorithms as functional programs. Bulk-Synchronous Parallel (BSP) computing is a parallel programming model introduced by Valiant [20] to offer a high degree of abstraction like PRAM models and yet allow portable and predictable performance on a wide variety of architecture...

Parallel Machine Learning Using Concurrency Control by Xinghao Pan Doctor of Philosophy in Computer Science and the Designated Emphasis in Communications, Computation and Statistics University of California, Berkeley Professor Michael I. Jordan, Chair Many machine learning algorithms iteratively process datapoints and transform global model parameters. It has become increasingly impractical to ...

A new formal model of parallel computations – the Kirdin kinetic machine – is suggested in [1]. It is expected that this model will play the role for parallel computations similar to Markov normal algorithms, Kolmogorov and Turing machine or Post schemes for sequential computations. The basic ways in which computations are realized are described; correctness of the elementary programs for the K...

Many different Parallel kinematic machine architectures have been proposed, but few have actually been used in production environments. The class of machine structures referred to as hybrid parallel kinematic machines have been more successful than most and have been employed in a wide variety of applications. These machines are however still affected by many of the limitations associated with ...

In this research, Lagrangian relaxation algorithms are proposed for Hybrid Flow-Shop (HFS) scheduling problems. Conventional HFS consists of a series of production stages, each of which has several identical parallel machines and no buffer spaces are considered. Jobs are processed through all stages in the same direction. In the previous researches, they are assumed that the capacity of buffer ...