IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v34y1986i5p667-682.html
   My bibliography  Save this article

Nonlinear Network Programming on Vector Supercomputers: A Study on the CRAY X-MP

Author

Listed:
  • Stavros A. Zenios

    (University of Pennsylvania, Philadelphia, Pennsylvania)

  • John M. Mulvey

    (Princeton University, Princeton, New Jersey)

Abstract

The parallelism built into vector supercomputers raises several challenging issues for designers of optimization algorithms. We survey recent trends in parallel computer systems and study the impact of vector computing on nonlinear network programming. We propose a general framework for migrating fortran optimization software to a vector computer, and apply it in the context of two nonlinear network codes: NLPNETG, based on the primal truncated Newton algorithm, and GNSD, based on the simplicial decomposition method. We include computational experiments on a CRAY X-MP/24 system that tested the nonlinear network codes and compared the results with those of MINOS, a general purpose optimizer. Our experience indicates that vectorized codes can achieve significant improvements in performance (as much as 80% for primal truncated Newton), but achieve only modest improvements (15% for simplicial decomposition) for other algorithms.

Suggested Citation

  • Stavros A. Zenios & John M. Mulvey, 1986. "Nonlinear Network Programming on Vector Supercomputers: A Study on the CRAY X-MP," Operations Research, INFORMS, vol. 34(5), pages 667-682, October.
    • Handle: RePEc:inm:oropre:v:34:y:1986:i:5:p:667-682
    DOI: 10.1287/opre.34.5.667
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.34.5.667
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.34.5.667?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. M. A. Venkataramana & John J. Dinkel & John Mote, 1991. "Vector processing approach to constrained network problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(1), pages 71-85, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:34:y:1986:i:5:p:667-682. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.