1536 search results - page 241 / 308 » DPS - Dynamic Parallel Schedules |
CPAIOR
2006
Springer
15 years 3 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
CLUSTER
2005
IEEE
15 years 5 months ago
2005
IEEE
Cycle-harvesting systems such as Condor have been developed to make desktop machines in a local area (which are often similar to clusters in hardware configuration) available as ...
SPAA
2009
ACM
15 years 12 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
102
click to vote
SPAA
2009
ACM
15 years 12 months ago
2009
ACM
We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the...
106
click to vote
PPOPP
2010
ACM
15 years 8 months ago
2010
ACM
As concurrent programming becomes prevalent, software providers are investing in concurrency libraries to improve programmer productivity. Concurrency libraries improve productivi...