Scheduling Tasks to Maximize Usage of Aggregate Variables In Place

Simple item page
dc.contributor.authorBudimlić, Zoran
dc.contributor.authorKennedy, Ken
dc.contributor.authorMahmeed, Samah
dc.contributor.authorMcCosh, Cheryl
dc.contributor.authorRogers , Steve
dc.date.accessioned2017-08-02T22:03:05Z
dc.date.available2017-08-02T22:03:05Z
dc.date.issued2006-08-21
dc.date.noteAugust 21, 2006
dc.description.abstractWe 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.extent8 pp
dc.identifier.citationBudimli?, Zoran, Kennedy, Ken, Mahmeed, Samah, et al.. "Scheduling Tasks to Maximize Usage of Aggregate Variables In Place." (2006) https://hdl.handle.net/1911/96358.
dc.identifier.digitalTR07-08
dc.identifier.urihttps://hdl.handle.net/1911/96358
dc.language.isoeng
dc.rightsYou 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.titleScheduling Tasks to Maximize Usage of Aggregate Variables In Place
dc.typeTechnical report
dc.type.dcmiText
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR07-08.pdf
Size:
88.23 KB
Format:
Adobe Portable Document Format
Download
Collections
Computer Science Technical Reports