IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v81y1998i0p27-5010.1023-a1018957107705.html
   My bibliography  Save this article

ASYNPLEX, an asynchronous parallelrevised simplex algorithm

Author

Listed:
  • J. Hall
  • K. McKinnon

Abstract

This paper describes ASYNPLEX, an asynchronous variant of the revised simplex methodwhich is suitable for parallel implementation on a shared memory multiprocessor or MIMDcomputer with fast inter-processor communication. The method overlaps simplex iterationson different processors. Candidates to enter the basis are tentatively selected using reducedcosts which may be out of date. Later, the up-to-date reduced costs of the tentative candidatesare calculated and candidates are either discarded or accepted to enter the basis. The implementationof this algorithm on a Cray T3D is described and results demonstrating significantspeed-up are presented. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • J. Hall & K. McKinnon, 1998. "ASYNPLEX, an asynchronous parallelrevised simplex algorithm," Annals of Operations Research, Springer, vol. 81(0), pages 27-50, June.
    • Handle: RePEc:spr:annopr:v:81:y:1998:i:0:p:27-50:10.1023/a:1018957107705
    DOI: 10.1023/A:1018957107705
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018957107705
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018957107705?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Ploskas, Nikolaos & Samaras, Nikolaos, 2015. "Efficient GPU-based implementations of simplex type algorithms," Applied Mathematics and Computation, Elsevier, vol. 250(C), pages 552-570.
    2. Péter Tar & Bálint Stágel & István Maros, 2017. "Parallel search paths for the simplex algorithm," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(4), pages 967-984, December.

    More about this item

    Statistics

    Access and download statistics

    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:spr:annopr:v:81:y:1998:i:0:p:27-50:10.1023/a:1018957107705. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.