IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v28y2011i02ns0217595911003132.html
   My bibliography  Save this article

Tabu Search For Multiprocessor Scheduling: Application To High Level Synthesis

Author

Listed:
  • MARC SEVAUX

    (Université de Bretagne-Sud, UEB – Lab-STICC – CNRS, Centre de recherche, BP 92116, 56321 Lorient Cedex, France)

  • ALOK SINGH

    (Department of Computer and Information Sciences, University of Hyderabad, Hyderabad - 500046, Andhra Pradesh, India)

  • ANDRÉ ROSSI

    (Université de Bretagne-Sud, UEB – Lab-STICC – CNRS, Centre de recherche, BP 92116, 56321 Lorient Cedex, France)

Abstract

This paper describes a tabu search approach for a multiprocessor scheduling problem, where a list of jobs has to be scheduled on identical parallel processors. Each job in the list has a release date, a due date, a processing time and a set of predecessors. The objective is to minimize the number of processors used while respecting the constraints imposed by release dates, due dates and precedences. Two versions of this problem are considered here, in the first one precedence constraints are relaxed, they are taken into account in the second one. The proposed method is used to solve High Level Synthesis problem instances. The results show the effectiveness of our approach for both versions of the problem. A comparison with an exact method is also conducted.

Suggested Citation

  • Marc Sevaux & Alok Singh & André Rossi, 2011. "Tabu Search For Multiprocessor Scheduling: Application To High Level Synthesis," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 28(02), pages 201-212.
    • Handle: RePEc:wsi:apjorx:v:28:y:2011:i:02:n:s0217595911003132
    DOI: 10.1142/S0217595911003132
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595911003132
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595911003132?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.

    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:wsi:apjorx:v:28:y:2011:i:02:n:s0217595911003132. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.