Scheduling Tasks to Maximize Usage of Aggregate Variables In Place

Thumbnail
Name:
TR07-08.pdf
Size:
88.23Kb
Format:
PDF
View/Open
Author
Budimlić, Zoran; Kennedy, Ken; Mahmeed, Samah; McCosh, Cheryl; Rogers , Steve
Date
August 21, 2006
Abstract
We present an algorithm for greedy in-placeness that runs in O(TlogT + Ew V + V^2) 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.
Citation
Budimlić, Zoran, Kennedy, Ken, Mahmeed, Samah, et al.. "Scheduling Tasks to Maximize Usage of Aggregate Variables In Place." (2006) https://hdl.handle.net/1911/96358.
Type
Technical report
Citable link to this page
https://hdl.handle.net/1911/96358
Rights
You are granted permission for the noncommercial reproduction, distribution, display, and performance of this technical report in any format, but this permission is only for a period of forty-five (45) days from the most recent time that you verified that this technical report is still available from the Computer Science Department of Rice University under terms that include this permission. All other rights are reserved by the author(s).
Metadata
Show full item record
Collections