Scheduling Tasks to Maximize Usage of Aggregate Variables In Place
Date
2006-08-21
Journal Title
Journal ISSN
Volume Title
Publisher
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.
Description
Advisor
Degree
Type
Technical report
Keywords
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.
Has part(s)
Forms part of
Published Version
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).