Scheduling Tasks to Maximize Usage of Aggregate Variables In Place

Simple item page
dc.contributor.authorBudimlić, Zoranen_US
dc.contributor.authorKennedy, Kenen_US
dc.contributor.authorMahmeed, Samahen_US
dc.contributor.authorMcCosh, Cherylen_US
dc.contributor.authorRogers , Steveen_US
dc.date.accessioned2017-08-02T22:03:05Zen_US
dc.date.available2017-08-02T22:03:05Zen_US
dc.date.issued2006-08-21en_US
dc.date.noteAugust 21, 2006en_US
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.en_US
dc.format.extent8 ppen_US
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.en_US
dc.identifier.digitalTR07-08en_US
dc.identifier.urihttps://hdl.handle.net/1911/96358en_US
dc.language.isoengen_US
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).en_US
dc.titleScheduling Tasks to Maximize Usage of Aggregate Variables In Placeen_US
dc.typeTechnical reporten_US
dc.type.dcmiTexten_US
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