2000 character limit reached
Lightweight Task Analysis for Cache-Aware Scheduling on Heterogeneous Clusters (0902.4822v1)
Published 27 Feb 2009 in cs.DC and cs.PF
Abstract: We present a novel characterization of how a program stresses cache. This characterization permits fast performance prediction in order to simulate and assist task scheduling on heterogeneous clusters. It is based on the estimation of stack distance probability distributions. The analysis requires the observation of a very small subset of memory accesses, and yields a reasonable to very accurate prediction in constant time.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
