IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v30y1983i3p493-504.html
   My bibliography  Save this article

A heuristic procedure for allocating tasks in fault‐tolerant distributed computer systems

Author

Listed:
  • Joseph B. Mazzola
  • Alan W. Neebe

Abstract

One way of achieving the increased levels of system reliability and availability demanded by critical computer‐based control systems is through the use of fault‐tolerant distributed computer systems. This article addresses the problem of allocating a set of m tasks among a set of n processors in a manner that will satisfy various task assignment, system capacity, and task scheduling constraints while balancing the workload across processors. We discuss problem background, problem formulation, and a known heuristic procedure for the problem. A new solution‐improving heuristic procedure is introduced, and computational experience with the heuristics is presented. With only a modest increase in the amount of computational effort, the new procedure is demonstrated to improve dramatically solution quality as well as obtain near‐optimal solutions to the test problems.

Suggested Citation

  • Joseph B. Mazzola & Alan W. Neebe, 1983. "A heuristic procedure for allocating tasks in fault‐tolerant distributed computer systems," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 30(3), pages 493-504, September.
    • Handle: RePEc:wly:navlog:v:30:y:1983:i:3:p:493-504
    DOI: 10.1002/nav.3800300314
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800300314
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800300314?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
    ---><---

    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:wly:navlog:v:30:y:1983:i:3:p:493-504. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.