2582 search results - page 292 / 517 » Scheduling in a Planning Environment |
114
Voted
PPOPP
2010
ACM
15 years 10 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...
112
click to vote
SOFSEM
2010
Springer
15 years 9 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
110
Voted
HPDC
2006
IEEE
15 years 6 months ago
2006
IEEE
Consider a workload in which massively parallel tasks that require large resource pools are interleaved with short tasks that require fast response but consume fewer resources. We...
107
Voted
MEMOCODE
2006
IEEE
15 years 6 months ago
2006
IEEE
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
115
click to vote
EDCC
1999
Springer
15 years 5 months ago
1999
Springer
Abstract. In this paper we present a new modelling approach for dependability evaluation and sensitivity analysis of Scheduled Maintenance Systems, based on a Deterministic and Sto...