Task clustering algorithm with improved efficiency

M Maiza; T Clarke

Task clustering algorithm with improved efficiency

Electronic Engineering

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	1070-1072
Number of pages	3
Journal	Electronics Letters
Volume	32
Issue number	12
Publication status	Published - 6 Jun 1996

Keywords

parallel processing
scheduling

Cite this

@article{df1669dbd1cd4adba278443b7c778231,

title = "Task clustering algorithm with improved efficiency",

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 = "parallel processing, scheduling",

author = "M Maiza and T Clarke",

year = "1996",

month = jun,

day = "6",

language = "English",

volume = "32",

pages = "1070--1072",

journal = "Electronics Letters",

publisher = "Institution of Engineering and Technology",

number = "12",

}

TY - JOUR

T1 - Task clustering algorithm with improved efficiency

AU - Maiza, M

AU - Clarke, T

PY - 1996/6/6

Y1 - 1996/6/6

N2 - 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.

AB - 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.

KW - parallel processing

KW - scheduling

M3 - Article

VL - 32

SP - 1070

EP - 1072

JO - Electronics Letters

JF - Electronics Letters

IS - 12

ER -