@inproceedings{315561b5c4454692bdf006ba61897991,
title = "Heuristics for generalized task system",
abstract = "With the advance of parallel processors, Generalized Task System (GTS) has been proposed to capture the notion of parallelism within a single task Based on this model, the complexity of minimizing the total (or average) flaw time for the preemptive and non-preemptive scheduling discipline has been proved to be binary NP-hard even when there are only two processors and each task has exactly two independent subtasks. In this paper, we propose a preemptive approximation algorithm to minimize the total flow time and its worst-case and average performance analyzed.",
keywords = "Approximate algorithm, Generalized task system, Parallel and identical processors, Preemptive scheduling, Total flow time",
author = "Ng, {Chung W.} and Leung, {Joseph Y.T.} and G. Young",
year = "2003",
language = "English (US)",
isbn = "1892512416",
series = "Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications",
pages = "1447--1453",
editor = "H.R. Arabnia and Y. Mun and H.R. Arabnia and Y. Mun",
booktitle = "Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2003",
note = "Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications ; Conference date: 23-06-2003 Through 26-06-2003",
}