An efficient parallel dynamic programming algorithm

An Efficient Parallel Algorithm for Linear Programming Problems

This study developed a parallel algorithm to efficiently solve linear programming models. The proposed algorithm utilizes the Dantzig-Wolfe Decomposition Principle and can be easily implemented in a general distributed computing environment. The analytical performance of the new algorithm, including the speedup upper bound and lower bound limits, was derived. Numerical experiments are also prov...

An Efficient Policy Iteration Algorithm for Dynamic Programming Equations

We present an accelerated algorithm for the solution of static Hamilton-JacobiBellman equations related to optimal control problems. Our scheme is based on a classic policy iteration procedure, which is known to have superlinear convergence in many relevant cases provided the initial guess is sufficiently close to the solution. This limitation often degenerates into a behavior similar to a valu...

An Efficient Parallel Biconnectivity Algorithm

Parallel Programming – a B . S . course on how to design an efficient parallel algorithm

This paper describes a new course in parallel programming at the University of Oslo that emphasis thread based parallel programming in Java on multicore computers. The quality of a parallel algorithm is evaluated by its speedup, since the main reason for making a parallel algorithm is to create a faster program. This course stresses that there are many possible correct parallel algorithms for a...

An Efficient Mapping Strategy for Parallel Programming

Obtaining an effective execution of a parallel system requires that the mapping of the processes (of the parallel software) on the processors (of the parallel hardware) is efficiently performed. Hence, this paper presents an efficient mapping strategy based on optimizing communications between processes as well as load balancing process distribution onto an arbitrary processor network. Such a m...