71 search results - page 9 / 15 » Improved Approximations for Multiprocessor Scheduling Under ... |
100
Voted
ICTAI
2009
IEEE
14 years 8 months ago
2009
IEEE
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
SC
2009
ACM
15 years 5 months ago
2009
ACM
Proponents of utility-based scheduling policies have shown the potential for a 100–1400% increase in value-delivered to users when used in lieu of traditional approaches such as...
103
Voted
ECAI
1998
Springer
15 years 3 months ago
1998
Springer
Progressive processing allows a system to satisfy a set of requests under time pressure by limiting the amount of processing allocated to each task based on a predefined hierarchic...
IJHPCA
2006
14 years 11 months ago
2006
Effective communication between user and scheduler is an important prerequisite to achieving a successful scheduling outcome from both parties' perspectives. In a grid or sta...
100
Voted
PPOPP
2010
ACM
15 years 8 months ago
2010
ACM
We present Lazy Binary Splitting (LBS), a user-level scheduler of nested parallelism for shared-memory multiprocessors that builds on existing Eager Binary Splitting work-stealing...