[go: up one dir, main page]

IDEAS home Printed from https://ideas.repec.org/p/sce/scecf9/933.html
   My bibliography  Save this paper

Extending the Computational Horizon: Effective Distributed Resource-Bounded Computation for Intractable Problems

Author

Listed:
  • Harry J. Paarsch

    (University of Iowa)

  • Alberto M. Segre

    (University of Iowa)

Abstract
A number of combinatorial problems of interest to computational economists, such as some two-sided matching problems, belong to the complexity class NP. The best known solutions to these problems require exponential computation time in the size of the input, and are intractable in practice except for very small input size. We present an overview of a new distributed-computation technique called "nagging" that, while still exponential, allows one to harness multiple processors to extend the size of the largest solvable problem in a resource-bounded environment. Nagging requires relatively infrequent and brief interprocessor communication, is naturally tolerant (i.e., unaffected by the dynamic loss of processing elements), and exceptionally scalable in practice (i.e., robust in the presence of high message latencies, and, therefore, suitable for use in very large networks).

Suggested Citation

  • Harry J. Paarsch & Alberto M. Segre, 1999. "Extending the Computational Horizon: Effective Distributed Resource-Bounded Computation for Intractable Problems," Computing in Economics and Finance 1999 933, Society for Computational Economics.
  • Handle: RePEc:sce:scecf9:933
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:sce:scecf9:933. 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: Christopher F. Baum (email available below). General contact details of provider: https://edirc.repec.org/data/sceeeea.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.