3098 search results - page 351 / 620 » On distributed smooth scheduling |
145
click to vote
JSSPP
2007
Springer
16 years 23 days ago
2007
Springer
Performance evaluation in multi-cluster processor co-allocation - like in many other parallel job scheduling problems- is mostly done by computing the average metric value for the ...
171
click to vote
RTSS
2005
IEEE
16 years 6 days ago
2005
IEEE
Modern operating systems frequently support applications with a variety of timing constraints including hard real-time, soft real-time, and best-effort. To guarantee performance, ...
176
Voted
INFOCOM
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract— We consider stochastic guarantees for networks with aggregate scheduling, in particular, Expedited Forwarding (EF). Our approach on the assumption that a node can be ab...
185
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
161
click to vote
PDPTA
2003
15 years 8 months ago
2003
Current systems for managing workload on clusters of workstations, particularly those available for Linux-based (Beowulf) clusters, are typically based on traditional process-base...