Advanced Search
MyIDEAS: Login

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

Contents:

Author Info

  • 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).

Download Info

To our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" 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.

Bibliographic Info

Paper provided by Society for Computational Economics in its series Computing in Economics and Finance 1999 with number 933.

as in new window
Length:
Date of creation: 01 Mar 1999
Date of revision:
Handle: RePEc:sce:scecf9:933

Contact details of provider:
Postal: CEF99, Boston College, Department of Economics, Chestnut Hill MA 02467 USA
Fax: +1-617-552-2308
Web page: http://fmwww.bc.edu/CEF99/
More information through EDIRC

Related research

Keywords:

This paper has been announced in the following NEP Reports:

References

No references listed on IDEAS
You can help add them by filling out this form.

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:sce:scecf9:933. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Christopher F. Baum).

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.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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