Scheduling Tasks to Maximize Usage of Aggregate Variables in Place

@inproceedings{AbuMahmeed2009SchedulingTT,
  title={Scheduling Tasks to Maximize Usage of Aggregate Variables in Place},
  author={Samah Abu-Mahmeed and Cheryl McCosh and Zoran Budimlic and Ken Kennedy and Kaushik Ravindran and Kevin Hogan and Paul Austin and Steve Rogers and Jacob Kornerup},
  booktitle={CC},
  year={2009}
}
We present an algorithm for greedy in-placeness that runs in O(T logT + EwV +V ) time, where T is the number of in-placeness opportunities, Ew is the aggregate number of wire successors and v is the number of virtual instruments in a program graph.