Paper Info
Title
Do we need a crystal ball for task migration?
Abstract
For communication-intensive applications on distributed memory systems, performance is bounded by remote memory accesses. Task migration is a potential candidate for reducing network traffic in such applications, thereby improving performance. We seek to answer the question: can a run-time profitably predict when it is better to move the task to the data than move the data to the task? Using a simple model where local work is free and data transferred over the network is costly, we show that a best case task migration schedule can achieve up to 3.5× less total data transferred than no migration for some benchmarks. Given this observation, we develop and evaluate two online task migration policies: Stream Predictor, which uses only immediate remote access history, and Hindsight Migrate, which tracks instruction addresses where task migration is predicted to be beneficial. These predictor policies are able to provide benefit over execution with no migration for small or moderate size tasks on our tested applications.
Year
Venue
Keywords
2012
HotPar
online task migration policy,network traffic,best case task migration,moderate size task,total data,task migration,remote memory access,crystal ball,hindsight migrate,immediate remote access history,memory system
Field
DocType
Citations 
Computer science,Real-time computing,Remote memory,Hindsight bias,Distributed memory systems,Distributed computing,Bounded function
Conference
0
PageRank 
References 
Authors
0.34
8
2
Name
Order
Citations
PageRank
Brandon Myers1615.14
Brandon Holt2503.63