1095 search results - page 19 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
117
click to vote
ICCAD
2001
IEEE
15 years 6 months ago
2001
IEEE
- Real-time scheduling on processors that support dynamic voltage and frequency scaling is analyzed. The Slacked Earliest Deadling First (SEDF) algorithm is proposed and it is show...
79
Voted
CORR
2010
Springer
14 years 7 months ago
2010
Springer
In time-varying wireless networks, the states of the communication channels are subject to random variations, and hence need to be estimated for efficient rate adaptation and sched...
AI
1998
Springer
14 years 9 months ago
1998
Springer
Given a set of numbers, the two-way partitioning problem is to divide them into two subsets, so that the sum of the numbers in each subset are as nearly equal as possible. The pro...
ICPP
2006
IEEE
15 years 3 months ago
2006
IEEE
These days an increasing number of applications, especially in science and engineering, are dealing with a massive amount of data; hence they are dataintensive. Bioinformatics, da...
ISHPC
2003
Springer
15 years 2 months ago
2003
Springer
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...