In this paper we present the algorithmic framework and practical aspects of implementing a parallel version of a primal-dual semidefinite programming solver on a distributed memory computer cluster. Our implementation is based on the CSDP solver and uses a message passing interface (MPI), and...

We present a parallelization of the revised simplex method for large extensive forms of two-stage stochastic linear programming (LP) problems. These problems have been considered too large to solve with the simplex method; instead, decomposition approaches based on Benders decomposition or, more...

In this work we propose a highly optimized version of a simulated annealing (SA) algorithm adapted to the more recently developed graphic processor units (GPUs). The programming has been carried out with compute unified device architecture (CUDA) toolkit, specially designed for Nvidia GPUs. For...

This work deals with parallel algorithms for the optical design and analysis of solar fields for Central Receiver Systems. The proposed implementation based on desktop workstations equipped with multiple Graphics Processing Units (GPU) is motivated by the need to have an accurate and fast...

The parameterized expectations algorithm (PEA) involves a long simulationand a nonlinear least squares (NLS) fit, both embedded in a loop. Both steps are natural candidates for parallelization.This note shows that parallelization can lead to important speedups forthe PEA.I provide example code...

The nature of computing is changing and it poses both challenges and opportunities for economists. Instead of increasing clock speed, future microprocessors will have "multi-cores" with separate execution units. "Threads" or other multi-processing techniques that are rarely used today are...