475 search results - page 21 / 95 » Feasible distributed CSP models for scheduling problems |
IPPS
2003
IEEE
14 years 23 days ago
2003
IEEE
In this paper we develop a methodology for treating the problem of scheduling partially-ordered tasks on parallel machines. Our framework is based on the timed automaton model, or...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
APNOMS
2007
Springer
14 years 1 months ago
2007
Springer
We propose a greedy algorithm to investigate the problem of how to schedule of a set of feasible transmissions under physical interference model. We also consider the fairness in s...
CLUSTER
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract--This paper proposes an analytical model to estimate the cost of running an affinity-based thread schedule on multicore systems. The model consists of three submodels to e...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules,...