Lightweight Task Analysis for Cache-Aware Scheduling on Heterogeneous Clusters

Simple item page
dc.creatorGrehant, Xavier
dc.creatorJarp, Sverre
dc.date2009-02-27
dc.date.accessioned2026-07-07T12:47:35Z
dc.date.available2026-07-07T12:47:35Z
dc.descriptionWe 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.
dc.descriptionThe paper was originally published in: ISBN #: 1-60132-084-1 (a two-volume set) Proceedings of the 2008 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'08) Editors: Hamid R. Arabnia and Youngsong Mun
dc.identifierhttps://arxiv.org/abs/0902.4822
dc.identifierhttp://arxiv.org/abs/0902.4822
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/221769
dc.subjectDistributed, Parallel, and Cluster Computing
dc.subjectPerformance
dc.titleLightweight Task Analysis for Cache-Aware Scheduling on Heterogeneous Clusters
dc.typetext

Files

Collections

arXiv