475 search results - page 15 / 95 » Feasible distributed CSP models for scheduling problems |
SAC
2005
ACM
14 years 1 months ago
2005
ACM
In parallel and distributed processing, tasks are ordinarily clustered and assigned to different processors or machines before they are scheduled. The assignment of tasks to proc...
FLAIRS
2008
13 years 9 months ago
2008
Simple Temporal Networks (STNs) are frequently used in scheduling applications, as they provide a powerful and general tool for managing temporal constraints. One obstacle to thei...
CCGRID
2008
IEEE
13 years 9 months ago
2008
IEEE
In the current approaches to workflow scheduling, there is no cooperation between the distributed workflow brokers and as a result, the problem of conflicting schedules occur. To o...
ISCAS
2002
IEEE
14 years 12 days ago
2002
IEEE
Multiple memory module architecture offers higher performance by providing potentially doubled memory bandwidth. Two key problems in gaining high performance in this kind of archi...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
The problem of scheduling independent tasks on heterogeneous trees is considered. The nodes of the tree may have different processing times, and links different communication time...