505 search results - page 36 / 101 » Dynamic Scheduling with Process Migration |
119
click to vote
ISSS
2002
IEEE
15 years 7 months ago
2002
IEEE
We introduce a new approach, “Dynamic Common Sub-expression Elimination (CSE)”, that dynamically eliminates common sub- expressions based on new opportunities created during s...
202
Voted
ICDE
2005
IEEE
16 years 3 months ago
2005
IEEE
Distributed and parallel computing environments are becoming cheap and commonplace. The availability of large numbers of CPU's makes it possible to process more data at highe...
127
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we propose a systematic solution to the problem of scheduling delay-sensitive media data for transmission over time-varying wireless channels. We first formulate th...
111
Voted
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
We are presenting an algorithm for scheduling users in a single-cell broadcast scenario. The presented algorithm aims to minimize the number of transmissions that are necessary to...
119
Voted
PPOPP
1991
ACM
15 years 6 months ago
1991
ACM
Idle workstations in a network represent a significant computing potential. In particular, their processing power can be used by parallel-distributed programs that treat the netwo...