475 search results - page 33 / 95 » Feasible distributed CSP models for scheduling problems |
152
click to vote
JCM
2007
15 years 4 months ago
2007
—Divisible loads are those workloads that can be partitioned by a scheduler into any arbitrary chunks. The problem of scheduling divisible loads has been defined for a long time,...
120
click to vote
CDC
2009
IEEE
15 years 9 months ago
2009
IEEE
— In this paper we use partially ordered sets (posets) to study decentralized control problems arising in different settings. We show that time delayed systems with certain dela...
122
click to vote
TIT
2008
15 years 4 months ago
2008
We address the question of providing throughput guarantees through distributed scheduling, which has remained an open problem for some time. We consider a simple distributed sched...
145
click to vote
TAP
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. This paper extends dynamic symbolic execution to distributed and concurrent systems. Dynamic symbolic execution can be used in software testing to systematically identify...
150
click to vote
EAAI
2006
15 years 4 months ago
2006
This paper presents a feasibility study of evolutionary scheduling for gas pipeline operations. The problem is complex because of several constraints that must be taken into consi...