475 search results - page 39 / 95 » Feasible distributed CSP models for scheduling problems |
259
click to vote
DCOSS
2011
Springer
14 years 5 months ago
2011
Springer
—Given a set of sensor nodes V where each node wants to broadcast a message to all its neighbors that are within a certain broadcasting range, the local broadcasting problem is t...
165
click to vote
APPT
2009
Springer
16 years 18 days ago
2009
Springer
Abstract. With more cores integrated into one single chip, the overall power consumption from the multiple concurrent running programs increases dramatically in a CMP processor whi...
170
click to vote
SPAA
2005
ACM
15 years 11 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...
167
click to vote
SRDS
2006
IEEE
16 years 10 hour ago
2006
IEEE
We consider the problem of recovering from failures of distributable threads with assured timeliness. When a node hosting a portion of a distributable thread fails, it causes orph...
204
click to vote
ISPAN
2002
IEEE
15 years 11 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...