On The Thread Scheduling Problem

Wing Ning Li, Jing Fu Jenq

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationProceedings of the Fifth Joint Conference on Information Sciences, JCIS 2000, Volume 1
EditorsP.P. Wang, P.P. Wang
Pages449-452
Number of pages4
Edition1
StatePublished - 1 Dec 2000
EventProceedings of the Fifth Joint Conference on Information Sciences, JCIS 2000 - Atlantic City, NJ, United States
Duration: 27 Feb 20003 Mar 2000

Publication series

NameProceedings of the Joint Conference on Information Sciences
Number1
Volume5

Other

OtherProceedings of the Fifth Joint Conference on Information Sciences, JCIS 2000
CountryUnited States
CityAtlantic City, NJ
Period27/02/003/03/00

Fingerprint Dive into the research topics of 'On The Thread Scheduling Problem'. Together they form a unique fingerprint.

Cite this