5448 search results - page 435 / 1090 » Breakpoints and Time in Distributed Computations |
180
click to vote
ICPADS
2007
IEEE
16 years 1 months ago
2007
IEEE
We consider a system with a dispatcher and several identical servers in parallel. Task processing times are known upon arrival. We first study the impact of the local scheduling ...
180
click to vote
ICPADS
2006
IEEE
16 years 26 days ago
2006
IEEE
Multi-cluster schedulers can dramatically improve average job turn-around time performance by making use of fragmented node resources available throughout the grid. By carefully m...
178
click to vote
EUC
2004
Springer
16 years 7 days ago
2004
Springer
We propose power-aware on-line task scheduling algorithms for mixed task sets which consist of both periodic and aperiodic tasks. The proposed algorithms utilize the execution beha...
174
click to vote
IJHPCA
2008
15 years 6 months ago
2008
Many Grid applications involve combining computational and data access components into complex workflows. A distinction is generally made between mechanisms to compose components ...
190
click to vote
PPOPP
1999
ACM
15 years 11 months ago
1999
ACM
A central problem in executing performance critical parallel and distributed applications on shared networks is the selection of computation nodes and communication paths for exec...