Improving Quasi-Dynamic Schedules Through Region Slip

Modern processors perform dynamic scheduling to achieve better utilization of execution resources. A schedule created at run-time is often better than one created at compile-time as it can dynamically adapt to specific events encountered at execution-time. In this paper, the authors examine some fundamental impediments to effective static scheduling. More specifically, they examine the question of why schedules generated quasi-dynamically by a low-level runtime optimizer and executed on a statically scheduled machine perform worse than using a dynamically-scheduled approach.

Provided by: University of Illinois Topic: Data Centers Date Added: Jan 2011 Format: PDF

Find By Topic