Task clustering algorithm with improved efficiency

M Maiza, T Clarke

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)1070-1072
Number of pages3
JournalElectronics Letters
Issue number12
Publication statusPublished - 6 Jun 1996


  • parallel processing
  • scheduling

Cite this