3934 search results - page 115 / 787 » Approximate Schedulability Analysis |
176
click to vote
ECRTS
2006
IEEE
16 years 12 days ago
2006
IEEE
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduli...
161
click to vote
RTSS
2005
IEEE
15 years 12 months ago
2005
IEEE
— This paper is interested in reward maximization of periodic real-time tasks under a given energy constraint, where the reward received depends on how much computation a task ru...
166
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
172
click to vote
ASPDAC
2008
ACM
15 years 8 months ago
2008
ACM
Abstract-- We address performance maximization of independent task sets under energy constraint on chip multi-processor (CMP) architectures that support multiple voltage/frequency ...
175
click to vote
ICS
2004
Tsinghua U.
15 years 11 months ago
2004
Tsinghua U.
Storage mapping optimization is a flexible approach to folding array dimensions in numerical codes. It is designed to reduce the memory footprint after a wide spectrum of loop tr...