1758 search results - page 152 / 352 » Schedule processes, not VCPUs |
186
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
199
click to vote
IEEESCC
2008
IEEE
16 years 1 months ago
2008
IEEE
In order to co-ordinate multiple resource providers in grid environment to meet a common objective, support for negotiation is needed to establish a contract between the users and...
189
click to vote
ICALP
2003
Springer
15 years 12 months ago
2003
Springer
We are given a set of jobs each has a processing time, a non-negative weight, a set of possible time intervals in which it can be processed and a cost. The goal is to schedule a f...
173
click to vote
HPDC
1999
IEEE
15 years 11 months ago
1999
IEEE
Efficient and robust metacomputing requires the decomposition of complex jobs into tasks that must be scheduled on distributed processing nodes. There are various ways of creating...
159
click to vote
WDAG
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...