657 search results - page 58 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
CCGRID
2010
IEEE
15 years 28 days ago
2010
IEEE
Applications structured as parallel task graphs exhibit both data and task parallelism, and arise in many domains. Scheduling these applications on parallel platforms has been a lo...
104
click to vote
JCO
2007
14 years 11 months ago
2007
We study a variant of classical scheduling, which is called scheduling with “end of sequence” information. It is known in advance that the last job has the longest processing ...
WAOA
2005
Springer
15 years 5 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
149
click to vote
SOSP
2001
ACM
15 years 8 months ago
2001
ACM
In recent years, there has been a rapid and wide spread of nontraditional computing platforms, especially mobile and portable computing devices. As applications become increasingl...
CISS
2008
IEEE
15 years 6 months ago
2008
IEEE
—We consider the design of a network in which packet transmissions between two nodes are to be guaranteed a certain probability of success. There are N independent paths between ...