• DocumentCode
    1094120
  • Title

    Scheduling parallel tasks on hypercubes

  • Author

    Lin, Jen-Fin ; Chen, Shi-Jaw

  • Author_Institution
    Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei
  • Volume
    30
  • Issue
    11
  • fYear
    1994
  • fDate
    5/26/1994 12:00:00 AM
  • Firstpage
    841
  • Lastpage
    842
  • Abstract
    The authors consider the problem of non-pre-emptively scheduled independent parallel tasks with communication overhead on a d-dimensional hypercube system. To find a schedule such that the schedule length is minimised is NP-hard. Therefore, a simple heuristic algorithm is investigated and its performance boundary is derived as (2+In m-1/m), where m=2d
  • Keywords
    hypercube networks; parallel processing; scheduling; NP-hard; d-dimensional hypercube system; heuristic algorithm; hypercube parallel task scheduling; nonpre-emptively scheduled independent parallel tasks; performance boundary; schedule length minimisation;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19940591
  • Filename
    287487
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1094120