@inproceedings{7cba6a86e52d4f86bc37f7ba409ca2de,
title = "On The Thread Scheduling Problem",
abstract = "The thread scheduling problem abstracts the problem of minimizing memory latency, using a directed data dependency graph generated form a compiler, to improve run time efficiency. Two thread scheduling problems are formulated and shown to be strongly NP-hard. New algorithms for analyzing a data dependency graph and for estimating the required minimum number of PEs needed to achieve certain finishing time are presented. The new methods improve upon some of the existing analysis and transformation techniques.",
author = "Li, {Wing Ning} and Jenq, {Jing Fu}",
year = "2000",
language = "English",
isbn = "0964345692",
series = "Proceedings of the Joint Conference on Information Sciences",
number = "1",
pages = "449--452",
editor = "P.P. Wang and P.P. Wang",
booktitle = "Proceedings of the Fifth Joint Conference on Information Sciences, JCIS 2000, Volume 1",
edition = "1",
note = "Proceedings of the Fifth Joint Conference on Information Sciences, JCIS 2000 ; Conference date: 27-02-2000 Through 03-03-2000",
}