1257 search results - page 136 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
113
click to vote
FTDCS
1999
IEEE
15 years 6 months ago
1999
IEEE
The impact of buffer management and priority scheduling is examined in stressful scenarios when the aggregate incoming traffic is higher than the output link capacity of an Asynch...
123
click to vote
HCW
1999
IEEE
15 years 6 months ago
1999
IEEE
A major challenge in Metacomputing Systems (Computational Grids) is to effectively use their shared resources, such as compute cycles, memory, communication network, and data repo...
123
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
A real-time system must execute functionally correct computations in a timely manner. In order to guarantee that all tasks accepted in the system will meet their timing requiremen...
119
click to vote
ISPDC
2007
IEEE
15 years 8 months ago
2007
IEEE
Mixed-parallel applications can take advantage of largescale computing platforms but scheduling them efficiently on such platforms is challenging. In this paper we compare the tw...
118
click to vote
IPPS
2010
IEEE
14 years 11 months ago
2010
IEEE
We consider the problem of scheduling jobs on a pool of machines. Each job requires multiple machines on which it executes in parallel. For each job, the input specifies release ti...