Sciweavers

794 search results - page 40 / 159
» Stackelberg scheduling strategies
Sort
View
SPAA
2010
ACM
15 years 2 months ago
Brief announcement: locality-aware load balancing for speculatively-parallelized irregular applications
Load balancing is an important consideration when running data-parallel programs. While traditional techniques trade off the cost of load imbalance with the overhead of mitigating...
Youngjoon Jo, Milind Kulkarni
CORR
2010
Springer
101views Education» more  CORR 2010»
14 years 10 months ago
Finite Optimal Control for Time-Bounded Reachability in CTMDPs and Continuous-Time Markov Games
We establish the existence of optimal scheduling strategies for time-bounded reachability in continuous-time Markov decision processes, and of co-optimal strategies for continuous-...
Markus Rabe, Sven Schewe
ANCS
2005
ACM
15 years 3 months ago
Group round robin: improving the fairness and complexity of packet scheduling
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
Bogdan Caprita, Jason Nieh, Wong Chun Chan
VLDB
2004
ACM
128views Database» more  VLDB 2004»
15 years 10 months ago
Operator scheduling in data stream systems
In many applications involving continuous data streams, data arrival is bursty and data rate fluctuates over time. Systems that seek to give rapid or realtime query responses in su...
Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev ...
IPPS
2008
IEEE
15 years 4 months ago
Large-scale experiment of co-allocation strategies for Peer-to-Peer supercomputing in P2P-MPI
High Performance computing generally involves some parallel applications to be deployed on the multiples resources used for the computation. The problem of scheduling the applicat...
Stéphane Genaud, Choopan Rattanapoka