Scheduling constrained dynamic applications on clusters

Kathleen Knobe, James M. Rehg, Arun Chauhan, Rishiyur S. Nikhil, Umakishore Ramachandran

Research output: Chapter in Book/Report/Conference proceedingConference contribution


There is an emerging class of computationally demanding multimedia applications involving vision, speech and interaction with the real world (e.g., CRLs Smart Kiosk). These applications are highly parallel and require low latencies for good performance. They are well-suited for implementation on clusters of SMP's, but they require efficient scheduling of application tasks. General purpose schedulers produce high latencies because they lack knowledge of the dependencies between tasks. Previous research in optimal scheduling has been limited to static problems. In contrast, our application is highly dynamic as the optimal schedule depends upon the behavior of the kiosk's customers. We observe that the dynamism of our application class is constrained, in that there are a small number of operating regimes which are determined by the state of the application. We present a framework for optimal scheduling of constrained dynamic applications. The results of an experimental comparison with a hand-tuned schedule are promising.

Original languageEnglish (US)
Title of host publicationACM/IEEE SC 1999 Conference, SC 1999
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages1
ISBN (Electronic)1581130910, 9781581130911
StatePublished - 1999
Externally publishedYes
Event1999 ACM/IEEE Conference on Supercomputing, SC 1999 - Portland, United States
Duration: Nov 13 1999Nov 19 1999

Publication series

NameACM/IEEE SC 1999 Conference, SC 1999


Other1999 ACM/IEEE Conference on Supercomputing, SC 1999
Country/TerritoryUnited States

ASJC Scopus subject areas

  • Hardware and Architecture


Dive into the research topics of 'Scheduling constrained dynamic applications on clusters'. Together they form a unique fingerprint.

Cite this