315 search results - page 34 / 63 » Scheduling with Implicit Information in Distributed Systems |
100
click to vote
SIGMETRICS
2003
ACM
15 years 7 months ago
2003
ACM
It is commonly agreed that scheduling mechanisms in general purpose operating systems do not provide adequate support for modern interactive applications, notably multimedia appli...
193
click to vote
ICDE
2003
IEEE
16 years 3 months ago
2003
IEEE
Distributed databases and other networked information systems use copies or mirrors to reduce latency and to increase availability. Copies need to be refreshed. In a loosely coupl...
132
click to vote
SIGMETRICS
2010
ACM
15 years 5 months ago
2010
ACM
We define CWS, a non-preemptive scheduling policy for workloads with correlated job sizes. CWS tackles the scheduling problem by inferring the expected sizes of upcoming jobs bas...
135
Voted
ICPP
1999
IEEE
1999
IEEE
Multi-Capacity Bin Packing Algorithms with Applications to Job Scheduling under Multiple Constraints
15 years 6 months ago
In past massively parallel processing systems, such as the TMC CM-5 and the CRI T3E, the scheduling problem consisted of allocating a single type of resource among the waiting job...
114
click to vote
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
We will demonstrate distributed conflict resolution in the context of personalized meeting scheduling. The demonstration will show how distributed constraint optimization can be u...