500 search results - page 51 / 100 » Process Scheduling for the Parallel Desktop |
ISSAC
2007
Springer
14 years 3 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
EUROPAR
2007
Springer
14 years 3 months ago
2007
Springer
In Grid systems, nontrivial qualities of service have to be provided to users by the resource providers. However, resource management in a decentralized infrastructure is a complex...
PPOPP
2009
ACM
14 years 9 months ago
2009
ACM
Fairness is an essential requirement of any operating system scheduler. Unfortunately, existing fair scheduling algorithms are either inaccurate or inefficient and non-scalable fo...
SPAA
2005
ACM
14 years 2 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
ECAI
2004
Springer
14 years 2 months ago
2004
Springer
In this paper we describe IPSS (Integrated Planning and Scheduling System), a domain independent solver that integrates an AI heuristic planner, that synthesizes courses of actions...