IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v90y1999i0p45-6310.1023-a1018972901171.html
   My bibliography  Save this article

The parallel search bench ZRAM and its applications

Author

Listed:
  • A. Brüngger
  • A. Marzetta
  • K. Fukuda
  • J. Nievergelt

Abstract

Distributed and parallel computation is, on the one hand, the cheapest way to increaseraw computing power. Turning parallelism into a useful tool for solving new problems, onthe other hand, presents formidable challenges to computer science. We believe that parallelcomputation will spread among general users mostly through the ready availability of convenientand powerful program libraries. In contrast to general‐purpose languages, a programlibrary is specialized towards a well‐defined class of problems and algorithms. This narrowfocus permits developers to optimize algorithms, once and for all, for parallel computers ofa variety of common architectures. This paper presents ZRAM, a portable parallel library ofexhaustive search algorithms, as a case study that proves the feasibility of achieving simultaneouslythe goals of portability, efficiency, and convenience of use. Examples of massivecomputations successfully performed with the help of ZRAM illustrate its capabilities anduse. Copyright Kluwer Academic Publishers 1999

Suggested Citation

  • A. Brüngger & A. Marzetta & K. Fukuda & J. Nievergelt, 1999. "The parallel search bench ZRAM and its applications," Annals of Operations Research, Springer, vol. 90(0), pages 45-63, January.
    • Handle: RePEc:spr:annopr:v:90:y:1999:i:0:p:45-63:10.1023/a:1018972901171
    DOI: 10.1023/A:1018972901171
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018972901171
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018972901171?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. Juan F. R. Herrera & José M. G. Salmerón & Eligius M. T. Hendrix & Rafael Asenjo & Leocadio G. Casado, 2017. "On parallel Branch and Bound frameworks for Global Optimization," Journal of Global Optimization, Springer, vol. 69(3), pages 547-560, November.

    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:90:y:1999:i:0:p:45-63:10.1023/a:1018972901171. 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.