IDEAS home Printed from https://ideas.repec.org/a/icf/icfjcs/v7y2013i3p7-26.html
   My bibliography  Save this article

Performance of a Few Gang Scheduling Algorithms for Multiprocessor Scheduling

Author

Listed:
  • R Siyambalapitiya
  • M Sandirigama

Abstract

In this study, the performance of several approximation algorithms for multiprocessor scheduling is considered. Multiprocessor scheduling is an NP-hard problem which means that it may not be possible to design exact algorithms to solve this problem to optimality. Therefore, designing of approximation algorithms to solve this problem appears to be the only option available. The algorithms considered are designed incorporating the gang scheduling approach. An attempt is made to obtain solutions close to optimal using these algorithms. The study shows that these algorithms can be used to solve even large-scale problems occurring in practice.

Suggested Citation

  • R Siyambalapitiya & M Sandirigama, 2013. "Performance of a Few Gang Scheduling Algorithms for Multiprocessor Scheduling," The IUP Journal of Computer Sciences, IUP Publications, vol. 0(3), pages 7-26, July.
    • Handle: RePEc:icf:icfjcs:v:7:y:2013:i:3:p:7-26
    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:icf:icfjcs:v:7:y:2013:i:3:p:7-26. 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: G R K Murty (email available below). General contact details of provider: .

    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.