• DocumentCode
    976623
  • Title

    Task clustering algorithm with improved efficiency

  • Author

    Maiza, M. ; Clarke, T.

  • Author_Institution
    Dept. of Electron., York Univ., UK
  • Volume
    32
  • Issue
    12
  • fYear
    1996
  • fDate
    6/6/1996 12:00:00 AM
  • Firstpage
    1070
  • Lastpage
    1072
  • Abstract
    The general problem of scheduling a set of tasks on a given parallel architecture is NP-complete. A scheduling heuristic introduced by Yang and Gerasoulis is considered, and two extensions are proposed which significantly improve efficiency at very low time complexity cost
  • Keywords
    computational complexity; parallel algorithms; processor scheduling; task analysis; NP-complete problem; efficiency; parallel architecture; scheduling heuristic; task clustering algorithm; time complexity;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

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