1257 search results - page 122 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
103
click to vote
IPPS
2005
IEEE
15 years 7 months ago
2005
IEEE
Divisible load applications consist of a load, that is input data and associated computation, that can be divided arbitrarily into independent pieces. Such applications arise in m...
131
Voted
SIGMETRICS
2010
ACM
15 years 5 months ago
2010
ACM
We define CWS, a non-preemptive scheduling policy for workloads with correlated job sizes. CWS tackles the scheduling problem by inferring the expected sizes of upcoming jobs bas...
133
click to vote
HPCC
2007
Springer
15 years 7 months ago
2007
Springer
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
100
click to vote
ISORC
2003
IEEE
15 years 7 months ago
2003
IEEE
Time triggered methods provide deterministic behaviour suitable for critical real-time systems. They perform less favourably, however, if the arrival times of some activities are ...
122
Voted
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
In the study of PetaFlop project, Processor-In-Memory array was proposed to be a target architecture in achieving 1015 floating point operations per second computing performance. ...