• Home
  • Search
  • Data Parallel Quadratic Programming on Box-Constrained Problems
  • Cite Icon5
  • https://doi.org/10.1137/0805029Copy DOI Icon

Data Parallel Quadratic Programming on Box-Constrained Problems

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We develop designs for the data parallel solution of quadratic programming problems subject to box constraints. In particular, we consider the class of algorithms that iterate between projection steps that identify candidate active sets and conjugate gradient steps that explore the working space. Using the algorithm of Moré and Toraldo [Report MCS-p77-05 89, Argonne National Laboratory, Illinois, 1989] as a specific instance of this class of algorithms we show how its components can be implemented efficiently on a data-parallel SIMD computer architecture. Alternative designs are developed for both arbitrary, unstructured Hessian matrices and for structured problems. Implementations are carried out on a Connection Machine CM–2. They are shown to be very efficient, achieving a peak computing rate over 2 Gflops. Problems with several hundred thousand variables are solved within one minute of solution time on the 8K CM–2. Extremely large test problems, with up to 2.89 million variables, are also solved efficiently. The data parallel implementation outperforms a benchmark implementation of interior point algorithms on an IBM 3090-600S vector supercomputer and a successive overrelaxation algorithm on an Intel iPSC/860 hypercube.

Similar Papers
  • Book Chapter
  • Citations14

Data parallelism and functional programming

  • Jan 01, 1996
  • Björn Lisper
  • Single Report

Parallelizing the SDI ACCESS algorithm for the Connection Machine-2

  • Dec 01, 1989
  • J Rutkowski +3
  • Research Article
  • Citations54

Sparsity-preserving sor algorithms for separable quadratic and linear programming

  • Jan 01, 1984
  • Computers & Operations Research
  • O.L Mangasarian
  • Conference Article
  • Citations7

The heart of object-oriented concurrent programming

  • Jan 01, 1988
  • J Lim +1
  • Research Article
  • Citations3

The heart of object-oriented concurrent programming

  • Sep 26, 1988
  • ACM SIGPLAN Notices
  • J Lim +1
  • Research Article

Mapping strategies in data parallel programming models; the projection methods

  • Jan 01, 2001
  • Scalable Computing Practice and Experience
  • Nahid Emad
  • Research Article
  • Citations1

Tuning Task Granularity and Data Locality of Data Parallel GPH Programs

  • Dec 01, 2001
  • Parallel Processing Letters
  • H Loidl
  • Book Chapter
  • Citations10

Adaptor: A Compilation System for Data Parallel Fortran Programs

  • Jan 01, 1994
  • Thomas Brandes
  • Book Chapter
  • Citations26

A Tutorial on Parallel and Concurrent Programming in Haskell

  • Jan 01, 2009
  • Simon Peyton Jones +1
  • Conference Article
  • Citations28

Braid: integrating task and data parallelism

  • Nov 19, 2002
  • E.A West +1
  • Conference Article
  • Citations4

Load balancing and performance issues for the data parallel simulation of stiff chemical nonequilibrium flows

  • Jan 09, 1995
  • 33rd Aerospace Sciences Meeting and Exhibit
  • James Weber +4
  • Research Article
  • Citations4

Load Balancing and Performance Issues for Data Parallel

  • Mar 01, 1997
  • AIAA Journal
  • James W Weber +3
  • Research Article
  • Citations1

Load balancing and performance issues for data parallel simulation of stiff chemical nonequilibrium flows

  • Jan 01, 1997
  • AIAA Journal
  • James W Weber +3
  • Conference Article

Data parallelism in Haskell

  • Sep 23, 2013
  • Manuel M.T Chakravarty
  • Conference Article
  • Citations7

DEEP: a development environment for parallel programs

  • Mar 30, 1998
  • B.Q Brode +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.