1257 search results - page 201 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
Stigmergy is usually associated with semantically simple problems such as routing. It can be applied to more complex problems by encoding them in the environment through which sti...
119
click to vote
HPDC
2008
IEEE
15 years 4 months ago
2008
IEEE
The emergence of heterogeneous many core architectures presents a unique opportunity for delivering order of magnitude performance increases to high performance applications by ma...
GRID
2007
Springer
15 years 4 months ago
2007
Springer
—Due to the dynamic nature of grid environments, schedule algorithms always need assistance of a long-time-ahead load prediction to make decisions on how to use grid resources ef...
WOSP
2005
ACM
15 years 3 months ago
2005
ACM
Advances in Internet and the availability of powerful computers and high-speed networks have propitiated the rise of Grids. The scheduling of applications is complex in Grids due ...
GPC
2009
Springer
15 years 2 months ago
2009
Springer
A typical grid application requires several processors for execution that may not be fulfilled by single cluster at times. Co-allocation is the concept of aggregating computing res...