Sciweavers

277 search results - page 20 / 56
» Just-In-Time Scheduling with Constraint Programming
Sort
View
ASPLOS
2010
ACM
14 years 2 months ago
A randomized scheduler with probabilistic guarantees of finding bugs
This paper presents a randomized scheduler for finding concurrency bugs. Like current stress-testing methods, it repeatedly runs a given test program with supplied inputs. Howeve...
Sebastian Burckhardt, Pravesh Kothari, Madanlal Mu...
NETWORKING
2004
13 years 9 months ago
Distributed Scheduling of Recording Tasks with Interconnected Servers
We consider a system with multiple interconnected video servers storing TV programs that are received through satellite antennas. Users, equipped with set-top boxes, submit request...
Sergios Soursos, George D. Stamoulis, Theodoros Bo...
AI
2001
Springer
13 years 11 months ago
Learning about Constraints by Reflection
A system's constraints characterizes what that system can do. However, a dynamic environment may require that a system alter its constraints. If feedback about a specific situ...
J. William Murdock, Ashok K. Goel
AIR
2004
130views more  AIR 2004»
13 years 7 months ago
A Hybrid Framework for Over-Constrained Generalized
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fe...
DAC
2003
ACM
14 years 8 months ago
Partial task assignment of task graphs under heterogeneous resource constraints
This paper presents a novel partial assignment technique (PAT) that decides which tasks should be assigned to the same resource without explicitly defining assignment of these tas...
Radoslaw Szymanek, Krzysztof Kuchcinski