Show simple item record

dc.contributor.authorBudimlić, Zoran
Kennedy, Ken
Mahmeed, Samah
McCosh, Cheryl
Rogers , Steve
dc.date.accessioned 2017-08-02T22:03:05Z
dc.date.available 2017-08-02T22:03:05Z
dc.date.issued 2006-08-21
dc.identifier.urihttps://hdl.handle.net/1911/96358
dc.description.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.
dc.format.extent 8 pp
dc.language.iso eng
dc.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).
dc.title Scheduling Tasks to Maximize Usage of Aggregate Variables In Place
dc.type Technical report
dc.date.note August 21, 2006
dc.identifier.digital TR07-08
dc.type.dcmi Text
dc.identifier.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.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record