790 search results - page 48 / 158 » Limits of Work-Stealing Scheduling |
106
Voted
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
We describe a peer-to-peer self-organizing overlay network for our global computing system. The preliminary simulation results show that the network has some smallworld characteri...
101
click to vote
WSC
1998
15 years 1 months ago
1998
The manufacture of pre-cast concrete building elements consists of a few manufacturing steps. The process itself is simple, but the characteristics of the business are quite rando...
SIGMETRICS
2008
ACM
15 years 14 days ago
2008
ACM
We consider the round robin (RR) scheduling policy where the server processes each job in its buffer for at most a fixed quantum, q, in a round-robin fashion. The processor sharin...
128
click to vote
CLUSTER
2010
IEEE
14 years 4 months ago
2010
IEEE
Many-task computing aims to bridge the gap between two computing paradigms, high throughput computing and high performance computing. Many-task computing denotes highperformance co...
105
Voted
ATAL
2011
Springer
14 years 17 days ago
2011
Springer
In response to the Mumbai attacks of 2008, the Mumbai police have started to schedule a limited number of inspection checkpoints on the road network throughout the city. Algorithm...